An Efficient Continuous-Time MILP for Integrated Aircraft Hangar Scheduling and Layout

• URL: http://arxiv.org/abs/2508.02640v2
• Date: Sun, 07 Sep 2025 16:22:03 GMT
• Title: An Efficient Continuous-Time MILP for Integrated Aircraft Hangar Scheduling and Layout
• Authors: Shayan Farhang Pazhooh, Hossein Shams Shemirani,
• Abstract summary: We propose a continuous-time mixed-integer linear computation program that jointly optimize aircraft placement and timing.<n>A study benchmarks the model against a constructive order-of-magnitude speedup, probes large-scale performance, and quantifies its sensitivity to temporal congestion.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Efficient management of aircraft MRO hangars requires the integration of spatial layout with time-continuous scheduling to minimize operational costs. We propose a continuous-time mixed-integer linear program that jointly optimizes aircraft placement and timing, overcoming the scalability limits of prior formulations. A comprehensive study benchmarks the model against a constructive heuristic, probes large-scale performance, and quantifies its sensitivity to temporal congestion. The model achieves orders-of-magnitude speedups on benchmarks from the literature, solving a long-standing congested instance in 0.11 seconds, and finds proven optimal solutions for instances with up to 40 aircraft. Within a one-hour limit for large-scale problems, the model finds solutions with small optimality gaps for instances up to 80 aircraft and provides strong bounds for problems with up to 160 aircraft. Optimized plans consistently increase hangar throughput (e.g., +33% serviced aircraft vs. a heuristic on instance RND-N030-I03), leading to lower delay penalties and higher asset utilization. These findings establish that exact optimization has become computationally viable for large-scale hangar planning, providing a validated tool that balances solution quality and computation time for strategic and operational decisions.

Related papers

• Multi UAVs Preflight Planning in a Shared and Dynamic Airspace [4.802862639452379]
  We propose DTAPP-IICR: a Delivery-Time Aware Prioritized Planning method with Incremental and Iterative Conflict Resolution.<n>Our framework first generates an initial solution by prioritizing missions based on urgency.<n>It computes roundtrip trajectories using SFIPP-ST, a novel 4D single-agent planner.<n>On benchmarks with temporal NFZs, DTAPP-IICR achieves near-100% success with fleets of up to 1,000 UAVs.
  arXiv  Detail & Related papers  (2026-02-12T15:18:46Z)
• Scalable Transit Delay Prediction at City Scale: A Systematic Approach with Multi-Resolution Feature Engineering and Deep Learning [1.065661841579261]
  Most existing delay prediction systems handle only a few routes, depend on hand-crafted features, and offer little guidance on how to design a reusable architecture.<n>We present a city-scale prediction pipeline that combines multi-resolution feature engineering, dimensionality reduction, and deep learning.<n>A global LSTM with cluster-aware features achieves the best trade-off between accuracy and efficiency, outperforming transformer models by 18 52% to 52%.
  arXiv  Detail & Related papers  (2026-01-26T14:30:50Z)
• PILOT: Planning via Internalized Latent Optimization Trajectories for Large Language Models [51.43746425777865]
  Large Language Models (LLMs) often lack the capacity to formulate global strategies, leading to error propagation in long-horizon tasks.<n>We propose PILOT, a framework designed to internalize the strategic oversight of large models into intrinsic Latent Guidance.
  arXiv  Detail & Related papers  (2026-01-07T12:38:56Z)
• Hybrid Reinforcement Learning and Search for Flight Trajectory Planning [6.651730814910398]
  This paper explores the combination of Reinforcement Learning (RL) and search-based path planners to speed up the optimization of flight paths for airliners.<n>The fundamental idea is to train an RL Agent to pre-compute near-optimal paths based on location and atmospheric data and use those at runtime to constrain the underlying path planning solver.<n>The approach effectively reduces the size of the solver's search space, significantly speeding up route optimization.
  arXiv  Detail & Related papers  (2025-09-04T11:01:43Z)
• CSGO: Generalized Optimization for Cold Start in Wireless Collaborative Edge LLM Systems [62.24576366776727]
  We propose a latency-aware scheduling framework to minimize total inference latency.<n>We show that the proposed method significantly reduces cold-start latency compared to baseline strategies.
  arXiv  Detail & Related papers  (2025-08-15T07:49:22Z)
• Generalized Linear Bandits: Almost Optimal Regret with One-Pass Update [60.414548453838506]
  We study the generalized linear bandit (GLB) problem, a contextual multi-armed bandit framework that extends the classical linear model by incorporating a non-linear link function.<n>GLBs are widely applicable to real-world scenarios, but their non-linear nature introduces significant challenges in achieving both computational and statistical efficiency.<n>We propose a jointly efficient algorithm that attains a nearly optimal regret bound with $mathcalO(1)$ time and space complexities per round.
  arXiv  Detail & Related papers  (2025-07-16T02:24:21Z)
• Adaptive Deadline and Batch Layered Synchronized Federated Learning [66.93447103966439]
  Federated learning (FL) enables collaborative model training across distributed edge devices while preserving data privacy, and typically operates in a round-based synchronous manner.<n>We propose ADEL-FL, a novel framework that jointly optimize per-round deadlines and user-specific batch sizes for layer-wise aggregation.
  arXiv  Detail & Related papers  (2025-05-29T19:59:18Z)
• Opportunistic Collaborative Planning with Large Vision Model Guided Control and Joint Query-Service Optimization [74.92515821144484]
  Navigating autonomous vehicles in open scenarios is a challenge due to the difficulties in handling unseen objects.<n>Existing solutions either rely on small models that struggle with generalization or large models that are resource-intensive.<n>This paper proposes opportunistic collaborative planning (OCP), which seamlessly integrates efficient local models with powerful cloud models.
  arXiv  Detail & Related papers  (2025-04-25T04:07:21Z)
• DiffPO: Diffusion-styled Preference Optimization for Efficient Inference-Time Alignment of Large Language Models [50.32663816994459]
  Diffusion-styled Preference Optimization (model) provides an efficient and policy-agnostic solution for aligning LLMs with humans.<n>modelavoids the time latency associated with token-level generation.<n>Experiments on AlpacaEval 2, MT-bench, and HH-RLHF demonstrate that modelachieves superior alignment performance across various settings.
  arXiv  Detail & Related papers  (2025-03-06T09:21:54Z)
• A Graph-Enhanced Deep-Reinforcement Learning Framework for the Aircraft Landing Problem [0.0]
  The Aircraft Landing Problem (ALP) is one of the challenging problems in aircraft transportation and management.<n>This paper presents a novel deep reinforcement learning framework that combines graph neural networks with actor-critic architectures to address the ALP.<n>Results show that the trained algorithm can be tested on different problem sets and the results are competitive to operation research algorithms.
  arXiv  Detail & Related papers  (2025-02-18T08:02:17Z)
• 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)
• Temporal Feature Matters: A Framework for Diffusion Model Quantization [105.3033493564844]
  Diffusion models rely on the time-step for the multi-round denoising.<n>We introduce a novel quantization framework that includes three strategies.<n>This framework preserves most of the temporal information and ensures high-quality end-to-end generation.
  arXiv  Detail & Related papers  (2024-07-28T17:46:15Z)
• A Graph-based Adversarial Imitation Learning Framework for Reliable & Realtime Fleet Scheduling in Urban Air Mobility [5.19664437943693]
  This paper presents a comprehensive optimization formulation of the fleet scheduling problem. It also identifies the need for alternate solution approaches. The new imitative approach achieves better mean performance and remarkable improvement in the case of unseen worst-case scenarios.
  arXiv  Detail & Related papers  (2024-07-16T18:51:24Z)
• OTClean: Data Cleaning for Conditional Independence Violations using Optimal Transport [51.6416022358349]
  sys is a framework that harnesses optimal transport theory for data repair under Conditional Independence (CI) constraints. We develop an iterative algorithm inspired by Sinkhorn's matrix scaling algorithm, which efficiently addresses high-dimensional and large-scale data.
  arXiv  Detail & Related papers  (2024-03-04T18:23:55Z)
• Graph Learning-based Fleet Scheduling for Urban Air Mobility under Operational Constraints, Varying Demand & Uncertainties [5.248564173595024]
  This paper develops a graph reinforcement learning approach to online planning of the schedule and destinations of electric aircraft. It considers time-varying demand, constraints related to vertiport capacity, aircraft capacity and airspace safety guidelines, uncertainties related to take-off delay, weather-induced route closures, and unanticipated aircraft downtime.
  arXiv  Detail & Related papers  (2024-01-09T23:46:22Z)
• A Hierarchical Temporal Planning-Based Approach for Dynamic Hoist Scheduling Problems [11.66506213335498]
  Hoist scheduling has become a bottleneck in electroplating industry applications with the development of autonomous devices. We formulate the hoist scheduling problem as a new temporal planning problem in the form of adapted PDDL. We provide a collection of real-life benchmark instances that can be used to evaluate solution methods for the problem.
  arXiv  Detail & Related papers  (2022-12-11T05:30:44Z)
• Time-Optimal Planning for Quadrotor Waypoint Flight [50.016821506107455]
  Planning time-optimal trajectories at the actuation limit of a quadrotor is an open problem. We propose a solution while exploiting the full quadrotor's actuator potential. We validate our method in real-world flights in one of the world's largest motion-capture systems.
  arXiv  Detail & Related papers  (2021-08-10T09:26:43Z)
• Efficient Temporal Piecewise-Linear Numeric Planning with Lazy Consistency Checking [4.834203844100679]
  We propose a set of techniques that allow the planner to compute LP consistency checks lazily where possible. We also propose an algorithm to perform duration-dependent goal checking more selectively. The resultant planner is not only more efficient, but outperforms most state-of-the-art temporal-numeric and hybrid planners.
  arXiv  Detail & Related papers  (2021-05-21T07:36:54Z)
• Edge Federated Learning Via Unit-Modulus Over-The-Air Computation (Extended Version) [64.76619508293966]
  This paper proposes a unit-modulus over-the-air computation (UM-AirComp) framework to facilitate efficient edge federated learning. It uploads simultaneously local model parameters and updates global model parameters via analog beamforming. We demonstrate the implementation of UM-AirComp in a vehicle-to-everything autonomous driving simulation platform.
  arXiv  Detail & Related papers  (2021-01-28T15:10:22Z)
• Combining Deep Learning and Optimization for Security-Constrained Optimal Power Flow [94.24763814458686]
  Security-constrained optimal power flow (SCOPF) is fundamental in power systems. Modeling of APR within the SCOPF problem results in complex large-scale mixed-integer programs. This paper proposes a novel approach that combines deep learning and robust optimization techniques.
  arXiv  Detail & Related papers  (2020-07-14T12:38:21Z)

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.