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 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|