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.
Metaheuristic algorithm for solving the multi-objective vehicle
Combinatorial Bees Algorithm for Vehicle Routing Problem - Ismail
A new efficient approach for solving the capacitated Vehicle
PDF) Solving the Capacitated Vehicle Routing Problem Based on
PDF) Solving the Capacitated Vehicle Routing Problem Based on
A hybrid ant colony optimization with fireworks algorithm to solve
Solving Capacitated Vehicle Routing Problem Using Variant Sweep
A two-stage hybrid ant colony algorithm for multi-depot half-open
Sustainability, Free Full-Text
Metaheuristic algorithm for solving the multi-objective vehicle
PDF) Solving the Capacitated Vehicle Routing Problem Based on
Artificial bee colony algorithm with scanning strategy for the