A novel metaheuristic for traveling salesman problem: blind mole-rat algorithm
Traveling Salesman Problem (TSP) is the problem of finding a minimum distance tour of cities beginning and ending at the same city and that each city are visited only once. As the number of cities increases, it is difficult to find an optimal solution by exact methods in a reasonable duration. There...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Pamukkale University
2016-02-01
|
| Series: | Pamukkale University Journal of Engineering Sciences |
| Subjects: | |
| Online Access: | https://dergipark.org.tr/tr/pub/pajes/issue/20565/219171 |
Search Result 1
A novel metaheuristic for traveling salesman problem: blind mole-rat algorithm
Published 2016-02-01
Get full text
Article