Journal Article10.1016/J.COR.2005.12.005
A new heuristic algorithm for rectangle packing
108
TL;DR: A new heuristic algorithm is recommended based on two important concepts, namely, the corner-occupying action and caving degree, which is fairly efficient for solving the rectangle packing problem.
read more
About: This article is published in Computers & Operations Research. The article was published on 01 Nov 2007. The article focuses on the topics: Bin packing problem & Heuristic (computer science).
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Integrated layout design of multi‐component system
TL;DR: In this article, a new integrated layout optimization method is proposed for the design of multi-component systems by introducing movable components into the design domain, the components layout and the supporting structural topology are optimized simultaneously.
133
A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
TL;DR: A constructive heuristic algorithm is developed to generate a solution to the rectangle knapsack packing problem, and a greedy strategy is used to search a better solution.
107
A least wasted first heuristic algorithm for the rectangular packing problem
TL;DR: The experimental results show that the presented algorithm can achieve an optimal solution within reasonable time and is fairly efficient for dealing the rectangular packing problem.
105
A caving degree approach for the single container loading problem
Wenqi Huang,Kun He +1 more
TL;DR: A new heuristic approach is proposed for solving the three-dimensional single container loading problem and its key issue is to pack the outside item into a corner or even a cave in the container such that the item is as compactly and closely as possible with other packed items.
91
A two-stage intelligent search algorithm for the two-dimensional strip packing problem
TL;DR: In this article, a two-stage intelligent search algorithm for a 2D strip packing problem without guillotine constraint is presented. But the complexity of the algorithm is not discussed.
90
References
TCG: a transitive closure graph-based representation for non-slicing floorplans
Jai-Ming Lin,Yao-Wen Chang +1 more
- 22 Jun 2001
TL;DR: The geometric relation among modules is transparent not only to the TCG representation but also to its operations, facilitating the convergence to a desired solution, and makes TCG an effective and flexible representation for handling the general floorplan/placement design problems with various constraints.
An Exact Algorithm for Higher-Dimensional Orthogonal Packing
TL;DR: In this article, a two-level tree search algorithm for solving higher-dimensional orthogonal packing problems to optimality is presented. But this algorithm is not optimal for all two-dimensional test problems from recent literature.
A genetic algorithm for a 2D industrial packing problem
E. Hopper,B. Turton +1 more
- 01 Oct 1999
TL;DR: In this paper two genetic algorithms are described for a rectangular packing problem, both of which are hybridised with a heuristic placement algorithm, one of which is the well-known Bottom-Left routine.
179
The two-dimensional bin packing problem with variable bin sizes and costs
David Pisinger,Mikkel M. Sigurd +1 more
TL;DR: An integer-linear formulation of the 2DVSBPP is presented and several lower bounds for the problem are introduced, by using Dantzig-Wolfe decomposition, to obtain lower bounds of very good quality.
165
An effective quasi-human based heuristic for solving the rectangle packing problem
TL;DR: An effective deterministic heuristic, Less Flexibility First, is introduced for solving the classical NP-complete rectangle packing problem, and can consistently produce packing densities of around 99% on most randomly generated large examples.
131