MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Department of Aeronautics and Astronautics
  • Flight Transportation Laboratory
  • Flight Transportation Laboratory Reports
  • View Item
  • DSpace@MIT Home
  • Department of Aeronautics and Astronautics
  • Flight Transportation Laboratory
  • Flight Transportation Laboratory Reports
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Some fleet routing and scheduling problems for air transportation systems

Author(s)
Levin, Amos
Thumbnail
DownloadFTL_R_1968_05.pdf (4.789Mb)
Other Contributors
United States. Office of High-Speed Ground Transportation
Massachusetts Institute of Technology. Flight Transportation Laboratory
Metadata
Show full item record
Abstract
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.
Description
1969
 
PB-174912
 
Includes bibliographical references (p. 124-125)
 
Date issued
1969
URI
http://hdl.handle.net/1721.1/68120
Publisher
[Cambridge, Mass.] : Massachusetts Institute of Technology Flight Transportation Laboratory, [1969]
Other identifiers
48394688
Series/Report no.
FTL report (Massachusetts Institute of Technology. Flight Transportation Laboratory) ; R68-5
Keywords
Production scheduling, Airlines, Linear programming, Management

Collections
  • Flight Transportation Laboratory Reports

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.