A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture
From MaRDI portal
Publication:2442084
DOI10.1007/s10479-011-0906-3zbMath1284.90026OpenAlexW2079855108MaRDI QIDQ2442084
Hanif D. Sherali, Ki-Hwan Bae, Mohamed Haouari
Publication date: 31 March 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-0906-3
valid inequalitiesBenders decompositionfleet assignmentrecaptureflight retimingintegrated airline operationsschedule design
Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)
Related Items
Integrated aircraft-path assignment and robust schedule design with cruise speed control, Airline flight schedule planning under competition, Solving a large-scale integrated fleet assignment and crew pairing problem, A rolling-horizon approach for multi-period optimization, Optimizing integrated aircraft assignment and turnaround handling, On generating maximal nondominated Benders cuts, Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines, Airport capacity extension, fleet investment, and optimal aircraft scheduling in a multilevel market model: quantifying the costs of imperfect markets, A Benders decomposition approach for solving the offshore wind farm installation planning at the North Sea, An integrated flight scheduling and fleet assignment problem under uncertainty, Reliability evaluation of a multi-state air transportation network meeting multiple travel demands
Cites Work
- Exact approaches for integrated aircraft fleeting and routing at TunisAir
- Large-scale mixed integer programming: Benders-type heuristics
- Airline fleet assignment concepts, models, and algorithms
- An integrated model for logistics network design
- Integrated airline scheduling
- Partitioning procedures for solving mixed-variables programming problems
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- Local branching
- A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
- The fleet assignment problem: Solving a large scale integer program
- A note on the selection of Benders' cuts
- Flight String Models for Aircraft Fleeting and Routing
- Airline Fleet Assignment with Time Windows
- A Benders Decomposition Approach for the Locomotive and Car Assignment Problem
- Integrated Airline Schedule Design and Fleet Assignment: Polyhedral Analysis and Benders' Decomposition Approach
- Accelerating Benders Decomposition by Local Branching
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Integrated Airline Fleeting and Crew-Pairing Decisions
- Two-Stage Fleet Assignment Model Considering Stochastic Passenger Demands
- Accelerating Benders method using covering cut bundle generation
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Multicommodity Distribution System Design by Benders Decomposition
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- Advances in the Optimization of Airline Fleet Assignment
- Daily Aircraft Routing and Scheduling
- Maintenance and Crew Considerations in Fleet Assignment
- Itinerary-Based Airline Fleet Assignment
- Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
- Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network
- Demand Driven Dispatch: A Method for Dynamic Aircraft Capacity Assignment, Models and Algorithms
