A 0–1 mixed‐integer program‐based group‐and‐release strategy for solving the integrated runway scheduling and taxiway routing problem

DOI10.1002/nav.22072zbMath1523.90154MaRDI QIDQ6051597

Jitamitra Desai, Dong Zhang, Sandeep Srivathsan, Unnamed Author

Publication date: 20 October 2023

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

zbMATH Keywords

0-1 mixed integer programmingairport surface managementgroup-and-release methodsrunway sequencing and schedulingsequential heuristicstaxiway routing

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Cites Work

• A dynamic programming approach for the aircraft landing problem with aircraft classes
• The aircraft ground routing problem: analysis of industry punctuality indicators in a sustainable perspective
• An efficient hybrid meta-heuristic for aircraft landing problem
• Aircraft landing problems with aircraft classes
• A more realistic approach for airport ground movement optimisation with stand holding
• Network design: Taxi planning
• Solving the time-discrete winter runway scheduling problem: a column generation and constraint programming approach
• Airport management: taxi planning
• Solving the aircraft landing problem with time discretization approach
• The aircraft runway scheduling problem: a survey
• Scheduling Aircraft Landings—The Static Case
• Enhanced Models for a Mixed Arrival-Departure Aircraft Sequencing Problem
• Algorithms for Scheduling Runway Operations Under Constrained Position Shifting

This page was built for publication: A 0–1 mixed‐integer program‐based group‐and‐release strategy for solving the integrated runway scheduling and taxiway routing problem