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

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 heuris...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	International journal of advanced network, monitoring, and controls Jg. 2; H. 4; S. 161 - 165
1. Verfasser:	Zhang, Jiashan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Xi'an Sciendo 01.01.2017 De Gruyter Brill Sp. z o.o., Paradigm Publishing Services
Schlagworte:	CVRP Density-based clustering algorithm Max-min ant system Two-phase heuristic
ISSN:	2470-8038
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!