Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An Exact Approach to the Strip-Packing Problem
INFORMS Journal on Computing
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
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 meta-heuristic algorithm for the strip rectangular packing problem
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
| Hi-index | 0.00 |
This paper introduces a new tabu search algorithm for a strip packing problem. It integrates several key features: A consistent neighborhood, a fitness function including problem knowledge, and a diversification based on the history of the search. The neighborhood only considers valid, sometimes partial, packings. The fitness function incorporates measures related to the empty spaces. Diversification relies on a set of historically "frozen" objects. Experimental results are shown on a set of well-known hard instances and compared with previously reported tabu search algorithms as well as the best performing algorithms.