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.

Improving inbound logistic planning for large-scale real-world

PDF] Solving Capacitated Vehicle Routing Problem Using Variant

Analytics, Free Full-Text

PDF) A Simulation-Based Algorithm for the Capacitated Vehicle

GitHub - afurculita/VehicleRoutingProblem: Vehicle Routing Problem

A review on the electric vehicle routing problems: Variants and

A Novel Hybrid Spotted Hyena Optimizer: An Algorithm for Fuel

PDF] An Improved Clarke and Wright Algorithm to Solve the

A survey of genetic algorithms for solving multi depot vehicle

Metaheuristic algorithm for solving the multi-objective vehicle

PDF) Supervised Fuzzy C-Means Techniques to Solve the Capacitated

Solving Capacitated Vehicle Routing Problem Using Variant Sweep

Routing optimization method of waste transportation vehicle using

PDF] Solving Capacitated Vehicle Routing Problem Using Variant

Constructive and Clustering Methods to Solve Capacitated Vehicle