<abstract xmlns="http://www.w3.org/1999/xhtml">

<p>The capacitated vehicle routing problem (CVRP) is one of the most challenging problems in the optimization of distribution. Most approaches can solve case studies involving less than 100 nodes to optimality, but time-consuming. To overcome the limitation, this paper presents a novel two-phase heuristic approach for the capacitated vehicle routing problem. Phase I aims to identifying sets of cost-effective feasible clusters through an improved density-based clustering algorithm. Phase II assigns clusters to vehicles and sequences them on each tour. Max-min ant system is used to order nodes within clusters . The simulation results indicate efficiency of the proposed algorithm.</p>
</abstract>

The capacitated vehicle routing problem (CVRP) is one of the most challenging problems in the optimization of distribution. Most approaches can solve case studies involving less than 100 nodes to optimality, but time-consuming. To overcome the limitation, this paper presents a novel two-phase heuristic approach for the capacitated vehicle routing problem. Phase I aims to identifying sets of cost-effective feasible clusters through an improved density-based clustering algorithm. Phase II assigns clusters to vehicles and sequences them on each tour. Max-min ant system is used to order nodes within clusters . The simulation results indicate efficiency of the proposed algorithm.

An Efficient Density-Based Clustering Algorithm for the Capacitated Vehicle Routing Problem

International Journal of Advanced Network, Monitoring and Controls

This work is licensed under the Creative Commons Attribution 4.0 International License.

The capacitated vehicle routing problem (CVRP) is one of the most challenging problems in the optimization of distribution. Most approaches can solve case...

An Efficient Density-Based Clustering Algorithm for the Capacitated Vehicle Routing Problem

Pubblicato online: 10 apr 2018

Pagine: 161 - 165

DOI: https://doi.org/10.21307/iccnea.2017.96

Parole chiave
CVRP, Two-phase heuristic, Density-based clustering algorithm, Max-min ant system

© 2017 Jiashan Zhang et al., published by Sciendo

This work is licensed under the Creative Commons Attribution 4.0 International License.

An Efficient Density-Based Clustering Algorithm for the Capacitated Vehicle Routing Problem

Pubblicato online: 10 apr 2018

Pagine: 161 - 165

DOI: https://doi.org/10.21307/iccnea.2017.96

Parole chiaveCVRP, Two-phase heuristic, Density-based clustering algorithm, Max-min ant system

© 2017 Jiashan Zhang et al., published by Sciendo

This work is licensed under the Creative Commons Attribution 4.0 International License.

Parole chiave
CVRP, Two-phase heuristic, Density-based clustering algorithm, Max-min ant system