Evaluation of Ant Colony Optimization Algorithm Compared to Genetic Algorithm, Dynamic Programming and Branch and Bound Algorithm Regarding Travelling Salesman Problem

1
A.H.M Saiful Islam
A.H.M Saiful Islam
2
Mashrure Tanzim
Mashrure Tanzim
3
Sadia Afreen
Sadia Afreen
4
Gerald Rozario
Gerald Rozario
2 Bangladesh University of Professionals

Send Message

To: Author

GJCST Volume 19 Issue D3

Article Fingerprint

ReserarchID

F8R2P

Evaluation of Ant Colony Optimization Algorithm Compared to Genetic Algorithm, Dynamic Programming and Branch and Bound Algorithm Regarding Travelling Salesman Problem Banner

AI TAKEAWAY

The objective of our study was to evaluate, in a population of Togolese People Living With HIV(PLWHIV), the agreement between three scores derived from the general population namely the Framingham score, the Systematic Coronary Risk Evaluation (SCORE), the evaluation of the cardiovascular risk (CVR) according to the World Health Organization.
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

We use ant colony optimization (ACO) algorithm for solving combinatorial optimization problems such as the traveling salesman problem. Some applications of ACO are: vehicle routing, sequential ordering, graph coloring, routing in communications networks, etc. In this paper, we compare the performance of ACO to that of a few other state-of-the-art algorithms currently in use and thus measure the effectiveness of ACO as one of the major optimization algorithms in regard with a few more algorithms. The performance of the algorithms is measured by observing their capacity to solve a traveling salesman problem (TSP). This paper will help to find the proper algorithm to be used for routing problems in different real-life situations.

Article content is being processed or not available yet.

6 Cites in Articles

References

  1. M Abid,I Muhammad (2015). Heuristic Approaches to Solve Traveling Salesman Problem.
  2. D Davendra (2010). Traveling Salesman Problem, Theory and Applications. INTECH open access publishers.
  3. Dirk Sudholt,Christian Thyssen (2012). Running time analysis of Ant Colony Optimization for shortest path problems.
  4. Marco Dorigo,Mauro Birattari,Thomas Stutzle (2006). Ant Colony Optimization.
  5. B Raghavendra (2015). Solving Traveling Salesmen Problem using Ant Colony Optimization Algorithm.
  6. Wang Hui (2012). Comparison of several intelligent algorithms for solving TSP problem in industrial engineering.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

A H M Saiful Islam. 2019. \u201cEvaluation of Ant Colony Optimization Algorithm Compared to Genetic Algorithm, Dynamic Programming and Branch and Bound Algorithm Regarding Travelling Salesman Problem\u201d. Global Journal of Computer Science and Technology - D: Neural & AI GJCST-D Volume 19 (GJCST Volume 19 Issue D3): .

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
GJCST-D Classification: F.2.2
Version of record

v1.2

Issue date

July 17, 2019

Language

English

Experiance in AR

The methods for personal identification and authentication are no exception.

Read in 3D

The methods for personal identification and authentication are no exception.

Article Matrices
Total Views: 5002
Total Downloads: 1317
2026 Trends
Research Identity (RIN)
Related Research
Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]
×

This Page is Under Development

We are currently updating this article page for a better experience.

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Evaluation of Ant Colony Optimization Algorithm Compared to Genetic Algorithm, Dynamic Programming and Branch and Bound Algorithm Regarding Travelling Salesman Problem

A.H.M Saiful Islam
A.H.M Saiful Islam
Mashrure Tanzim
Mashrure Tanzim Bangladesh University of Professionals
Sadia Afreen
Sadia Afreen
Gerald Rozario
Gerald Rozario

Research Journals