Selected Soft Computing Algorithms For Solving Travelling Salesman Problem

Oluyinka Titilayo Adedeji, Oluwaseun Modupe Alade, Bukola Oyeladun Makinde, Janet Olubunmi Jooda, Joseph Adekunle Adewale

Abstract


Traveling Salesman Problem (often called TSP) is a classic algorithmic problem in the field of computer science and operations research. It is focused on optimization. In this context, better solution often means a solution that is cheaper, shorter, or faster. TSP is a mathematical problem. It is most easily expressed as a graph describing the locations of a set of nodes. Given a set of cities and distance between every pair of cities, the problem of Traveling Salesman Problem is to find the shortest possible route that visits every city exactly once and returns to the starting point. The aim of this project is to adapt Bat, Bee, Firefly, and Flower pollination algorithms, implement and evaluate the selected algorithms for solving Travelling Salesman Problem.


Keywords


Optimization, BAT, BEE, TSP, Transportation

Full Text:

PDF

References


Charu Vasishta, Preethi Jose Dolly (2015): Solving Travelling Salesman Problem using Genetic Algorithm by Combining Greedy Approach and Ordered Cross Over. International Journal of Science, Engineering and Technology Research (IJSETR), Volume 4, Issue 6.

Dervis Karaboga, Bahriye Basturk (2007): A powerful and efficient algorithm for numerical Function Optimization: Artificial Bee Colony (ABC) Algorithm J Glob Optim, Volume 39, Issue 3, pp 459–471

Glover B.J (2007): Understanding Flowers and Flowering: An integrated approach. Understanding Flowers and Flowering: An integrated approach. 1-256. 10.1093/acprof:oso/9780198565970.001.0001.

Saloni Gupta and Poonam Panwar (2013): Solving Travelling Salesman Problem Using Genetic Algorithm. International Journal of Advanced Research in Computer Science and Software Engineering.

Yang, X. S., (2010). A New Metaheuristic Bat-Inspired Algorithm, in: Nature Inspired Cooperative Strategies for Optimization (NISCO 2010) (Eds. Cruz, C.; Gonz´alez, J. R.; Pelta, D. A.; Terrazas, G), Studies in Computational Intelligence Vol. 284, Springer Berlin, pp. 65–74.

Yang X-S (2008) Nature-inspired metaheuristic algorithm. Luniver Press, Beckington.

Yang X-S (2009) Firefly algorithms for multimodal optimization, In: Stochastic algorithms: foundations and applications, SAGA, Lecture Notes in Computer Sciences, 5792, 169 178.




DOI: http://dx.doi.org/10.52155/ijpsat.v28.2.3547

Refbacks

  • There are currently no refbacks.


Copyright (c) 2021 Oluyinka Titilayo Adedeji, Oluwaseun Modupe Alade, Bukola Oyeladun Makinde, Janet Olubunmi Jooda, Joseph Adekunle Adewale

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.