PDF] Solving the Capacitated Vehicle Routing Problem Based on Improved Ant-clustering Algorithm
By A Mystery Man Writer
Description
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.
PDF) Solving the Heterogeneous Capacitated Vehicle Routing Problem
PDF) Solving the Capacitated Vehicle Routing Problem Based on
Metaheuristic algorithm for solving the multi-objective vehicle
A review on the electric vehicle routing problems: Variants and
Review On Vehicle Routing Problem, PDF
PDF) Solving the Capacitated Vehicle Routing Problem Based on
Ant colony optimization algorithms - Wikipedia
Metaheuristic algorithm for solving the multi-objective vehicle
Combinatorial Bees Algorithm for Vehicle Routing Problem - Ismail
PDF) Solving the Capacitated Vehicle Routing Problem Based on
Hybrid Ant Algorithm and Applications for Vehicle Routing Problem
PDF) Solving the Capacitated Vehicle Routing Problem Based on
PDF) Solving capacitated vehicle routing problem using intelligent
from
per adult (price varies by group size)