A hybrid approach for the vehicle routing problem with three-dimensional loading constraints

Authors:
Qingfang Ruan;Zhengqian Zhang;Lixin Miao;Haitao Shen
Affiliations:
Research Center for Modern Logistics, Graduate School at Shenzhen, Tsinghua University, 518055 Shenzhen, China and International Commercial Department, Shenzhen Institute of Technology, 518045 She ...;Shenzhen Uway Science Technology Research Center, High-tech, Nanshan District, 518055 Shenzhen, China;Research Center for Modern Logistics, Graduate School at Shenzhen, Tsinghua University, 518055 Shenzhen, China;Shenzhen Uway Science Technology Research Center, High-tech, Nanshan District, 518055 Shenzhen, China
Venue:
Computers and Operations Research
Year:
2013

Citing 19
Cited 0

The vehicle routing problem

The vehicle routing problem
Optimal routing of multiple-load AGV subject to LIFO loading constraints

Computers and Operations Research
A GRASP Approach to the Container-Loading Problem

IEEE Intelligent Systems
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem

Mathematical Programming: Series A and B
A Tabu Search Algorithm for a Routing and Container Loading Problem

Transportation Science
A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints

Networks - Special Issue In Memory of Stefano Pallottino
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts

Mathematical Programming: Series A and B
The pickup and delivery traveling salesman problem with first-in-first-out loading

Computers and Operations Research
An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints

Transportation Science
Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading

INFORMS Journal on Computing
A unified exact method for solving different classes of vehicle routing problems

Mathematical Programming: Series A and B
A Survey on Vehicle Routing Problem with Loading Constraints

CSO '09 Proceedings of the 2009 International Joint Conference on Computational Sciences and Optimization - Volume 02
Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading

Computers and Operations Research
A hybrid metaheuristic algorithm for the integrated vehicle routing and three-dimensional container-loading problem

IEEE Transactions on Intelligent Transportation Systems
Honey Bees Mating Optimization algorithm for large scale vehicle routing problems

Natural Computing: an international journal
The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs

Transportation Science
Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem

Computers and Operations Research
Exact solutions to the double travelling salesman problem with multiple stacks

Networks
Three-dimensional container loading models with cargo stability and load bearing constraints

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper addresses a recently practical combinatorial problem named Three-Dimensional Loading Capacitated Vehicle Routing Problem, which combines three-dimensional loading problem and vehicle routing problem in distribution logistics. The problem requires a combinatorial optimization of a feasible loading and successive routing of vehicles to satisfy customer demands, where all vehicles must start and finish at a central depot. The goal of this combinatorial problem is to minimize the total transportation cost while serving customers. Despite its clearly practical significance in the real world distribution management, for its high combinatorial complexity, published papers on this problem in literature are very limited. We present a hybrid approach which combines Honey Bee Mating Optimization and six loading heuristics, one for vehicle routing and the other for three-dimensional loading, to solve the integrated problem. We computationally evaluate this hybrid approach on all publicly available test instances, and obtain new best solutions for several scenarios.