A hybrid optimization approach for layout design of unequal-area facilities
Computers and Industrial Engineering
Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
An Exact Approach to the Strip-Packing Problem
INFORMS Journal on Computing
On strip packing With rotations
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Hyper-heuristics and classifier systems for solving 2D-regular cutting stock problems
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A new constraint programming approach for the orthogonal packing problem
Computers and Operations Research
Reactive GRASP for the strip-packing problem
Computers and Operations Research
The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
IEEE Transactions on Computers
Incremental Move for 2D Strip-Packing
ICTAI '07 Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence - Volume 02
New resolution algorithm and pretreatments for the two-dimensional bin-packing problem
Computers and Operations Research
Collaboration Between Hyperheuristics to Solve Strip-Packing Problems
IFSA '07 Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing
A Dedicated Genetic Algorithm for Two-Dimensional Non-Guillotine Strip Packing
MICAI '07 Proceedings of the 2007 Sixth Mexican International Conference on Artificial Intelligence, Special Session
A Tabu Search Algorithm with Direct Representation for Strip Packing
EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem
INFORMS Journal on Computing
Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
| Hi-index | 0.00 |
This paper discusses a particular "packing" problem, namely the two dimensional strip packing problem, where a finite set of objects have to be located in a strip of fixed width and infinite height. The variant studied considers regular items, rectangular to be precise, that must be packed without overlap, not allowing rotations. The objective is to minimize the height of the resulting packing. In this regard, the authors present a local search algorithm based on the well-known tabu search metaheuristic. Two important components of the presented tabu search strategy are reinforced in attempting to include problem knowledge. The fitness function incorporates a measure related to the empty spaces, while the diversification relies on a set of historically "frozen" objects. The resulting reinforced tabu search approach is evaluated on a set of well-known hard benchmark instances and compared with state-of-the-art algorithms.