| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |
|
|
|
|||||||
|
|||||||||
École des Hautes Études Commerciales and GERAD, 3000, chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7
Given a set of flight legs to be flown by a single type of aircraft, the simultaneous aircraft routing and crew scheduling problem consists of determining a minimum-cost set of aircraft routes and crew pairings such that each flight leg is covered by one aircraft and one crew, and side constraints are satisfied. While some side constraints such as maximum flight time and maintenance requirements involve only crews or aircraft, linking constraints impose minimum connection times for crews that depend on aircraft connections. To handle these linking constraints, a solution approach based on Benders decomposition is proposed. The solution process iterates between a master problem that solves the aircraft routing problem, and a subproblem that solves the crew pairing problem. Because of their particular structure, both of these problems are solved by column generation. A heuristic branch-and-bound method is used to compute integer solutions. On a set of test instances based on data provided by an airline, the integrated approach produced significant cost savings in comparison with the sequential planning process commonly used in practice. The largest instance solved contains more than 500 flight legs over a 3-day period.
École Polytechnique and GERAD, C.P. 6079, Succ. Centre-Ville, Montréal, Canada H3C 3A7
École Polytechnique and GERAD, C.P. 6079, Succ. Centre-Ville, Montréal, Canada H3C 3A7
École des Hautes Études Commerciales and GERAD, 3000, chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7
This article has been cited by other articles:
|
|
 |
|
  C. Gao, E. Johnson, and B. Smith Integrated Airline Fleet and Crew Robust Planning Transportation Science, February 1, 2009; 43(1): 2 - 16. [Abstract] [PDF]
|
|
|
|
 |
|
 C. Barnhart, A. Farahat, and M. Lohatepanont Airline Fleet Assignment with Enhanced Revenue Modeling Operations Research, January 1, 2009; 57(1): 231 - 244. [Abstract] [PDF]
|
|
|
|
|
|
R. Agarwal and O. Ergun Ship Scheduling and Network Design for Cargo Routing in Liner Shipping Transportation Science, May 1, 2008; 42(2): 175 - 196. [Abstract] [PDF]
|
|
|
|
|
|
A. Mercier A Theoretical Comparison of Feasibility Cuts for the Integrated Aircraft-Routing and Crew-Pairing Problem Transportation Science, February 1, 2008; 42(1): 87 - 104. [Abstract] [PDF]
|
|
|
|
|
|
A. Cohn, S. Root, A. Wang, and D. Mohr Integration of the Load-Matching and Routing Problem with Equipment Balancing for Small Package Carriers Transportation Science, May 1, 2007; 41(2): 238 - 252. [Abstract] [PDF]
|
|
|
|
|
|
D. Huisman, R. Freling, and A. P. M. Wagelmans Multiple-Depot Integrated Vehicle and Crew Scheduling Transportation Science, November 1, 2005; 39(4): 491 - 502. [Abstract] [PDF]
|
|
|
|
 |
|
 S. Elhedhli and J.-L. Goffin Efficient Production-Distribution System Design Management Science, July 1, 2005; 51(7): 1151 - 1164. [Abstract] [PDF]
|
|
|
|
 |
|
 R. C. Prior, R. L. Slavens, J. Trimarco, V. Akgun, E. G. Feitzinger, and C.-F. Hong Menlo Worldwide Forwarding Optimizes Its Network Routing Interfaces, January 1, 2004; 34(1): 26 - 38. [Abstract] [PDF]
|
|
|
|
|
|
C. Martin, D. Jones, and P. Keskinocak Optimizing On-Demand Aircraft Schedules for Fractional Aircraft Operators Interfaces, September 1, 2003; 33(5): 22 - 35. [Abstract] [PDF]
|
|
|
|
|
|
D. Klabjan, E. L. Johnson, G. L. Nemhauser, E. Gelman, and S. Ramaswamy Airline Crew Scheduling with Time Windows and Plane-Count Constraints Transportation Science, August 1, 2002; 36(3): 337 - 348. [Abstract] [PDF]
|
|
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |
