| Article ID: | iaor20062324 |
| Country: | United Kingdom |
| Volume: | 2 |
| Issue: | 1/2 |
| Start Page Number: | 80 |
| End Page Number: | 84 |
| Publication Date: | Feb 2006 |
| Journal: | International Journal of Simulation and Process Modelling |
| Authors: | Su L.J., Nie Y.Y. |
| Keywords: | programming: integer, programming: linear, heuristics |
The travelling salesman problem (TSP) is a typical NP-hard problem. In this paper, a well implied enumeration method for TSP is presented where the solution of the TSP is obtained by an iterative process. At each iteration, an integer linear programming is solved by the isometric surface method. The efficiency of the algorithm is dependent on that of the integer linear programming.