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

Full description

Bibliographic Details

Published in:	International journal of advanced network, monitoring, and controls Vol. 2; no. 4; pp. 161 - 165
Main Author:	Zhang, Jiashan
Format:	Journal Article
Language:	English
Published:	Xi'an Sciendo 01.01.2017 De Gruyter Brill Sp. z o.o., Paradigm Publishing Services
Subjects:	CVRP Density-based clustering algorithm Max-min ant system Two-phase heuristic
ISSN:	2470-8038
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!