Title: An iterative solution for the travelling salesman problem.

Authors: L.J. Su, Y.Y. Nie

Addresses: Shenyang Institute of Automation, Academia Sinica, Graduate School, CAS, No. 114, Nanta Street, 110016 Shenyang, PR China. ' Shenyang Institute of Automation, Academia Sinica, Graduate School, CAS, No. 114, Nanta Street, 110016 Shenyang, PR China

Abstract: 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.

Keywords: TSP; integer programming; linear programming; isometric plane; isometric surface; travelling salesman problem; iteration.

DOI: 10.1504/IJSPM.2006.009015

International Journal of Simulation and Process Modelling, 2006 Vol.2 No.1/2, pp.80 - 84

Published online: 12 Feb 2006 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article