| Author | Rajendra, Nagaratnam |
| Call Number | AIT SSPR no. IE-82-07 |
| Subject(s) | Traveling-salesman problem--Linear programming
|
| Note | A special study submitted in partial fulfillment of the requirement for the degree of Master of Engineering, School of Engineering and Technology |
| Publisher | Asian Institute of Technology |
| Abstract | 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. |
| Year | 1982 |
| Type | Special Study Project Report (SSPR) |
| School | School of Engineering and Technology |
| Department | Department of Industrial Systems Engineering (DISE) |
| Academic Program/FoS | Industrial Engineering (IE) |
| Chairperson(s) | Oudheusden, Dirk L. Van |
| Examination Committee(s) | Fujiwara, Okitsugu ; Tabucanon, Mario T.
|
| Scholarship Donor(s) | The Royal Dutch Government |
| Degree | Special Studies Project Report (M. Eng.) - Asian Institute of Technology, 1982 |