期刊
APPLIED SOFT COMPUTING
卷 15, 期 -, 页码 169-176出版社
ELSEVIER
DOI: 10.1016/j.asoc.2013.10.017
关键词
Ant colony optimization; Capacitated vehicle routing problem; Clustering; Multi-compartment vehicles; Waste collection
We demonstrate the use of Ant Colony System (ACS) to solve the capacitated vehicle routing problem associated with collection of recycling waste from households, treated as nodes in a spatial network. For networks where the nodes are concentrated in separate clusters, the use of k-means clustering can greatly improve the efficiency of the solution. The ACS algorithm is extended to model the use of multi-compartment vehicles with kerbside sorting of waste into separate compartments for glass, paper, etc. The algorithm produces high-quality solutions for two-compartment test problems. (C) 2013 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据