An ant colony algorithm for the multi-compartment vehicle routing problem


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.

Related documents:

PDF (reed-asoc-a) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (323kB) | Preview

    Official URL:

    Related URLs:


    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
    CreatorsReed, M., Yiannakou, A. and Evering, R.
    Related URLs
    URLURL Type
    Uncontrolled Keywordsant colony optimization,capacitated vehicle routing problem,clustering
    DepartmentsFaculty of Science > Mathematical Sciences
    Publisher Statementreed_asoc_a.pdf: Published version available via:
    ID Code37663


    Actions (login required)

    View Item

    Document Downloads

    More statistics for this item...