Airport surface trajectory optimization considering runway exit selection

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

“…Another widely adopted modeling strategy involves a sequential procedure in which the route allocation problem (that assigns a specific path for each aircraft) is first solved, and a scheduling problem is subsequently solved to compute the time spent by an aircraft on each arc such that all taxiway conflicts among aircraft are avoided (Gupta et al, 2010; Pesic et al, 2001). Research efforts that consider the taxiway route allocation and scheduling problems simultaneously include: Godbole et al (2017), who proposed an exact branch‐and‐bound algorithm to simultaneously solve small‐scale route allocation and scheduling problems (with a maximum of 8 aircraft); Marin (2006) and Marin and Codina (2008), who proposed a time–space network model that only considered capacity constraints at the taxiway intersections; and Cheng et al (2014), who considered taxiway conflict in their study, while ignoring the possibility of head‐on and rear‐end collisions at the taxiway. A three step heuristic sequential approach was proposed by Guépet et al (2017), where the earliest runway arrival time for departure flights and the earliest gate arrival time for arrival flights were estimated first and used to sequence take offs.…”