A TSP solution approach by integer linear programming
- Bangkok : Asian Institute of Technology, 1982
- 31 p.
- Special studies project report ; no. IE-82-07 .
- Asian Institute of Technology. Special studies project report ; no. IE-82-07 .
A special study submitted in partial fulfillment of the requirement for the degree of Master of Engineering, School of Engineering and Technology
Special Studies Project Report (M. Eng.) - Asian Institute of Technology, 1982
The Travelling Salesman Problem ( TSP ) is known as one of the notorious problems in Combinatorial Optimization. This study is concerned with a solution approach to the TSP by Integer Linear Programming . An attempt is made to identify the greater proportion of redundant Subtour Elimination Constraints ( SEC ) , so as to save computer storage , and facilitate execution of the problem, with the IBM MPSX-MIP/370 package. Also comparison of an alternative formulation & its related computational time from an earlier study is done. The modest solution times achieved for problems recognized as test problems gives encouragement to believe that such an approach deserves further consideration.