Airlines commonly need to take into consideration maximizing their profit while designing the hub-and-spoke network to obtain more market share and promote healthy development of aviation industry. Hence, in this article, we study the problem of multiple-allocation HUb and spoke network design for ROuting flight flows to maximize airline profit utility (HURO). That is, given a set of airport nodes, a set of flight flows with known origin positions and destination positions, finding a limited number of hub edges to transfer flows and determining routing allocation mode considering customer preference such that the overall transportation profit utility is maximized. To address HURO problem, we first consider a relaxed version of HURO (HURO-R for short). We prove that HURO-R falls into the realm of maximizing a submodular set function subject to a cardinality constraint, and propose an algorithm with a constant approximation ratio. Next, we design a two-level algorithm framework with a constant approximation ratio to address HURO. Besides, we consider variants of HURO, HURO-C and HURO-RU, and design approximation algorithms to address them. We conduct simulation experiments on standard dataset and field experiments to verify our theoretical findings. The results shows that our proposed algorithm can outperform other comparison algorithms by 75.28 percent.
Multiple-Allocation Hub-and-Spoke Network Design With Maximizing Airline Profit Utility in Air Transportation Network
IEEE Transactions on Intelligent Transportation Systems ; 25 , 7 ; 7294-7310
2024-07-01
12659203 byte
Article (Journal)
Electronic Resource
English
Robust Optimization of Nonstrict Hub and Spoke Airline Network Design
British Library Online Contents | 2007
|The Influence of Airline Network Passenger Flow, Fares on Airline Network Profit
Trans Tech Publications | 2014
|Profit Motivated Airline Fleet Allocation and Concurrent Aircraft Design for Multiple Airlines
British Library Conference Proceedings | 2013
|