Metaheuristics for vehicle routing problems with three-dimensional loading constraints

This paper addresses an important combination of three-dimensional loading and vehicle routing, known as the Three-Dimensional Loading Capacitated Vehicle Routing Problem. The problem calls for the combined optimization of the loading of freight into vehicles and the routing of vehicles along a road...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2010-03, Vol.201 (3), p.751-759
Main Authors: Fuellerer, Guenther, Doerner, Karl F., Hartl, Richard F., Iori, Manuel
Format: Article
Language:English
Subjects:
Ant Colony Optimization
Applied sciences
Exact sciences and technology
Flows in networks. Combinatorial problems
Freight
Ground, air and sea transportation, marine construction
Heuristic
Logistics
Operational research and scientific management
Operational research. Management science
Optimization algorithms
Packing problem
Road transportation and traffic
Routing
Studies
Three-dimensional packing
Transportation problem (Operations research)
Vehicle routing
Vehicle routing Ant Colony Optimization Three-dimensional packing
Vehicles
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper addresses an important combination of three-dimensional loading and vehicle routing, known as the Three-Dimensional Loading Capacitated Vehicle Routing Problem. The problem calls for the combined optimization of the loading of freight into vehicles and the routing of vehicles along a road network, with the aim of serving customers with minimum traveling cost. Despite its clear practical relevance in freight distribution, the literature on this problem is very limited. This is because of its high combinatorial complexity. We solve the problem by means of an Ant Colony Optimization algorithm, which makes use of fast packing heuristics for the loading. The algorithm combines two different heuristic information measures, one for routing and one for packing. In numerical tests all publicly available test instances are solved, and for almost all instances new best solutions are found.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2009.03.046