Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14279/30863
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mavrovouniotis, Michalis | - |
dc.contributor.author | Yang, Shengxiang | - |
dc.date.accessioned | 2023-11-27T11:43:44Z | - |
dc.date.available | 2023-11-27T11:43:44Z | - |
dc.date.issued | 2013-01-01 | - |
dc.identifier.citation | Studies in Computational Intelligence, 2013, vol. 490, pp. 317 - 341 | en_US |
dc.identifier.isbn | 9783642384158 | - |
dc.identifier.issn | 1860949X | - |
dc.identifier.uri | https://hdl.handle.net/20.500.14279/30863 | - |
dc.description.abstract | Ant colony optimization (ACO) algorithms have proved to be powerful methods to address dynamic optimization problems (DOPs). However, once the population converges to a solution and a dynamic change occurs, it is difficult for the population to adapt to the new environment since high levels of pheromone will be generated to a single trail and force the ants to follow it even after a dynamic change. A good solution is to maintain the diversity via transferring knowledge from previous environments to the pheromone trails using immigrants. In this chapter, we investigate ACO algorithms with different immigrants schemes for two types of dynamic travelling salesman problems (DTSPs) with traffic factor, i.e., under random and cyclic dynamic changes. The experimental results based on different DTSP test cases show that the investigated algorithms outperform other peer ACO algorithms and that different immigrants schemes are beneficial on different environmental cases. © 2013 Springer-Verlag Berlin Heidelberg. | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartof | Studies in Computational Intelligence | en_US |
dc.rights | © Springer-Verlag Berlin Heidelberg | en_US |
dc.subject | Ant colony | en_US |
dc.subject | immigrants schemes | en_US |
dc.subject | salesman problem | en_US |
dc.title | Ant colony optimization algorithms with immigrants schemes for the dynamic travelling salesman problem | en_US |
dc.type | Article | en_US |
dc.collaboration | De Montfort University | en_US |
dc.subject.category | Computer and Information Sciences | en_US |
dc.journals | Subscription | en_US |
dc.country | United Kingdom | en_US |
dc.subject.field | Natural Sciences | en_US |
dc.publication | Peer Reviewed | en_US |
dc.identifier.doi | 10.1007/978-3-642-38416-5_13 | en_US |
dc.identifier.scopus | 2-s2.0-84884258938 | en |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/84884258938 | en |
dc.contributor.orcid | #NODATA# | en |
dc.contributor.orcid | #NODATA# | en |
dc.relation.volume | 490 | en_US |
cut.common.academicyear | 2013-2014 | en_US |
dc.identifier.spage | 317 | en_US |
dc.identifier.epage | 341 | en_US |
item.grantfulltext | none | - |
item.languageiso639-1 | en | - |
item.cerifentitytype | Publications | - |
item.openairecristype | http://purl.org/coar/resource_type/c_6501 | - |
item.openairetype | article | - |
item.fulltext | No Fulltext | - |
crisitem.author.orcid | 0000-0002-5281-4175 | - |
Appears in Collections: | Άρθρα/Articles |
CORE Recommender
SCOPUSTM
Citations
20
7
checked on Mar 14, 2024
Page view(s)
78
Last Week
0
0
Last month
3
3
checked on Nov 7, 2024
Google ScholarTM
Check
Altmetric
Items in KTISIS are protected by copyright, with all rights reserved, unless otherwise indicated.