A new genetic algorithm for the asymmetric traveling salesman problem |
| |
| Authors: | Yuichi Nagata David Soler |
| |
| Affiliation: | 1. School of Mathematics, Statistics and Computer Science, University of Kwazulu-Natal, Westville Campus, Private Bag X54001, Durban 4000, South Africa;2. Faculties of Mathematics and Computer Science, West University of Timisoara, Timisoara, Romania |
| |
| Abstract: | The asymmetric traveling salesman problem (ATSP) is one of the most important combinatorial optimization problems. It allows us to solve, either directly or through a transformation, many real-world problems. We present in this paper a new competitive genetic algorithm to solve this problem. This algorithm has been checked on a set of 153 benchmark instances with known optimal solution and it outperforms the results obtained with previous ATSP heuristic methods. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
