| Article ID: | iaor20023506 |
| Country: | China |
| Volume: | 36 |
| Issue: | 2 |
| Start Page Number: | 211 |
| End Page Number: | 213 |
| Publication Date: | Apr 2001 |
| Journal: | Journal of Southwest Jiaotong University |
| Authors: | Li Jun, Xie Binglei, Liu Jianxin |
As an extension of the travelling salesman problem, the travelling salesman problem with time windows is a very difficult problem with great theoretical and practical significance. In this paper, the time restraints are converted into objective restraints, and two genetic algorithms with mutations by 2-exchange and by 3-exchange, respectively, are designed by using sequence coding to deal with the soft and hard time restraints. Simulation indicates that the latter algorithm is superior to the former, and that both of the proposed algorithms are superior to the simple genetic algorithm.