The vehicle routing problem
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
INFORMS Journal on Computing
3-D Container Packing Heuristics
Applied Intelligence
Proceedings of the 2005 ACM symposium on Applied computing
A Tabu Search Algorithm for a Routing and Container Loading Problem
Transportation Science
The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
IEEE Transactions on Computers
A Maximal-Space Algorithm for the Container Loading Problem
INFORMS Journal on Computing
A Tree Search Algorithm for Solving the Container Loading Problem
INFORMS Journal on Computing
An optimal algorithm for rectangle placement
Operations Research Letters
Local search for a multi-drop multi-container loading problem
Journal of Heuristics
Local search techniques for a routing-packing problem
Computers and Industrial Engineering
Hi-index | 0.00 |
In this paper, we describe two heuristics for the Single Vehicle Loading Problem (SVLP), which can handle practical constraints that are frequently encountered in the freight transportation industry, such as the servicing order of clients; item fragility; and the stability of the goods. The two heuristics, Deepest-Bottom-Left-Fill and Maximum Touching Area, are 3D extensions of natural heuristics that have previously only been applied to 2D packing problems. We employ these heuristics as part of a two-phase tabu search algorithm for the Three-Dimensional Loading Capacitated Vehicle Routing Problem (3L-CVRP), where the task is to serve all customers using a homogeneous fleet of vehicles at minimum traveling cost. The resultant algorithm produces mostly superior solutions to existing approaches, and appears to scale better with problem size.