Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Solving the Packing and Strip-Packing Problems with Genetic Algorithms
IWANN '99 Proceedings of the International Work-Conference on Artificial and Natural Neural Networks: Foundations and Tools for Neural Modeling
The Rectangular Packing Problem: Local Optimum Search Methods Based on Block Structures
Automation and Remote Control
An Exact Approach to the Strip-Packing Problem
INFORMS Journal on Computing
Exhaustive approaches to 2D rectangular perfect packings
Information Processing Letters
A new heuristic recursive algorithm for the strip rectangular 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
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 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
Tabu search with consistent neighbourhood for strip packing
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part I
A Reinforced Tabu Search Approach for 2D Strip Packing
International Journal of Applied Metaheuristic Computing
| Hi-index | 0.00 |
This paper introduces a new tabu search algorithm for a two-dimensional (2D) Strip Packing Problem (2D-SPP). It integrates several key features: A direct representation of the problem, a satisfaction-based solving scheme, two different complementary neighborhoods, a diversification mechanism and a particular tabu structure. The representation allows inexpensive basic operations. The solving scheme considers the 2D-SPP as a succession of satisfaction problems. The goal of the combination of two neighborhoods is (to try) to reduce the height of the packing while avoiding solutions with (hard to fill) tall and thin wasted spaces. Diversification relies on a set of historically "interesting" packings. The tabu structure avoids visiting similar packings. To assess the proposed approach, experimental results are shown on a set of well-known benchmark instances and compared with previously reported tabu search algorithms as well as the best performing algorithms.