Solving the Capacitated Vehicle Routing Problem Based on Improved Ant-clustering Algorithm

Solving the Capacitated Vehicle Routing Problem Based on Improved Ant-clustering Algorithm

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...

Full description

Bibliographic Details
Main Authors: Zhang Jiashan, Lin Xiaoqun, Jun Yi, Li Qiang
Format: Article
Language:English
Published: EDP Sciences 2015-01-01
Series:MATEC Web of Conferences
Subjects:
CVRP
three-phase heuristic
ant-clustering algorithm
genetic algorithm
Online Access:http://dx.doi.org/10.1051/matecconf/20152203022

Internet

http://dx.doi.org/10.1051/matecconf/20152203022

Similar Items