Finding the minimum cost of an airline route using the traveling salesman problem

• المؤلفون الرئيسيون: Su-A, Kim, Tan, Jane Lisette T.
• التنسيق: text
• اللغة: English
• منشور في: Animo Repository 2014
• الموضوعات: Physical Sciences and Mathematics
• الوصول للمادة أونلاين: https://animorepository.dlsu.edu.ph/etd_bachelors/17997

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...