An Efficient Combined Meta-Heuristic Algorithm for Solving the Traveling Salesman Problem
<p>The traveling salesman problem (TSP) is one of the most important NP-hard Problems and probably the most famous and extensively studied problem in the field of combinatorial optimization. In this problem, a salesman is required to visit each of <em>n</em> given nodes once and on...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
EduSoft publishing
2016-08-01
|
| Series: | Brain: Broad Research in Artificial Intelligence and Neuroscience |
| Subjects: | |
| Online Access: | http://www.edusoft.ro/brain/index.php/brain/article/view/631 |