A study of heuristic approaches for runway scheduling for the Dallas-Fort Worth Airport /

Bibliographic Details
Main Author: Stiverson, Paul W.
Other Authors: Rathinam, Sivakumar (Thesis advisor)
Format: Thesis eBook
Language:English
Published: [College Station, Tex.] : [Texas A&M University], [2010]
Subjects:
Online Access:Link to OAK Trust copy

MARC

Tag First Indicator Second Indicator Subfields
LEADER 00000cam a2200000Ka 4500
001 in00002573921
005 20151201120049.0
006 m f d
007 cr unu||||||||
008 100423s2010 txu sbm 000 0 eng d
035 |a (OCoLC)ocn608745698 
035 |a (OCoLC)608745698 
035 |a (TxCM)http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-758 
040 |a TXA  |c TXA  |d UtOrBLW 
049 |a TXAM 
099 |a 2009  |a Thesis  |a 1969.1/ETD-TAMU-2009-05-758 
100 1 |a Stiverson, Paul W. 
245 1 2 |a A study of heuristic approaches for runway scheduling for the Dallas-Fort Worth Airport /  |c by Paul William Stiverson. 
264 1 |a [College Station, Tex.] :  |b [Texas A&M University],  |c [2010] 
300 |a 1 online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
500 |a "Major Subject: Mechanical Engineering" 
500 |a Title from author supplied metadata (automated record created 2010-03-12 12:08:51). 
502 |b Master of Science  |c Texas A&M University  |d 2009  |o http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-758 
504 |a Includes bibliographical references. 
516 |a Text (Thesis) 
520 3 |a Recent work in air transit efficiency has increased en-route efficiency to a point that airport efficiency is the bottleneck. With the expected expansion of air transit it will become important to get the most out of airport capacity. Departure scheduling is an area where efficiency stands to be improved, but due to the complicated nature of the problem an optimal solution is not always forthcoming. A heuristic approach can be used to find a sub-optimal take-off order in a significantly faster time than the optimal solution can be found using known methods. The aim of this research is to explore such heuristics and catalog their solution characteristics. A greedy approach as well as a k-interchange approach were developed to find improved takeoff sequences. When possible, the optimal solution was found to benchmark the performance of the heuristics, in general the heuristic solutions were within 10-15% of the optimal solution. The heuristic solutions showed improvements of up to 15% over the first-in first-out order with a running time around 4 ms. 
500 |a Electronic resource. 
650 4 |a Major mechanical engineering. 
653 |a heuristics 
653 |a Departure Scheduling 
700 1 |a Rathinam, Sivakumar,  |e thesis advisor. 
856 4 0 |u http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-758  |z Link to OAK Trust copy  |t 0 
994 |a C0  |b TXA 
948 |a cataloged  |b h  |c 2010/4/23  |d c  |e jlanham  |f 1:15:24 pm 
999 |a MARS 
999 f f |s 81224463-326e-389c-9a28-0acfb6b2f330  |i 752b1c9f-5391-366b-b1ed-6cc5c2c45dcf  |t 0 
952 f f |a Texas A&M University  |b College Station  |c Electronic Resources  |d Available Online  |t 0  |e 2009 Thesis 1969.1/ETD-TAMU-2009-05-758  |h Other scheme 
998 f f |a 2009 Thesis 1969.1/ETD-TAMU-2009-05-758  |t 0  |l Available Online