Some fleet routing and scheduling problems for air transportation systems
Series: Massachusetts Institute of Technology. Flight Transportation Laboratory. Report -- [no.] R-68-5; FTL report (Massachusetts Institute of Technology. Flight Transportation Laboratory) -- no. R-68-5
Publisher: Massachusetts Institute of Technology Flight Transportation Laboratory
Published: 1969
Place of publication: Cambridge, Mass.
Language: eng
Number of pages: 125
Subjects: Production scheduling; Airlines; Management; Linear programming
Description: The 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.
Notes: "Prepared for the U.S. Dept. of Transportation under contract C-136-66."

Includes bibliography.