Show simple item record

dc.contributor.authorSimpson, R. W.en_US
dc.contributor.otherMassachusetts Institute of Technology. Flight Transportation Laboratoryen_US
dc.date.accessioned2012-01-06T06:59:44Z
dc.date.available2012-01-06T06:59:44Z
dc.date.issued1969en_US
dc.identifier05302810en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/67999
dc.descriptionDecember 1969en_US
dc.descriptionPB 196 528en_US
dc.descriptionIncludes bibliographical referencesen_US
dc.description.abstractForeword: This report attempts to put together all of the optimal computer models concerned with scheduling and routing problems for passenger transportation systems. By placing them in one place, classifying them, and using a consistent notation, it is hoped that the models' relationships to each other can be seen, and that a clear picture of the state of the art in model building and solving can be shown. The emphasis of the report is on optimal models which use well-known optimization techniques from mathematical programming. Work which uses heuristic computer methods in this area is quite extensive, but is not described here. The models are oriented towards public transportation systems operati-ng on a short haul network. Generally a cyclic or repetitive schedule of services is assumed, and a single vehicle rather than a train of vehicles is being dispatched. Within those assumptions, the models can find applicability to schedule planning for a wide range of public transportation systems, not necessarily just airline systems. The research is supported in part by the Office of High Speed Ground Transportation, Department of Transportation, and is pointed towards producing schedules for both high speed trains and future V/STOL aircraft. The models are useful to planners and regulators in studying problems in corporate planning, in transportation systems planning, and in regulation of transportation industries. An extensive bibliography accompanies each class of models in this report. If it is not complete (with respect to optimal models), I would appreciate receiving additional references from interested readers. One of the reasons for writing this report is to give a good bibliography for various groups of present researchers who seem to be unaware of segments of the literature, or of each other's activities. Much of the content of this report has been taken from lecture notes prepared by the author for an MIT graduate course, "Flight Transportation Operations Analysis", given by the author for the past few years. Students from that course will recognize the examples as being homework problems involving "Tech Airways", and I am indebted to them since some of their computer solutions are used as examples in the report. As well, the report gives an overview of current research activity in this area in the MIT Flight Transportation Laboratory. A previous report, FTL R68-5 by Professor Amos Levin describes some of the Fleet Routing models and computational methods for solving them. Other reports and theses from the laboratory are referenced where appropriate. I must also recognize the work performed by Dave Benbasset, Norm Clerman, and Thor Paalson in providing computer runs for several of the examples. iven_US
dc.format.extentxv [i.e. xvi], 157 pen_US
dc.publisher[Cambridge, Mass.] : Massachusetts Institute of Technology, Flight Transportation Laboratory, [1969]en_US
dc.relation.ispartofseriesFTL report (Massachusetts Institute of Technology. Flight Transportation Laboratory) ; R68-3en_US
dc.subjectAirlinesen_US
dc.subjectOperations researchen_US
dc.subjectAeronautics, Commercialen_US
dc.subjectAir traffic controlen_US
dc.subjectProduction schedulingen_US
dc.subjectManagementen_US
dc.subjectMathematical modelsen_US
dc.subjectPassenger trafficen_US
dc.titleScheduling and routing models for airline systemsen_US
dc.typeTechnical Reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record