Mosul University
  • Register
  • Login
  • العربیة

AL-Rafidain Journal of Computer Sciences and Mathematics

Notice

As part of Open Journals’ initiatives, we create website for scholarly open access journals. If you are responsible for this journal and would like to know more about how to use the editorial system, please visit our website at https://ejournalplus.com or
send us an email to info@ejournalplus.com

We will contact you soon

  1. Home
  2. Volume 5, Issue 2
  3. Authors

Current Issue

By Issue

By Subject

Keyword Index

Author Index

Indexing Databases XML

About Journal

Aims and Scope

Editorial Board

Editorial Staff

Publication Ethics

Indexing and Abstracting

Related Links

Peer Review Process

News

Tabu Search Method for Solving the Traveling salesman Problem

    Isra Natheer Alkallak Ruqaya Zedan Sha’ban

AL-Rafidain Journal of Computer Sciences and Mathematics, 2008, Volume 5, Issue 2, Pages 141-153
10.33899/csmj.2008.163978

  • Show Article
  • Download
  • Cite
  • Statistics
  • Share

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. 
 
Keywords:
    Tabu algorithm traveling salesman problem NP problem
  • PDF (363 K)
  • XML
(2008). Tabu Search Method for Solving the Traveling salesman Problem. AL-Rafidain Journal of Computer Sciences and Mathematics, 5(2), 141-153. doi: 10.33899/csmj.2008.163978
Isra Natheer Alkallak; Ruqaya Zedan Sha’ban. "Tabu Search Method for Solving the Traveling salesman Problem". AL-Rafidain Journal of Computer Sciences and Mathematics, 5, 2, 2008, 141-153. doi: 10.33899/csmj.2008.163978
(2008). 'Tabu Search Method for Solving the Traveling salesman Problem', AL-Rafidain Journal of Computer Sciences and Mathematics, 5(2), pp. 141-153. doi: 10.33899/csmj.2008.163978
Tabu Search Method for Solving the Traveling salesman Problem. AL-Rafidain Journal of Computer Sciences and Mathematics, 2008; 5(2): 141-153. doi: 10.33899/csmj.2008.163978
  • RIS
  • EndNote
  • BibTeX
  • APA
  • MLA
  • Harvard
  • Vancouver
  • Article View: 71
  • PDF Download: 79
  • LinkedIn
  • Twitter
  • Facebook
  • Google
  • Telegram
  • Home
  • Glossary
  • News
  • Aims and Scope
  • Privacy Policy
  • Sitemap
This journal is licensed under a Creative Commons Attribution 4.0 International (CC-BY 4.0)

Powered by eJournalPlus