Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues [An article from: European Journal of Operational Research] | ![Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues [An article from: European Journal of Operational Research]](http://ecx.images-amazon.com/images/I/51G4P0G7AGL._SL160_.jpg)
 enlarge | Authors: N. Belanger, G. Desaulniers, F. Soumis, Desrosiers
Publisher: Elsevier
Category: Book
Buy New: $7.95
Format: Html
Media: Digital
Publication Date: December 16, 2006
Availability: Available for download now
| |
| Editorial Reviews:
Product Description
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2006. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
Given the sets of flights and aircraft of an airline carrier, the fleet assignment problem consists of assigning the most profitable aircraft type to each flight. In this paper we propose a model for the periodic fleet assignment problem with time windows in which departure times are also determined. Anticipated profits depend on the schedule and the selection of aircraft types. In addition, short spacings between consecutive flights which serve the same origin-destination pair of airports are penalized. We propose a non-linear integer multi-commodity network flow formulation. We develop new branch-and-bound strategies which are embedded in our branch-and-price solution strategy. Finally, we present computational results for periodic daily schedules on three real-world data sets.
|
|
|
