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

Celý popis

Podrobná bibliografia

Vydané v:	International journal of advanced network, monitoring, and controls Ročník 2; číslo 4; s. 161 - 165
Hlavný autor:	Zhang, Jiashan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Xi'an Sciendo 01.01.2017 De Gruyter Brill Sp. z o.o., Paradigm Publishing Services
Predmet:	CVRP Density-based clustering algorithm Max-min ant system Two-phase heuristic
ISSN:	2470-8038
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!