![Cover Image for System.Linq.Enumerable+EnumerablePartition`1[System.Char]](https://coverimages.igi-global.com/images/search-article.png)
An ant colony algorithm for the multi-compartment vehicle routing problem
OAI: oai:purehost.bath.ac.uk:openaire_cris_publications/9d5399f7-bdee-4eb4-b8af-99cef0fdbcc9 • DOI: https://doi.org/10.1016/j.asoc.2013.10.017
Abstract
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.
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.