ASPaeroFlow: Decomposition Heuristics for Joint Air Traffic Flow & Capacity Management
- URL: http://arxiv.org/abs/2608.09315v1
- Date: Mon, 10 Aug 2026 08:57:18 GMT
- Title: ASPaeroFlow: Decomposition Heuristics for Joint Air Traffic Flow & Capacity Management
- Abstract summary: We propose ASPaeroFlow: a for the joint Air Traffic Flow and Capacity Management (ATFCM)<n>It combines instance-space decompositions with a local exact approach using Answer Set Programming.<n>We benchmark ASPaeroFlow from small to industry-sized instances and compare it with exact and alternative approaches.
- Score: 60.85136195443409
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: While mathematical models act as vital decision support systems for operational Air Traffic Flow and Capacity Management (ATFCM), existing approaches isolate Air Traffic Flow Management (ATFM) from Dynamic Airspace Configuration (DAC). This separation introduces an unresolved circular dependency between fixed-demand and fixed-capacity assumptions. Although joint optimization resolves this gap, the enlarged search space renders exact models computationally intractable for medium- to large-scale instances. To bridge this gap, we propose ASPaeroFlow: a heuristic for the joint ATFCM; it combines instance-space decomposition heuristics with a local exact approach using Answer Set Programming. We benchmark ASPaeroFlow from small to industry-sized instances and compare it with exact and alternative approaches. The results indicate that (1) the heuristic provides a computational middle ground between exact methods and operational baselines; (2) simultaneous optimization can outperform sequential optimization on joint ATFCM; and (3) an ablation study indicates that DAC has a larger impact on solution quality than flow measures.
Related papers
- Adaptive Cluster-First Route-Second Decomposition for Industrial-Scale Vehicle Routing [2.3204178451683264]
We propose an adaptive CFRS system that formulates a decomposition procedure as an iterative decision-making process.<n>Motivated by the recent success of large language models (LLMs) in reasoning and tool selection, the system employs an LLM as a high-level decision maker.<n>We evaluate the approach on synthetic and benchmark-derived CVRP instances containing up to 500,000 customers.
arXiv Detail & Related papers (2026-06-30T15:31:40Z) - Joint Air Traffic Flow and Capacity Management via Answer Set Programming [64.47906587579985]
We introduce a joint ATFCM model with an encoding in Answer Set Programming (ASP)<n>Our results indicate that the ASP model outperforms the MIP model.<n>While DAC has the largest improvement on solving performance compared to rerouting, unrestricted variants of DAC or rerouting lead to search space thrashing.
arXiv Detail & Related papers (2026-06-22T07:58:54Z) - Adapformer: Adaptive Channel Management for Multivariate Time Series Forecasting [49.40321003932633]
Adapformer is an advanced Transformer-based framework that merges the benefits of CI and CD methodologies through effective channel management.<n>Adapformer achieves superior performance over existing models, enhancing both predictive accuracy and computational efficiency.
arXiv Detail & Related papers (2025-11-18T16:24:05Z) - Joint Channel Estimation and Computation Offloading in Fluid Antenna-assisted MEC Networks [81.36647816787713]
We propose an FA-assisted offloading framework to minimize the delay of channel estimation.<n>We show that the proposed system significantly reduces the accuracy under efficient communication.
arXiv Detail & Related papers (2025-09-16T08:48:44Z) - A Hybrid Tabu Scatter Search Algorithm for Simulation-Based Optimization of Multi-Objective Runway Operations Scheduling [0.0]
dissertation addresses the challenge of air traffic flow management by proposing a simulation-based optimization (SbO) approach for runway operations scheduling.<n>The goal is to optimize airport capacity utilization while minimizing delays, fuel consumption, and environmental impacts.<n>The proposed SbO framework integrates a discrete-event simulation model to handle runway conditions and a hybrid Tabu-Scatter Search algorithm to identify optimal solutions.
arXiv Detail & Related papers (2025-02-08T14:42:05Z) - Over-the-Air Fair Federated Learning via Multi-Objective Optimization [52.295563400314094]
We propose an over-the-air fair federated learning algorithm (OTA-FFL) to train fair FL models.<n>Experiments demonstrate the superiority of OTA-FFL in achieving fairness and robust performance.
arXiv Detail & Related papers (2025-01-06T21:16:51Z) - A Bayesian Framework of Deep Reinforcement Learning for Joint O-RAN/MEC
Orchestration [12.914011030970814]
Multi-access Edge Computing (MEC) can be implemented together with Open Radio Access Network (O-RAN) over commodity platforms to offer low-cost deployment.
In this paper, a joint O-RAN/MEC orchestration using a Bayesian deep reinforcement learning (RL)-based framework is proposed.
arXiv Detail & Related papers (2023-12-26T18:04:49Z) - Exploiting Temporal Structures of Cyclostationary Signals for
Data-Driven Single-Channel Source Separation [98.95383921866096]
We study the problem of single-channel source separation (SCSS)
We focus on cyclostationary signals, which are particularly suitable in a variety of application domains.
We propose a deep learning approach using a U-Net architecture, which is competitive with the minimum MSE estimator.
arXiv Detail & Related papers (2022-08-22T14:04:56Z) - 1-Bit Compressive Sensing for Efficient Federated Learning Over the Air [32.14738452396869]
This paper develops and analyzes a communication-efficient scheme for learning (FL) over the air, which incorporates 1-bit sensing (CS) into analog aggregation transmissions.
For scalable computing, we develop an efficient implementation that is suitable for large-scale networks.
Simulation results show that our proposed 1-bit CS based FL over the air achieves comparable performance to the ideal case.
arXiv Detail & Related papers (2021-03-30T03:50:31Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.