doi: 10.7763/IJCTE.2018.V10.1215
Object-Oriented Research Framework for the Fireworks Algorithm with the Focus on the Travelling Salesman Problem
- 1Department of Applied Informatics, Swarm Intelligence Research, Baden-Wuerttemberg Cooperative State University Mosbach, Lohrtalweg 10, 74821 Mosbach, Germany
- 2Department of Information Technologies, University of Economics, Faculty of Informatics and Statistics, W. Churchill Sq. 4, 130 67 Prague 3, Czech Republic.
Abstract
The fireworks algorithm is a lately developed algorithm based on fireworks in the night sky. It is a swarm intelligence algorithm with a broad range of use. In this paper the algorithm is introduced and discussed. Furthermore, an implementation of the algorithm for optimizing the travelling salesman problem is introduced. Prior to implementation the adjustments to the algorithm will be provided. The implementation is based on Java and the layer based and extendable architecture of the implemented application is introduced. The performance of the implementation and the impact of the parameters on the behavior of the algorithm will be tested and analyzed. The results show that the fireworks algorithm is a efficient and performant algorithm to optimize the combinatorial problem of the travelling salesman.
Keywords
- Travelling salesman problem
- combinatorial problem optimization
- fireworks algorithm
How to Cite
Robert Ehni and Carsten Müller, "Object-Oriented Research Framework for the Fireworks Algorithm with the Focus on the Travelling Salesman Problem," International Journal of Computer Theory and Engineering, vol. 10, no. 5, pp. 139-145, 2018. https://doi.org/10.7763/IJCTE.2018.V10.1215
Copyright & License
Copyright © 2018 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).