Reed, M., Yiannakou, A. and Evering, R., 2014. An ant colony algorithm for the multi-compartment vehicle routing problem. Applied Soft Computing, 15, pp. 169-176.
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 eciency 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.
|Item Type ||Articles|
|Creators||Reed, M., Yiannakou, A. and Evering, R.|
|Uncontrolled Keywords||ant colony optimization,capacitated vehicle routing problem,clustering|
|Departments||Faculty of Science > Mathematical Sciences|
|Publisher Statement||reed_asoc_a.pdf: Published version available via: http://dx.doi.org/10.1016/j.asoc.2013.10.017|
Actions (login required)