Show simple item record

dc.contributor.authorMavrovouniotis, Michalisen
dc.contributor.authorYang, Shengxiangen
dc.date.accessioned2013-05-17T10:40:10Z
dc.date.available2013-05-17T10:40:10Z
dc.date.issued2012
dc.identifier.citationMavrovouniotis, M., and Yang, S. (2012) Ant colony optimization with memory-based immigrants for the dynamic vehicle routing problem. In: 2012 IEEE Congress on Evolutionary Computation, Brisbane, June 2012. New York: IEEE, pp. 2645-2652.en
dc.identifier.isbn978-1-4673-1510-4
dc.identifier.urihttp://hdl.handle.net/2086/8598
dc.description.abstractA recent integration showed that ant colony optimization (ACO) algorithms with immigrants schemes perform well on different variations of the dynamic travelling salesman problem. In this paper, we address ACO for the dynamic vehicle routing problem (DVRP) with traffic factor where the changes occur in a cyclic pattern. In other words, previous environments will re-appear in the future. Memory-based immigrants are used with ACO in order to collect the best solutions from the environments and use them to generate diversity and transfer knowledge when a dynamic change occurs. The results show that the proposed algorithm, with an appropriate size of memory and immigrant replacement rate, outperforms other peer ACO algorithms on different DVRP test cases.en
dc.language.isoenen
dc.publisherIEEEen
dc.titleAnt colony optimization with memory-based immigrants for the dynamic vehicle routing problem.en
dc.typeArticleen
dc.identifier.doihttp://dx.doi.org/10.1109/CEC.2012.6252885
dc.researchgroupCentre for Computational Intelligenceen
dc.peerreviewedYesen
dc.researchinstituteInstitute of Artificial Intelligence (IAI)en


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record