Solving Full-Vehicle-Mode Vehicle Routing Problems Using ACO

摘要

The capacitated vehicle routing problem is a very classic but simple type of vehicle routing problem (VRP). There are variants of the VRP in practice based on different constraints which are called rich VRP (RVRP). In this article, variants of the VRP, including fixed vehicle types and dynamic vehicle type combinations are analyzed. An improved ant colony optimization (ACO) algorithm is designed to resolve this group of VRPs. The fixed vehicle type VRP, homogenous fleet VRP and heterogeneous fleet VRP are defined by one or multiple vehicle types in RVRP. Because of the evolution of transportation equipment, some new vehicle types such as truck and full trailer as well as tractor and semitrailer are introduced. The static and dynamic usages of different vehicle types vary with the business operations. We define this kind of VRPs as full-vehicle-mode (FVM) VRP in this paper. The associated ACO algorithm is developed to solve FVM-VRP problems. Computational experiments are performed and the results are presented to demonstrate the efficiency of the proposed algorithm.