Heuristic algorithms for the three-dimensional bin packing problem

2002 ◽  
Vol 141 (2) ◽  
pp. 410-420 ◽  
Author(s):  
Andrea Lodi ◽  
Silvano Martello ◽  
Daniele Vigo
Keyword(s):  
Bin Packing ◽  
Heuristic Algorithms ◽  
Three Dimensional ◽  
Packing Problem ◽  
Bin Packing Problem

Improved Packing Representation Model for the Orthogonal Packing Problem

2013 ◽  
Vol 390 ◽  
pp. 591-595 ◽  
Author(s):  
Alexander V. Chekanin ◽  
Vladislav A. Chekanin
Keyword(s):  
Bin Packing ◽  
Optimal Allocation ◽  
Heuristic Algorithms ◽  
Three Dimensional ◽  
Packing Problem ◽  
Representation Model ◽  
Bin Packing Problem ◽  
Applied Software ◽  
Proposed Model ◽  
Orthogonal Packing Problem

The multidimensional NP-hard orthogonal bin packing problem is considered in the article. Usually the problem is solved using heuristic algorithms of discrete optimization which optimize a selection sequence of objects to be packed in containers. The quality and speed of getting the resulting packing for a given sequence of placing objects is determined by the used packing representation model. In the article presented a new packing representation model for constructing the orthogonal packing. The proposed model of potential containers describes all residual free spaces of containers in packing. The developed model is investigated on well-known standard benchmarks of three-dimensional orthogonal bin packing problem. The model can be used in development of applied software for the optimal allocation of orthogonal resources.

Guided Local Search for the Three-Dimensional Bin-Packing Problem

2003 ◽  
Vol 15 (3) ◽  
pp. 267-283 ◽  
Author(s):  
Oluf Faroe ◽  
David Pisinger ◽  
Martin Zachariasen
Keyword(s):  
Local Search ◽  
Bin Packing ◽  
Three Dimensional ◽  
Packing Problem ◽  
Guided Local Search ◽  
Bin Packing Problem

scholarly journals Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems

2005 ◽  
Vol 53 (4) ◽  
pp. 735-736 ◽  
Author(s):  
Edgar den Boef ◽  
Jan Korst ◽  
Silvano Martello ◽  
David Pisinger ◽  
Daniele Vigo
Keyword(s):  
Bin Packing ◽  
Three Dimensional ◽  
Packing Problem ◽  
Packing Problems ◽  
Bin Packing Problem

Heuristic Algorithms

2012 ◽  
pp. 238-267
Author(s):  
Laura Cruz Reyes ◽  
Claudia Gómez Santillán ◽  
Marcela Quiroz ◽  
Adriana Alvim ◽  
Patricia Melin ◽  
...  
Keyword(s):  
Large Scale ◽  
Bin Packing ◽  
Heuristic Algorithms ◽  
Packing Problem ◽  
Transportation System ◽  
Deterministic Algorithm ◽  
Computational Time ◽  
Routing Problem ◽  
Bin Packing Problem ◽  
Truck Loading

This chapter approaches the Truck Loading Problem, which is formulated as a rich problem with the classic one dimensional Bin Packing Problem (BPP) and five variants. The literature review reveals that related work deals with three variants at the most. Besides, few efforts have been done to combine the Bin Packing Problem with the Vehicle Routing Problem. For the solution of this new Rich BPP a heuristic-deterministic algorithm, named DiPro, is proposed. It works together with a metaheuristic algorithm to plan routes, schedules and loads. The objective of the integrated problem, called RoSLoP, consists of optimizing the delivery process of bottled products in a real application. The experiments show the performance of three version of the Transportation System. The best version achieves a total demand satisfaction, an average saving of three vehicles and a reduction of the computational time from 3 hrs to two minutes regarding their manual solution. For the large scale the authors have develop a competitive genetic algorithm for BPP. As future work, it is intended integrate the approximation algorithm to the transportation system.

Sign in / Sign up

Export Citation Format

Share Document