Airline Competitive Hub-and-Spoke Network Design by Reweighted Norm-1

Air transportation networks are critical components of modern transport systems, enabling rapid connectivity across vast regions. This study presents a novel convex optimization methodology for designing and optimizing air transportation networks. Unlike traditional mixed-integer nonlinear programming approaches, which struggle with scalability and complexity, our method leverages sparsity-promoting regularizers and entropy-based regularizers to optimize the selection of routes and hub capacities while accounting for infrastructure costs and user behavior using a logit model. The proposed method achieves near-optimal solutions with significantly reduced computation times, making it practical for large-scale networks. Application to a real-world U.S. domestic air network demonstrates its effectiveness, providing high-quality solutions, and enabling robust decision-making. These results highlight the potential of convex optimization in advancing air network design, paving the way for future extensions, including probabilistic models and multilevel optimization.

Authors

Institutions

Publication Details

Published
2025-07-16
DOI
https://doi.org/10.2514/6.2025-3813
Primary Topic
Vehicle Routing Optimization Methods
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Airline Competitive Hub-and-Spoke Network Design by Reweighted Norm-1

Luís Cadarso, Antonio G. Marqués, Víctor M. Tenorio, Fernando Real-Rojas
Vehicle Routing Optimization Methods
article

Airline Competitive Hub-and-Spoke Network Design by Reweighted Norm-1

Luís Cadarso, Antonio G. Marqués, Víctor M. Tenorio, Fernando Real-Rojas
article en

Abstract

Air transportation networks are critical components of modern transport systems, enabling rapid connectivity across vast regions. This study presents a novel convex optimization methodology for designing and optimizing air transportation networks. Unlike traditional mixed-integer nonlinear programming approaches, which struggle with scalability and complexity, our method leverages sparsity-promoting regularizers and entropy-based regularizers to optimize the selection of routes and hub capacities while accounting for infrastructure costs and user behavior using a logit model. The proposed method achieves near-optimal solutions with significantly reduced computation times, making it practical for large-scale networks. Application to a real-world U.S. domestic air network demonstrates its effectiveness, providing high-quality solutions, and enabling robust decision-making. These results highlight the potential of convex optimization in advancing air network design, paving the way for future extensions, including probabilistic models and multilevel optimization.

Universidad Rey Juan Carlos (ES)
Openalex Percentile: Top 75%
Vehicle Routing Optimization Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.