An iterative solution for the travelling salesman problem. (13th February 2006)

• Record Type: Journal Article
• Authors: Su, L.J.; Nie, Y.Y.
• Is Part Of: International journal of simulation and process modelling. Volume 2:Number 1/2(2006)
• Page Start: 80
• Page End: 84
• Publication Date: 2006-02-13
• Subjects: TSP -- integer programming -- linear programming -- isometric plane -- isometric surface -- travelling salesman problem -- iteration; Management -- Computer simulation -- Periodicals; Mathematical models -- Periodicals; Operations research -- Periodicals; Simulation methods -- Periodicals; 003.05
• Languages: English
• ISSNs: 1740-2123

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.