Title: A fireworks algorithm for solving travelling salesman problem

Authors: Zoubair Taidi; Lamia Benameur; Jihane Alami Chentoufi

Addresses: ISO Laboratory, Faculty of Sciences, Campus Universitaire, BP 242, 14000 Kenitra, Morocco ' LIROSA Laboratory, Faculty of Sciences, BP. 2121 M'Hannech II, 93030 Tétouan Maroc, Morocco ' ISO Laboratory, Faculty of Sciences, Campus Universitaire, BP 242, 14000 Kenitra, Morocco

Abstract: In this paper, a novel swarm intelligence algorithm inspired by observing fireworks explosions, called fireworks algorithm (FW), is proposed for solving the travelling salesman problem (TSP). The TSP is a well-known NP-hard combinatorial optimisation problem. The problem is easy to state, but hard to solve. Many real-world problems can be formulated as instances of the TSP, for example, computer wiring, vehicle routing, crystallography, robot control, drilling of printed circuit boards and chronological sequencing. The proposed algorithm has been performed on TSP instances taken from TSPLIB library and has been compared with other methods in the literature. Computational results showed that the proposed firework algorithm is competitive in terms of quality of the solutions compared to other techniques.

Keywords: meta-heuristic; fireworks algorithm; optimisation; swarm intelligence; travelling salesman problem; TSP.

DOI: 10.1504/IJCSYSE.2017.086740

International Journal of Computational Systems Engineering, 2017 Vol.3 No.3, pp.157 - 162

Received: 02 Jul 2016
Accepted: 01 Oct 2016

Published online: 15 Sep 2017 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article