Title

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

Date of Publication

2014

Document Type

Bachelor's Thesis

Degree Name

Bachelor of Science in Mathematics

Subject Categories

Physical Sciences and Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics Department

Abstract/Summary

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.

Abstract Format

html

Language

English

Format

Electronic

Accession Number

CDTU019210

Shelf Location

Archives, The Learning Commons, 12F, Henry Sy Sr. Hall

This document is currently not available here.

Share

COinS