AI SearchA TSP solution approach by integer linear programming
Call Number: AIT SSPR no. IE-82-07 Material type:
SeriesSeries: Asian Institute of Technology. Special studies project report ; no. IE-82-07Publication details: Bangkok : Asian Institute of Technology, 1982Description: 31 pSubject(s): Online resources: Dissertation note: Special Studies Project Report (M. Eng.) - Asian Institute of Technology, 1982 Summary: 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.
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
22-AIT Thesis (Replacement)
|
Asian Institute of Technology Library AIT Publications | AIT SSPR no. IE-82-07 (Browse shelf(Opens below)) | 4 | Available | 30050120567929 | |||||||||||||
40-Archives
|
Asian Institute of Technology Library Archives | AIT SSPR no. IE-82-07 (Browse shelf(Opens below)) | 1 | Available | 30050120346399 |
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.
There are no comments on this title.