Crowding Population-based Ant Colony Optimisation for the Multi-objective Travelling Salesman Problem

Ant inspired algorithms have gained popularity for use in multi-objective problem domains. One specific algorithm, Population-based ACO, which uses a population as well as the traditional pheromone matrix, has been shown to be effective at solving combinatorial multi-objective optimisation problems....

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2007 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision Making, Honolulu, HI, 1-5 April 2007 s. 333 - 340
Hlavný autor: Angus, D.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.04.2007
Predmet:
Ant colony optimization
Communications technology
Competitive intelligence
Computational intelligence
Decision making
Information technology
Intelligent systems
Laboratories
Testing
Traveling salesman problems
ISBN:9781424407026, 1424407028
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Ant inspired algorithms have gained popularity for use in multi-objective problem domains. One specific algorithm, Population-based ACO, which uses a population as well as the traditional pheromone matrix, has been shown to be effective at solving combinatorial multi-objective optimisation problems. This paper extends the population-based ACO algorithm with a crowding population replacement scheme to increase the search efficacy and efficiency. Results are shown for a suite of multi-objective travelling salesman problems of varying complexity
ISBN:9781424407026
1424407028
DOI:10.1109/MCDM.2007.369110