Show simple item record

dc.contributor.authorMangoubi, Ramien_US
dc.contributor.otherMassachusetts Institute of Technology. Flight Transportation Laboratoryen_US
dc.date.accessioned2012-01-06T06:40:54Z
dc.date.available2012-01-06T06:40:54Z
dc.date.issued1980en_US
dc.identifier06673060en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/67926
dc.descriptionJune 1980en_US
dc.descriptionIncludes bibliographical references (p. 110)en_US
dc.description.abstractThis research solves the flight-to-gate assignment problem at airports in such a way as to minimize, or at least reduce, walking distances for passengers inside terminals. Two solution methods are suggested. The first is a heuristic algorithm which assigns the "most crowded" aircraft (i.e., most on-board passengers) to the best gate, while the second consists of formulating the problem as a linear program. A flight schedule of one day at Terminal No. 2 of Toronto International Airport is used to test and compare the two methods. The algorithm offers an assignment solution with a 27% reduction in the expected walking distance when compared to the original assignment at the airport. The linear program's assignment gives a 32% reduction. The heuristic algorithm is, therefore, only 5% suboptimal for the sample problem. In addition, its associated computational expenses, less than $10 per run, are by far cheaper than those of the linear program with expenses as high as $400 per run. Such excellent, or even acceptable, performance by the algorithm cannot be guaranteed for all problems. A strategy which helps decide when to use which approach is therefore suggested.en_US
dc.format.extent110 pen_US
dc.publisherCambridge, Mass. : Massachusetts Institute of Technology, Flight Transportation Laboratory, [1980]en_US
dc.relation.ispartofseriesFTL report (Massachusetts Institute of Technology. Flight Transportation Laboratory) ; R80-1en_US
dc.subjectAirportsen_US
dc.subjectLinear programmingen_US
dc.subjectPlanningen_US
dc.subjectData processingen_US
dc.titleA linear programming solution to the gate assignment problem at airport terminalsen_US
dc.typeTechnical Reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record