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.

A survey of genetic algorithms for solving multi depot vehicle

PDF] Solving Capacitated Vehicle Routing Problem Using Variant

Mathematics, Free Full-Text

PDF] Improved K-Means Algorithm for Capacitated Clustering Problem

PDF] An Improved Clarke and Wright Algorithm to Solve the

Ant Colony System with Saving Heuristic for Capacitated Vehicle

Full article: Constrained Clustering for the Capacitated Vehicle

PDF) An improved ant colony optimization for the multi-trip

PDF) Solving the Capacitated Vehicle Routing Problem Based on

Hybrid modified ant system with sweep algorithm and path relinking

PDF) Solving the Capacitated Vehicle Routing Problem Based on

A systematic literature review of the vehicle routing problem in

An Enhanced Ant Colony Optimization Algorithm for Vehicle Routing

PDF) Particle Swarm Optimization and Two Solution Representations

PDF] Ant Colony Optimization for Capacitated Vehicle Routing