Date Thesis Awarded

5-2010

Document Type

Honors Thesis

Degree Name

Bachelors of Science (BS)

Department

Mathematics

Advisor

David Phillips

Committee Member

Tanujit Dey

Committee Member

Rex K. Kincaid

Committee Member

Lawrence M. Leemis

Committee Member

Carlisle E. Moody, Jr.

Abstract

We model the problem of finding minimum-delay routes through the U.S. flight network as a shortest paths problem with stochastic costs. Our approach utilizes statistical modeling, Monte Carlo simulation, and network optimization techniques. Our models and simulations are based on data obtained from the U.S. Department of Transportation. Our sampling techniques allow us to model the time dependence of arc costs.

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License.

Comments

Thesis is part of Honors ETD pilot project, 2008-2013. Migrated from Dspace in 2016.

Share

COinS