A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
From MaRDI portal
Publication:1764761
DOI10.1016/j.cor.2003.11.013zbMath1122.90355MaRDI QIDQ1764761
Jean-François Soumis, Jean-François Cordeau, Anne Mercier
Publication date: 22 February 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)
Related Items (48)
Hub location problems with price sensitive demands ⋮ Two heuristic methods based on decomposition to the integrated multi-agent supply chain scheduling and distribution problem ⋮ Urban rapid transit network design: accelerated Benders decomposition ⋮ Mathematical formulations for a 1-full-truckload pickup-and-delivery problem ⋮ Benders decomposition applied to profit maximizing hub location problem with incomplete hub network ⋮ Recoverable robust single day aircraft maintenance routing problem ⋮ Improving robustness of rolling stock circulations in rapid transit networks ⋮ Preemptive rerouting of airline passengers under uncertain delays ⋮ Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain ⋮ Solving a large-scale integrated fleet assignment and crew pairing problem ⋮ An integrated aircraft routing, crew scheduling and flight retiming model ⋮ Application of multiple-population genetic algorithm in optimizing the train-set circulation plan problem ⋮ Parking buses in a depot using block patterns: a Benders decomposition approach for minimizing type mismatches ⋮ Multiple allocation tree of hubs location problem for non-complete networks ⋮ Optimization of the integrated problem of employee timetabling and job shop scheduling ⋮ A compact optimization model for the tail assignment problem ⋮ A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption ⋮ A taxonomy of multilayer network design and a survey of transportation and telecommunication applications ⋮ Alternating Lagrangian decomposition for integrated airline crew scheduling problem ⋮ Vessel Service Planning in Seaports ⋮ A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services ⋮ Optimizing integrated aircraft assignment and turnaround handling ⋮ A branch-and-price-and-cut algorithm for operating room scheduling under human resource constraints ⋮ Integrated airline crew scheduling: a bi-dynamic constraint aggregation method using neighborhoods ⋮ A solution approach based on Benders decomposition for the preventive maintenance scheduling problem of a stochastic large-scale energy system ⋮ On generating maximal nondominated Benders cuts ⋮ A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture ⋮ An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming ⋮ The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems ⋮ Dynamic constraint aggregation for solving very large-scale airline crew pairing problems ⋮ Integrated airline scheduling ⋮ Benders decomposition for set covering problems. Almost satisfying the consecutive ones property ⋮ The Benders decomposition algorithm: a literature review ⋮ Network flow-based approaches for integrated aircraft fleeting and routing ⋮ Operational aircraft maintenance routing problem with remaining time consideration ⋮ Solving shortest path problems with a weight constraint and replenishment arcs ⋮ Exact approaches for integrated aircraft fleeting and routing at TunisAir ⋮ Personnel scheduling: models and complexity ⋮ Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework ⋮ Simultaneous fleet assignment and cargo routing using Benders decomposition ⋮ A new formulation and an exact approach for the many-to-many hub location-routing problem ⋮ Practical enhancements to the Magnanti-Wong method ⋮ Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints ⋮ Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound ⋮ The Aircraft Maintenance Routing Problem ⋮ A decomposed branch-and-price procedure for integrating demand planning in personnel staffing problems ⋮ An iterative approach to robust and integrated aircraft routing and crew scheduling ⋮ A decomposition approach for the integrated vehicle-crew-roster problem with days-off pattern
Cites Work
- Unnamed Item
- Partitioning procedures for solving mixed-variables programming problems
- The aircraft rotation problem
- Global optimization approaches to an aircraft routing problem
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- The Four-Day Aircraft Maintenance Routing Problem
- Flight String Models for Aircraft Fleeting and Routing
- Improving Crew Scheduling by Incorporating Key Maintenance Routing Decisions
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Advances in the Optimization of Airline Fleet Assignment
- Daily Aircraft Routing and Scheduling
- Maintenance and Crew Considerations in Fleet Assignment
- Airline Crew Scheduling with Time Windows and Plane-Count Constraints
- Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
- Constructing robust crew schedules with bicriteria optimization
- The Aircraft Maintenance Routing Problem
This page was built for publication: A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
