A memetic ant colony optimization algorithm for the dynamic travelling salesman problem.

Simple item page
dc.contributor.authorYang, Shengxiangen
dc.contributor.authorMavrovouniotis, Michalisen
dc.date.accessioned2013-05-16T09:07:53Z
dc.date.available2013-05-16T09:07:53Z
dc.date.issued2011
dc.description.abstractAnt colony optimization (ACO) has been successfully applied for combinatorial optimization problems, e.g., the travelling salesman problem (TSP), under stationary environments. In this paper, we consider the dynamic TSP (DTSP), where cities are replaced by new ones during the execution of the algorithm. Under such environments, traditional ACO algorithms face a serious challenge: once they converge, they cannot adapt efficiently to environmental changes. To improve the performance of ACO on the DTSP, we investigate a hybridized ACO with local search (LS), called Memetic ACO (M-ACO) algorithm, which is based on the population-based ACO (P-ACO) framework and an adaptive inver-over operator, to solve the DTSP. Moreover, to address premature convergence, we introduce random immigrants to the population of M-ACO when identical ants are stored. The simulation experiments on a series of dynamic environments generated from a set of benchmark TSP instances show that LS is beneficial for ACO algorithms when applied on the DTSP, since it achieves better performance than other traditional ACO and P-ACO algorithms.en
dc.identifier.citationMavrovouniotis, M. and Yang, S. (2011) A memetic ant colony optimization algorithm for the dynamic travelling salesman problem. Soft Computing, 15 (7), July 2011, pp. 1405-1425.en
dc.identifier.doihttps://doi.org/10.1007/s00500-010-0680-1
dc.identifier.issn1432-7643
dc.identifier.urihttp://hdl.handle.net/2086/8515
dc.language.isoenen
dc.publisherSpringeren
dc.researchgroupCentre for Computational Intelligenceen
dc.researchinstituteInstitute of Artificial Intelligence (IAI)en
dc.subjectMemetic algorithmen
dc.subjectAnt colony optimizationen
dc.subjectDynamic optimization problemen
dc.subjectTravelling salesman problemen
dc.subjectInver-over operatoren
dc.subjectLocal searchen
dc.subjectSimple inversionen
dc.subjectAdaptive inversionen
dc.titleA memetic ant colony optimization algorithm for the dynamic travelling salesman problem.en
dc.typeArticleen

Files

License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
3.18 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

School of Computer Science and Informatics