Tabu Search Method for Solving the Traveling salesman Problem

Section: Research Paper
Issue
Vol. 5 No. 2 (2008): Volume 5 Issue 2
Pages
141-153

Keywords:

Tabu algorithm, traveling salesman problem, NP problem

Abstract

This research presents the fundamental concepts of tabu search for optimization problem as symmetric traveling salesman problem. The purpose of this research is to solve the traveling salesman problem with tabu search method, to find an optimal solution of small search space and computational requirements.

References

Authors

Isra Natheer Alkallak

College of Nursing

Ruqaya Zedan Sha’ban

Dep. Basic Sciences College of Nursing University of Mosul, Mosul, Iraq

Identifiers

DOI: 10.33899/csmj.2008.163978

Download this PDF file
PDF

Statistics

How to Cite

Tabu Search Method for Solving the Traveling salesman Problem. (2008). AL-Rafidain Journal of Computer Sciences and Mathematics, 5(2), 141-153. https://doi.org/10.33899/csmj.2008.163978
Copyright and Licensing
Creative Commons License

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

How to Cite

Tabu Search Method for Solving the Traveling salesman Problem. (2008). AL-Rafidain Journal of Computer Sciences and Mathematics, 5(2), 141-153. https://doi.org/10.33899/csmj.2008.163978