A Comparison of Heuristic Algorithms for Solving the Traveling Salesman Problem
The Traveling Salesman Problem (TSP) is a challenging computational problem in combinatorial optimization that aims to visit all cities exactly once and return to the first city. Despite that numerous theoretical solutions have been proposed in the literature, finding the exact optimal solution rema...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
An-Najah National University
2024-09-01
|
| Series: | مجلة جامعة النجاح للأبحاث العلوم الطبيعية |
| Subjects: | |
| Online Access: | https://journals.najah.edu/media/journals/full_texts/9_0HnMChH.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|