A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem
From MaRDI portal
Publication:1665961
DOI10.1155/2015/541931zbMath1394.68356OpenAlexW2006997081WikidataQ59119239 ScholiaQ59119239MaRDI QIDQ1665961
Bili Chen, Shuangyuan Yang, Wang Yong
Publication date: 27 August 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/541931
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (2)
A hybrid algorithm based on variable neighbourhood for the strip packing problem ⋮ VCS: A new heuristic function for selecting boxes in the single container loading problem
Cites Work
- A hybrid heuristic algorithm for the 2D variable-sized bin packing problem
- A squeaky wheel optimisation methodology for two-dimensional strip packing
- Reactive GRASP for the strip-packing problem
- A least wasted first heuristic algorithm for the rectangular packing problem
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- On genetic algorithms for the packing of polygons
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- A review of the application of meta-heuristic algorithms to 2D strip packing problems
- Two-dimensional packing problems: a survey
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A new heuristic recursive algorithm for the strip rectangular packing problem
- An improved typology of cutting and packing problems
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- An Exact Approach to the Strip-Packing Problem
- A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Two-Dimensional Finite Bin-Packing Algorithms
- Orthogonal Packings in Two Dimensions
- An Algorithm for Two-Dimensional Cutting Problems
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- One-dimensional heuristics adapted for two-dimensional rectangular strip packing
- New heuristic and interactive approaches to 2D rectangular strip packing
This page was built for publication: A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem