Research

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


Reference:

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:

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

    Official URL:

    http://dx.doi.org/10.1016/j.asoc.2013.10.017

    Related URLs:

    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.

    Details

    Item Type Articles
    CreatorsReed, M., Yiannakou, A. and Evering, R.
    DOI10.1016/j.asoc.2013.10.017
    Related URLs
    URLURL Type
    http://www.scopus.com/inward/record.url?scp=84889649005&partnerID=8YFLogxKUNSPECIFIED
    Uncontrolled Keywordsant colony optimization,capacitated vehicle routing problem,clustering
    DepartmentsFaculty of Science > Mathematical Sciences
    Publisher Statementreed_asoc_a.pdf: Published version available via: http://dx.doi.org/10.1016/j.asoc.2013.10.017
    RefereedYes
    StatusPublished
    ID Code37663

    Export

    Actions (login required)

    View Item

    Document Downloads

    More statistics for this item...