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

A novel three-phase heuristic approach for the capacitated vehicle routing problem, in which the adaptive strategy is adopted and the simulation indicates the algorithm attains high-quality results in a short time. 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 clus- ters. The simulation indicates the algorithm attains high-quality results in a short time.

Ant colony optimization algorithms - Wikipedia

PDF] Distance based Sweep Nearest Algorithm to Solve Capacitated

PDF] A population based simulated annealing algorithm for

A hybrid ant colony optimization with fireworks algorithm to solve

PDF) Simulated annealing algorithm for solving the capacitated

PDF] Solving the Vehicle Routing Problem with Simultaneous Pickup

Full article: Constrained Clustering for the Capacitated Vehicle

PDF) A Hybrid Ant Colony Optimization(HACO) for Solving

An Improved Clarke and Wright Algorithm To Solve The Capacitated