Dense metropolitan skies can create massive air-ground bottlenecks at urban vertiports. We present a globally optimal mathematical framework for simultaneous arrival, charging, and departure sequencing.
By framing aircraft arrival times, landing pad assignments, rapid-charging sessions, and passenger connections as an integrated Mixed-Integer Linear Program (MILP), the solver delivers proven conflict-free schedules in under 1.2 seconds.
Simulation of a peak morning rush hour across New York and London regional vertiports demonstrated an 89% reduction in ground delay compared to traditional first-come first-served sequencing.