Using Swarm Intelligence for solving NP-Hard Problems
Swarm Intelligence algorithms are computational intelligence algorithms inspired from the collective behavior of real swarms such as ant colony, fish school, bee colony, bat swarm, and other swarms in the nature. Swarm Intelligence algorithms are used to obtain the optimal solution for NP-Hard problems that are strongly believed that their optimal solution cannot be found in an optimal bounded time. Travels Salesman Problem (TSP) is an NP-Hard problem in which a salesman wants to visit all cities and return to the start city in an optimal time. This article applies most efficient heuristic based Swarm Intelligence algorithms which are Particle Swarm Optimization (PSO), Artificial Bee Colony (ABC), Bat algorithm (BA), and Ant Colony Optimization (ACO) algorithm to find a best solution for TSP which is one of the most well-known NP-Hard problems in computational optimization. Results are given for different TSP problems comparing the best tours founds by BA, ABC, PSO and ACO.
Altringham J. D., Bats, (1996), Biology and Behaviour, Oxford University Press.
Andrej Kazakov, (2009), Travelling Salesman Problem: Local Search and Divide and Conquer working together.
Basic J. (2012), A New Hybrid Algorithm for Optimization Using PSO and GDA Appl. Sci. Res., 2(3)2336-2341.
Blum, C. (2005), Ant colony optimization Introduction and recent trends, Physics of Life Reviews, 2(4), 353-373.
Bonabeau E, Dorigo M, Theraulaz G. (1999), Swarm Intelligence: From Natural to Artificial Systems. Journal of Artificial Societies and Social Simulation; 4: 320.
Dorigo M., Maniezzo V., A. (1996), Colorni, Ant system: optimization by a colony of cooperating agents, IEEE Trans. Syst. Man Cybern. B 26 29–41.
Eberhart RC, Kennedy J, (1995), Ａ new optimizer using particles swarm theory[A], Proc Sixth Int Symposium on Micro Machine and Human Science[C], pp. 39-43.
Hochbaum, S. (1997), Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston.
Karaboga D, Basturk B. (2007), A Powerful and Efficient Algorithm for Numeric Function Optimization: Artificial Bee Colony (ABC) Algorithm. Journal of Global Optimization: 459–471.
Karaboga D. (2007), An idea based on honey bee swarm for numerical optimization. Technical Report TR06.Erciyes University.
Karaboga D. (2010), Artificial bee colony algorithm. Scholarpedia.: 6915.
Kennedy J., Eberhart R. (1995), Particle swarm optimization, in: IEEE International Conference on Neural Networks Proceedings, vols. 1–6, pp.1942–1948.
Li, Y.: (2010), Solving TSP by an ACO-and-BOA-based Hybrid Algorithm. In: 2010 International Conference on Computer Application and System Modeling, pp. 189–192. IEEE Press, New York.
Marco Dorigo, Thomas Stu, (2004), Ant Colony Optimization.
Rao RS, Narasimham SVL, (2008), Ramalingaraju M. Optimization of distribution network configuration for loss reduction using artificial bee colony algorithm. International Journal of Electrical Power and Energy Systems Engineering.: 116–122.
Reinelt, (1991), TSPLIB—A traveling salesman problem library, ORSA Journal on Computing 3 (4) 376–384.
Sahni, S. & Gonzalez, (1976), T. P-Complete Approximation Problems. JACM, 23(3), pp.555-565.
Shi YH, Eberhart RC, (1998), A modified particle swarm optimizer[A], IEEE Int Conf on Evolutionary Computation [C], pp. 63-73.
Yang, X.-S. (2010), A new metaheuristic bat-inspired algorithm. In Natureinspired cooperative strategies for optimization (pp. 65(74). Springer.
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License [CC BY-NC-ND 4.0] that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
AJNU is committed to protecting the privacy of the users of this journal website. The names, personal particulars and e-mail addresses entered in this website will be used only for the stated purposes of this journal and will not be made available to third parties without the user's permission or due process. Users consent to receive communication from the AJNU for the stated purposes of the journal. Queries with regard to privacy may be directed to email@example.com.