Hierarchical Search-Embedded Hybrid Heuristic Algorithm for Two-Dimensional Strip Packing Problem
Two dimensional strip packing problem implies a sort of NP-hard combinational optimization, where a set of rectangles are defined all for filling a strip with finite width and infinite height being minimized. Optimization taking no account of rotation and guillotine constraints remains problematic i...
Main Authors: | Mengfan Chen, Kai Li, Defu Zhang, Ling Zheng, Xin Fu |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8901176/ |
Similar Items
-
A SURVEY ON HEURISTICS FOR THE TWO-DIMENSIONAL RECTANGULAR STRIP PACKING PROBLEM
by: José Fernando Oliveira, et al. -
A dichotomous search-based heuristic for the three-dimensional sphere packing problem
by: Mhand Hifi, et al.
Published: (2015-12-01) -
Heuristics for offline rectangular packing problems
by: Ortmann, Frank
Published: (2010) -
Multiple Black Hole Inspired Meta-Heuristic Searching Optimization for Combinatorial Testing
by: Hamsa Naji Nsaif Al-Sammarraie, et al.
Published: (2020-01-01) -
A Study of Evolutionary Algorithm Selection Hyper-Heuristics for the One-Dimensional Bin-Packing Problem
by: Nelishia Pillay
Published: (2012-06-01)