Selected Soft Computing Algorithms For Solving Travelling Salesman Problem
| dc.contributor.author | Janet O. Jooda | |
| dc.date.accessioned | 2025-05-27T11:06:28Z | |
| dc.date.available | 2025-05-27T11:06:28Z | |
| dc.date.issued | 2021 | |
| dc.description.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. | |
| dc.identifier.citation | Adedeji, O. T., Alade, O. M., Makinde, B. O., Jooda, J. O., Adewale, J. A. & Oyeleye, T. E. (2021). Selected Soft Computing Algorithms for Solving Travelling Salesman Problem. International Journal of Progressive Sciences and Technologies, Vol. 28, No. 2, Pp. 672-679, | |
| dc.identifier.issn | 2509-0119 | |
| dc.identifier.uri | https://repository.run.edu.ng/handle/123456789/4810 | |
| dc.language.iso | en | |
| dc.publisher | International Journal of Progressive Sciences and Technologies, | |
| dc.relation.ispartofseries | Vol 28; No. 2 | |
| dc.title | Selected Soft Computing Algorithms For Solving Travelling Salesman Problem | |
| dc.type | Article |