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

doi:10.1109/ICCNEA.2017.96

CQUET-IR

	An Efficient Density-Based Clustering Algorithm for the Capacitated Vehicle Routing Problem
	Zhang, Jiashan
	2017
会议录名称	2017 INTERNATIONAL CONFERENCE ON COMPUTER NETWORK, ELECTRONIC AND AUTOMATION (ICCNEA)
页码	465-469
会议名称	International Conference on Computer Network, Electronic and Automation (ICCNEA)
会议日期	SEP 23-25, 2017
会议地点	Xian, PEOPLES R CHINA
出版地	NEW YORK
出版者	IEEE
摘要	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.
关键词	CVRP Two-phase heuristic Density-based clustering algorithm Max-min ant system
DOI	10.1109/ICCNEA.2017.96
收录类别	CPCI-S
语种	英语
WOS研究方向	Automation & Control Systems ; Computer Science ; Engineering
WOS类目	Automation & Control Systems ; Computer Science, Interdisciplinary Applications ; Computer Science, Theory & Methods ; Engineering, Electrical & Electronic
WOS记录号	WOS:000427493700090
原始文献类型	Proceedings Paper
引用统计	被引频次：8[WOS] [WOS记录] [WOS相关记录]
文献类型	会议论文
条目标识符	https://ir.cqcet.edu.cn/handle/39TD4454/4083
专题	重庆电子科技职业大学
作者单位	Chongqing Vocat Inst Engn, Chongqing 402260, Peoples R China
推荐引用方式 GB/T 7714	Zhang, Jiashan. An Efficient Density-Based Clustering Algorithm for the Capacitated Vehicle Routing Problem[C]. NEW YORK:IEEE,2017:465-469.

条目包含的文件		下载所有文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
Zhang-2017-An Effici（303KB）	会议论文		开放获取	CC BY-NC-SA	浏览下载