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

Martin Reed, Aliki Yiannakou, Roxanne Evering

Research output: Contribution to journalArticlepeer-review

141 Citations (Scopus)
505 Downloads (Pure)

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.
Original languageEnglish
Pages (from-to)169-176
Number of pages8
JournalApplied Soft Computing
Volume15
Early online date4 Nov 2013
DOIs
Publication statusPublished - 1 Feb 2014

Keywords

  • ant colony optimization
  • capacitated vehicle routing problem
  • clustering

Fingerprint Dive into the research topics of 'An ant colony algorithm for the multi-compartment vehicle routing problem'. Together they form a unique fingerprint.

Cite this