Show simple item record

dc.contributor.authorLevin, Amosen_US
dc.contributor.otherUnited States. Office of High-Speed Ground Transportationen_US
dc.contributor.otherMassachusetts Institute of Technology. Flight Transportation Laboratoryen_US
dc.date.accessioned2012-01-06T22:05:48Z
dc.date.available2012-01-06T22:05:48Z
dc.date.issued1969en_US
dc.identifier11145205en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/68063
dc.description1969en_US
dc.descriptionPB-174912en_US
dc.descriptionIncludes bibliographical references (p. 124-125)en_US
dc.description.abstractThe purpose of this work is to formulate and develop practicable solution methods to some important fleet routing, scheduling and fleet composition problems. These problems arise in the operation of air transportation systems like the operating domestic and international airlines. The problem of minimal fleet size to meet a variable schedule, which will be fixed when the system goes into operation, is formulated in several ways as Integer Linear Programs in 0-1 variables. The ILP's obtained are large scale programs and solved here by Land and Doig type Branch and Bound algorithms. The computational experiments with them, which were conducted with MPS/360, have been very sucessful and in the majority of cases, particularly when larger systems are solved, the algorithms terminated at the optimal integer solutions after a single iteration. The problem of scheduling and routing the minimal fleet is then formulated as an ILP which has exhibited equally successful computational results. The minimal single fleet-problem is extended to include some extraneous constraints on service frequencies between and at stations. Computational results with examples are provided. The problem of system design with and without a given fleet size is formulated. The problem of decomposition of the system into subsystems, each consisting of a single vehicle type is next formulated in several ways for several considerations. These formulations are also given as Integer Linear Programs. The first is proven to have at least one optimal integer solution. Computational experience with the application of the Land and Doig Branch and Bound algorithm to some of the other multi-fleet problems is also given. A computerized Airline Management Decision System which will use the models and solution methods developed in this work is briefly described in Appendix A. The Crew Scheduling Problem is also briefly discussed in this appendix since its solution procedures must be a part of such a Decision System.en_US
dc.description.sponsorshipOffice of High Speed Ground Transport, Dept. of Commerceen_US
dc.format.extent125 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-5en_US
dc.subjectProduction schedulingen_US
dc.subjectAirlinesen_US
dc.subjectLinear programmingen_US
dc.subjectManagementen_US
dc.titleSome fleet routing and scheduling problems for air transportation systemsen_US
dc.typeTechnical Reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record