An iterative solution for the travelling salesman problem.
by L.J. Su, Y.Y. Nie
International Journal of Simulation and Process Modelling (IJSPM), Vol. 2, No. 1/2, 2006

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.

Online publication date: Sun, 12-Feb-2006

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Simulation and Process Modelling (IJSPM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com