Evolutionary discrete firefly algorithm for travelling salesman problem

Authors:
Gilang Kusuma Jati; Suyanto
Affiliations:
The faculty of Informatics - Telkom Institute of Technology, Terusan, West Java, Indonesia;The faculty of Informatics - Telkom Institute of Technology, Terusan, West Java, Indonesia
Venue:
ICAIS'11 Proceedings of the Second international conference on Adaptive and intelligent systems
Year:
2011

Citing 7
Cited 0

Using Genetic Algorithms to Optimize ACS-TSP

ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem

Journal of Heuristics
Discrete Fuzzy Particle Swarm Optimization for Solving Traveling Salesman Problem

ICIFE '09 Proceedings of the 2009 International Conference on Information and Financial Engineering
Nature-Inspired Metaheuristic Algorithms

Nature-Inspired Metaheuristic Algorithms
Firefly algorithms for multimodal optimization

SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
Engineering Optimization: An Introduction with Metaheuristic Applications

Engineering Optimization: An Introduction with Metaheuristic Applications
An evolutionary algorithm for large traveling salesman problems

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

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.