Advanced Search
DSpace@MIT

Parallel parametric combinatorial search : its application to runway scheduling

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.author Trivizas, Dionyssios Anastasios en_US
dc.contributor.other Massachusetts Institute of Technology. Flight Transportation Laboratory en_US
dc.date.accessioned 2012-01-06T22:04:38Z
dc.date.available 2012-01-06T22:04:38Z
dc.date.issued 1987 en_US
dc.identifier 18486422 en_US
dc.identifier.uri http://hdl.handle.net/1721.1/68055
dc.description Cover title en_US
dc.description February 1987 en_US
dc.description Also issued as a Ph. D. thesis, Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 1987 en_US
dc.description Includes bibliographical references (p. 167-171) en_US
dc.description.abstract The Runway Scheduling Problem (RSP) addresses the fundamental issues of airport congestion and energy conservation. It is a variation of the Traveling Salesman Problem (TSP) from which it differs in three basic points: the maximum position shift (MPS) constraints, the requirement to enforce the triangular in its cost structure and the multiplicity of runways (corresponding to multiple salesmen in TSP). The RSP is dynamic, requiring fast and frequent schedule updates. The MPS constraints, designed to prevent inequitable treatment of aircraft, define a combinatorial neighborhood of tours around a base tour, determined by the arrival sequence of aircraft in RSP. The neighborhood contains all tours in which the position of an object (aircraft, city etc.) in the new tour is within MPS positions of its position in the base tour. The parameter MPS controls the radius of the neighborhood, which covers the full solution space when MPS equals half the number of aircraft. We first describe the RSP and then develop a parallel processor (PPMPS) that finds the optimal solution in the MPS-neighborhood in time linear to the number of objects, using up to 4MPS processors in parallel. Subsequently, PPM'S is applied to the general RSP and a case study is presented to justify simplifying assumptions in the scheduling of mixed traffic on multiple runways. The case study shows substantial improvements in the capacity of a system of three runways. Suggestions are made on how to use the PPMPS to create fast heuristic procedures for the TSP, based on divide and conquer and node insertion strategies. en_US
dc.description.sponsorship Supported, in part, by grants from the FAA. en_US
dc.format.extent 171 p en_US
dc.publisher Cambridge, Mass. : Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, Flight Transportation Laboratory, [1987] en_US
dc.relation.ispartofseries FTL report (Massachusetts Institute of Technology. Flight Transportation Laboratory) ; R87-4 en_US
dc.title Parallel parametric combinatorial search : its application to runway scheduling en_US
dc.title.alternative Parametric combinatorial search, parallel : its application to runway scheduling en_US
dc.type Technical Report en_US


Files in this item

Name Size Format Description
FTL_R_1987_04.pdf 8.058Mb PDF

This item appears in the following Collection(s)

Show simple item record

MIT-Mirage