A fireworks algorithm for solving travelling salesman problem
by Zoubair Taidi; Lamia Benameur; Jihane Alami Chentoufi
International Journal of Computational Systems Engineering (IJCSYSE), Vol. 3, No. 3, 2017

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.

Online publication date: Sun, 24-Sep-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Systems Engineering (IJCSYSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com