Abstract
This paper addresses how to apply firefly algorithm (FA) for travelling salesman problem (TSP). Two schemes are studied, i.e. discrete distance between two fireflies and the movement scheme. Computer simulation shows that the simple form of FA without combination with other methods performs very well to solve some TSP instances, but it can be trapped into local optimum solutions for some other instances. © 2011 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Jati, G. K., & Suyanto. (2011). Evolutionary discrete firefly algorithm for travelling salesman problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6943 LNAI, pp. 393–403). https://doi.org/10.1007/978-3-642-23857-4_38
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
