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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Luciana, B., França, P.M., Pablo, M.: A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem. Journal of Heuristics 10(5), 483–506 (2004)
Lukasik, S., Żak, S.: Firefly algorithm for Continuous Constrained Optimisation Tasks. Systems Research Institute, Polish. Academy of Sciences, pp. 1–10 (2010)
Niasar, N.S., Shanbezade, J., Perdam, M.M.: Discrete Fuzzy Particle Swarm Optimization for Solving Travelling Salesman Problem. In: Proceedingsof International Conference on Information and Financial Engineering, pp. 162–165 (2009)
Pilat, M.L., White, T.: Using Genetic Algorithms to Optimize ACS-TSP. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol. 2463, pp. 12–14. Springer, Heidelberg (2002)
Sayadi, M.K.: A Discrete Meta-Heuristic With Local Search for Makespan Minimization in Permutation Flow Shop Scheduling Problems. International Journal of Industrial Engineering Computation 1(1), 1–10 (2010)
TSPLIB95: Ruprecht - Karls - Universitat Heildelberg (2011), http://www.iwr.uini-heidelberg.de/groups/comopt/software/TSPLIB95/
Yang, X.S.: Nature-inspired Metaheuristic Algorithm. Luniver Press (2008)
Yang, X.S.: Firefly Algorithms for Multimodal Optimization. In: Watanabe, O., Zeugmann, T. (eds.) SAGA 2009. LNCS, vol. 5792, pp. 169–178. Springer, Heidelberg (2009)
Yang, X.S.: Engineering Optimization: An Introduction with Metaheuristic Applications. Wiley, Chichester (2010)
Tsai, H., Yang, J., Tsai, Y., Kao, C.: An Evolutionary Algorithm for Large Traveling Salesman Problems. IEEE Transactions on Systems, Man, and Cybernetics, Part B, 1718–1729 (2004)
Wong, L., Chong, C.S.: An Efficient Bee Colony Optimization Algorithm for Travelling Salesman Problem Using Frequency-Based Pruning. In: Proceedings of 7th IEEE International Conference on Industrial Informatics, pp. 775–782 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jati, G.K., Suyanto (2011). Evolutionary Discrete Firefly Algorithm for Travelling Salesman Problem. In: Bouchachia, A. (eds) Adaptive and Intelligent Systems. ICAIS 2011. Lecture Notes in Computer Science(), vol 6943. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23857-4_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-23857-4_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23856-7
Online ISBN: 978-3-642-23857-4
eBook Packages: Computer ScienceComputer Science (R0)