Noise-Aware Fleet Scheduling for On-Demand Urban Air Mobility with Alternative Flight Paths and Cruise Separation
Abstract
Multiple candidate flight paths between the same vertiports provide flexibility for managing noise exposure and cruise separation in on-demand urban air mobility (UAM). This paper introduces the fleet scheduling problem with alternative flight paths (FSP-AFP). We develop a time-expanded fleet-flow formulation for a finite aircraft fleet, in which each service or empty repositioning flight is assigned a planar path from a predefined set of alternatives connecting its origin and destination vertiports. These path choices are jointly optimized with cruise altitudes, departure times, and repositioning movements, while maintaining aircraft flow balance and enforcing geometric separation between flights cruising concurrently at the same altitude. The objective combines flight costs, service departure delays, and population-weighted noise exposure. A tailored branch-and-cut algorithm incorporates three complementary clique constructions based on a request-augmented conflict graph, exploiting physical flight conflicts, request exclusivity, and request-route relationships. Computational experiments show that, compared with a baseline implemented using Gurobi's native lazy-constraint functionality, the proposed algorithm generally obtains stronger lower bounds and finds feasible solutions for all test instances, while generating fewer cuts on average and achieving a 43.16-fold reduction in the mean number of processed search nodes. An operational case study shows that increasing the number of candidate planar routes per vertiport pair from one to four reduces the weighted objective by 6.71% and modeled noise exposure by 15.14% under the cruise-separation constraints. Further increases in the number of candidate routes yield only marginal improvement in the objective value. These findings show the value of coordinating alternative flight paths, scheduling, and fleet circulation in UAM.
Related
- Multi-UAV Emergency Scheduling Under Demand Accumulation and Payload-Dependent Energy
- Forecast-Residual-Based Chance-Constrained Scheduling of Local Energy Communities under PV and Demand Uncertainty
- Forecasting and Low-Carbon Demand Response Scheduling of Crane-Group Station-Service Loads for Grid-Friendly Hydropower Station Operation
- On a fair and risk-averse urban air mobility resource allocation problem under demand and capacity uncertainties
- Mobility-Gap Robustness and Středa-Hall Separation in Disordered Axion Pumping
BibTeX
@misc{chen2026noiseaware,
title = {{Noise-Aware Fleet Scheduling for On-Demand Urban Air Mobility with Alternative Flight Paths and Cruise Separation}},
author = {Haoye Chen and Jan Kronqvist and Wilco Burghout and Jianjun Wu and Zhenliang Ma},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.12068},
eprint = {2610.12068},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.12068},
}
RIS
TY - UNPB
TI - Noise-Aware Fleet Scheduling for On-Demand Urban Air Mobility with Alternative Flight Paths and Cruise Separation
AU - Haoye Chen
AU - Jan Kronqvist
AU - Wilco Burghout
AU - Jianjun Wu
AU - Zhenliang Ma
PY - 2026
DA - 2026/10/08
PB - arXiv
DO - 10.48550/arxiv.2610.12068
UR - https://arxiv.org/abs/2610.12068
AB - Multiple candidate flight paths between the same vertiports provide flexibility for managing noise exposure and cruise separation in on-demand urban air mobility (UAM). This paper introduces the fleet scheduling problem with alternative flight paths (FSP-AFP). We develop a time-expanded fleet-flow formulation for a finite aircraft fleet, in which each service or empty repositioning flight is assigned a planar path from a predefined set of alternatives connecting its origin and destination vertiports. These path choices are jointly optimized with cruise altitudes, departure times, and repositioning movements, while maintaining aircraft flow balance and enforcing geometric separation between flights cruising concurrently at the same altitude. The objective combines flight costs, service departure delays, and population-weighted noise exposure. A tailored branch-and-cut algorithm incorporates three complementary clique constructions based on a request-augmented conflict graph, exploiting physical flight conflicts, request exclusivity, and request-route relationships. Computational experiments show that, compared with a baseline implemented using Gurobi's native lazy-constraint functionality, the proposed algorithm generally obtains stronger lower bounds and finds feasible solutions for all test instances, while generating fewer cuts on average and achieving a 43.16-fold reduction in the mean number of processed search nodes. An operational case study shows that increasing the number of candidate planar routes per vertiport pair from one to four reduces the weighted objective by 6.71% and modeled noise exposure by 15.14% under the cruise-separation constraints. Further increases in the number of candidate routes yield only marginal improvement in the objective value. These findings show the value of coordinating alternative flight paths, scheduling, and fleet circulation in UAM.
ER -