Solving the Capacitated Vehicle Routing Problem Based on Improved Ant-clustering Algorithm
1 Chongqing Vocational Institute of Engineering, Jiangjin, Chongqing, China
2 College of Business Administration, Chongqing Science and Technology University, Chongqing, China
* Corresponding author: email@example.com
The capacitated vehicle routing problems (CVRP) are NP-hard. Most approaches can solve small-scale case studies to optimality. Furthermore, they are time-consuming. To overcome the limitation, this paper presents a novel three-phase heuristic approach for the capacitated vehicle routing problem. The first phase aims to identify sets of cost-effective feasible clusters through an improved ant-clustering algorithm, in which the adaptive strategy is adopted. The second phase assigns clusters to vehicles and sequences them on each tour. The third phase orders nodes within clusters for every tour and genetic algorithm is used to order nodes within clusters. The simulation indicates the algorithm attains high quality results in a short time.
Key words: CVRP / three-phase heuristic / ant-clustering algorithm / genetic algorithm
© Owned by the authors, published by EDP Sciences, 2015
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.