2014 | OriginalPaper | Buchkapitel
A Multi-population Discrete Firefly Algorithm to Solve TSP
verfasst von : Lingyun Zhou, Lixin Ding, Xiaoli Qiang
Erschienen in: Bio-Inspired Computing - Theories and Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this paper, the Firefly algorithm (FA) is improved and a multi-population discrete firefly algorithm is presented combined with k-opt algorithm to solve the traveling salesman problem (TSP). The proposed algorithm is tested on some instances and the performance of the proposed algorithm is compared with the other discrete firefly algorithm for TSP. The results of the tests show that the proposed algorithm performs better in terms of convergence rate and solution quality.