The application of ant colony optimization in the solution of 3D traveling salesman problem on a sphere
Traveling Salesman Problem (TSP) is a problem in combinatorial optimization that should be solved by a salesperson who has to travel all cities at the minimum cost (minimum route) and return to the starting city (node). Todays, to resolve the minimum cost of this problem, many optimization algorithm...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2017-08-01
|
| Series: | Engineering Science and Technology, an International Journal |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2215098617309783 |