Finding the minimum cost of an airline route using the traveling salesman problem
We present an application of the Traveling Salesman Problem (TSP) using Integer Linear Programming (ILP) via Branch-and-Bound and Heuristics via Nearest Neighbor and 2-Opt. We apply these methods to find the minimum cost of visiting 48 states in the United States of America (U.S.A.) where we have to...
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Animo Repository
2014
|
| 主題: | |
| 在線閱讀: | https://animorepository.dlsu.edu.ph/etd_bachelors/17997 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| id |
oai:animorepository.dlsu.edu.ph:etd_bachelors-18510 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:etd_bachelors-185102022-01-05T00:46:02Z Finding the minimum cost of an airline route using the traveling salesman problem Su-A, Kim Tan, Jane Lisette T. We present an application of the Traveling Salesman Problem (TSP) using Integer Linear Programming (ILP) via Branch-and-Bound and Heuristics via Nearest Neighbor and 2-Opt. We apply these methods to find the minimum cost of visiting 48 states in the United States of America (U.S.A.) where we have to visit each states exactly once and return to its original destination. We compare the different results and see how each algorithm appraise the accuracy of the calculations. 2014-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/17997 Bachelor's Theses English Animo Repository Physical Sciences and Mathematics |
| institution |
De La Salle University |
| building |
De La Salle University Library |
| continent |
Asia |
| country |
Philippines Philippines |
| content_provider |
De La Salle University Library |
| collection |
DLSU Institutional Repository |
| language |
English |
| topic |
Physical Sciences and Mathematics |
| spellingShingle |
Physical Sciences and Mathematics Su-A, Kim Tan, Jane Lisette T. Finding the minimum cost of an airline route using the traveling salesman problem |
| description |
We present an application of the Traveling Salesman Problem (TSP) using Integer Linear Programming (ILP) via Branch-and-Bound and Heuristics via Nearest Neighbor and 2-Opt. We apply these methods to find the minimum cost of visiting 48 states in the United States of America (U.S.A.) where we have to visit each states exactly once and return to its original destination. We compare the different results and see how each algorithm appraise the accuracy of the calculations. |
| format |
text |
| author |
Su-A, Kim Tan, Jane Lisette T. |
| author_facet |
Su-A, Kim Tan, Jane Lisette T. |
| author_sort |
Su-A, Kim |
| title |
Finding the minimum cost of an airline route using the traveling salesman problem |
| title_short |
Finding the minimum cost of an airline route using the traveling salesman problem |
| title_full |
Finding the minimum cost of an airline route using the traveling salesman problem |
| title_fullStr |
Finding the minimum cost of an airline route using the traveling salesman problem |
| title_full_unstemmed |
Finding the minimum cost of an airline route using the traveling salesman problem |
| title_sort |
finding the minimum cost of an airline route using the traveling salesman problem |
| publisher |
Animo Repository |
| publishDate |
2014 |
| url |
https://animorepository.dlsu.edu.ph/etd_bachelors/17997 |
| _version_ |
1772835262743707648 |