Two linear programming models for the least-cost routing of a fleet of cargo aircraft which must deliver specified amounts of cargo during a given planning period are formulated. The first is a multiple-orign single-destination model, while the second is a multiple-origin multiple-destination model. The outputs from the models give the number of sorties to be flown over each leg of the system and the amount of cargo to be flown over those legs. Some anticipated uses for these models are (1) assistance in efficient aircraft scheduling, (2) determination of best routes for new aircraft types during their phase-in periods, (3) cost-effectiveness analysis for enroute bases, and (4) determination of optimal location and size of aerial port and transshipment facilities. (Author)
A Linear Programming Approach to the Least-Cost Air Cargo Routing Problem
1970
26 pages
Report
Keine Angabe
Englisch
An integer programming approach to the bloodmobile routing problem
Online Contents | 2016
|An integer programming approach to the bloodmobile routing problem
Elsevier | 2015
|A linear programming-based method for the network revenue management problem of air cargo
Online Contents | 2015
|