Multifleet routing and multistop flight scheduling for schedule perturbation

DOI10.1016/S0377-2217(96)00260-3zbMath0922.90063OpenAlexW2014137460MaRDI QIDQ1280131

Shangyao Yan, Yu-Ping Tu

Publication date: 10 March 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00260-3

zbMATH Keywords

Lagrangian relaxationflight schedulingsubgradient methodsfleet routingairline managementmultiple commodity network flow

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Related Items (7)

Constraint-specific recovery network for solving airline recovery problems ⋮ Real-time freight locomotive rescheduling and uncovered train detection during disruption ⋮ Model‐based solution approach for a short‐term flight rescheduling problem in aerial passenger transportation to maritime units ⋮ Disruption management in flight gate scheduling ⋮ Solving the flight perturbation problem with meta heuristics ⋮ Two-stage heuristic algorithm for aircraft recovery problem ⋮ Disruption management in the airline industry-concepts, models and methods

Cites Work

• Optimal dispatching strategy on an airline network after a schedule perturbation
• A Review of Sensitivity Results for Linear Networks and a New Approximation to Reduce the Effects of Degeneracy
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Multifleet routing and multistop flight scheduling for schedule perturbation