A lower bound for the non-oriented two-dimensional bin packing problem
Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
Recent advances on two-dimensional bin packing problems
Discrete Applied Mathematics
New lower bounds for the three-dimensional finite bin packing problem
Discrete Applied Mathematics
INFORMS Journal on Computing
A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
INFORMS Journal on Computing
A Tabu Search Algorithm for a Routing and Container Loading Problem
Transportation Science
A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
Computers and Operations Research
Production design for plate products in the steel industry
IBM Journal of Research and Development - Business optimization
New resolution algorithm and pretreatments for the two-dimensional bin-packing problem
Computers and Operations Research
Batchless layout optimization used in the glass tempering process
COMPUCHER'07 Proceedings of the 1st WSEAS International Conference on Computational Chemistry
Optimization Methods & Software
Ant colony optimization for the two-dimensional loading vehicle routing problem
Computers and Operations Research
A least wasted first heuristic algorithm for the rectangular packing problem
Computers and Operations Research
Computers and Operations Research
Selecting highly optimal architectural feature sets with Filtered Cartesian Flattening
Journal of Systems and Software
An optimisation model for airlift load planning: GALAHAD and the quest for the 'holy grail'
CISDA'09 Proceedings of the Second IEEE international conference on Computational intelligence for security and defense applications
An agent-based approach to knapsack optimization problems
IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems
Two natural heuristics for 3D packing with practical loading constraints
PRICAI'10 Proceedings of the 11th Pacific Rim international conference on Trends in artificial intelligence
A squeaky wheel optimisation methodology for two-dimensional strip packing
Computers and Operations Research
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Computers and Operations Research
Maximizing revenue with allocation of multiple advertisements on a Web banner
Computers and Operations Research
New three-level resource management enhancing quality of offline hardware task placement on FPGA
International Journal of Reconfigurable Computing
New fast heuristics for the 2d strip packing problem with guillotine constraint
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
A hybrid heuristic algorithm for the rectangular packing problem
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
Solving the two-dimensional bin packing problem with a probabilistic multi-start heuristic
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Space defragmentation heuristic for 2D and 3D bin packing problems
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
The two-dimensional bin packing problem with variable bin sizes and costs
Discrete Optimization
The Pallet-Packing Vehicle Routing Problem
Transportation Science
Computers and Operations Research
A simple randomized algorithm for two-dimensional strip packing
Computers and Operations Research
Planning in logistics: a survey
Proceedings of the 10th Performance Metrics for Intelligent Systems Workshop
Heuristics for the strip packing problem with unloading constraints
Computers and Operations Research
SEAL'12 Proceedings of the 9th international conference on Simulated Evolution and Learning
Expert Systems with Applications: An International Journal
INFORMS Journal on Computing
Local search techniques for a routing-packing problem
Computers and Industrial Engineering
| Hi-index | 0.01 |
Two-dimensional bin packing problems consist of allocating, without overlapping, a given set of small rectangles (items) to a minimum number of large identical rectangles (bins), with the edges of the items parallel to those of the bins. According to the specific application, the items may either have a fixed orientation or they can be rotated by 90°. In addition, it may or not be imposed that the items are obtained through a sequence of edge-to-edge cuts parallel to the edges of the bin. In this article, we consider the class of problems arising from all combinations of the above requirements. We introduce a new heuristic algorithm for each problem in the class, and a unified tabu search approach that is adapted to a specific problem by simply changing the heuristic used to explore the neighborhood. The average performance of the single heuristics and of the tabu search are evaluated through extensive computational experiments.