A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP

Authors:
Wenbin Zhu;Hu Qin;Andrew Lim;Lei Wang
Affiliations:
Department of Computer Science and Engineering, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong;School of Management, Huazhong University of Science and Technology, No. 1037, Luoyu Road, Wuhan, China and Department of Management Sciences, City University of Hong Kong, Tat Chee Ave, Kowloon T ...;Department of Management Sciences, City University of Hong Kong, Tat Chee Ave, Kowloon Tong, Hong Kong;Department of Computer Science, School of Information Science and Technology, Zhongshan (Sun Yat-Sen) University, Guangzhou, Guangdong 510275, PR China and Department of Management Sciences, City ...
Venue:
Computers and Operations Research
Year:
2012

Citing 14
Cited 1

A recursive computational procedure for container loading

Proceedings of the 23rd international conference on on Computers and industrial engineering
The Three-Dimensional Bin Packing Problem

Operations Research
3-D Container Packing Heuristics

Applied Intelligence
The container loading problem

Proceedings of the 2005 ACM symposium on Applied computing
Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem

ACM Transactions on Mathematical Software (TOMS)
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 Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints

Networks - Special Issue In Memory of Stefano Pallottino
An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints

Transportation Science
An Exact Algorithm for Higher-Dimensional Orthogonal Packing

Operations Research
A Maximal-Space Algorithm for the Container Loading Problem

INFORMS Journal on Computing
A hybrid metaheuristic algorithm for the integrated vehicle routing and three-dimensional container-loading problem

IEEE Transactions on Intelligent Transportation Systems
A Tree Search Algorithm for Solving the Container Loading Problem

INFORMS Journal on Computing
An optimal algorithm for rectangle placement

Operations Research Letters

A tree-based tabu search algorithm for the manpower allocation problem with time windows and job-teaming constraints

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.01

Visualization

Abstract

The Three-Dimensional Loading Capacitated Vehicle Routing Problem (3L-CVRP) addresses practical constraints frequently encountered in the freight transportation industry. In this problem, the task is to serve all customers using a homogeneous fleet of vehicles at minimum traveling cost. The constraints imposed by the three-dimensional shape of the goods, the unloading order, item fragility, and the stability of the loading plan of each vehicle are explicitly considered. We improved two well-known packing heuristics, namely the Deepest-Bottom-Left-Fill heuristic and the Maximum Touching Area heuristic, for the three-dimensional loading sub-problem and provided efficient implementations. Based on these two new heuristics, an effective tabu search algorithm is given to address the overall problem. Computational experiments on publicly available test instances show our new approach outperforms the current best algorithms for 20 out of 27 instances. Our approach is also superior to the existing algorithm on benchmark data for the closely related problem variant M3L-CVRP (which uses a slightly different unloading order constraint compared to 3L-CVRP).