Multiple-Allocation Hub-and-Spoke Network Design With Maximizing Airline Profit Utility in Air Transportation Network

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 R...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on intelligent transportation systems Ročník 25; číslo 7; s. 7294 - 7310
Hlavní autori: Yu, Nan, Dong, Bin, Qu, Yuben, Zhang, Mingwei, Chen, Guihai, Tan, Qingqing, Wang, Yanyan, Dai, Haipeng
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.07.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Air transportation
Airline industry
Airline profit
Airlines
Airports
Algorithms
Approximation
approximation algorithm
Approximation algorithms
Aviation
cardinality
Costs
customer preference
Flight
greedy algorithm
hub location problem
Industrial development
Maximization
Network design
Optimization
Resource management
Routing
routing allocation mode
submodular set function
Transportation
Transportation networks
transportation profit utility
ISSN:1524-9050, 1558-0016
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1524-9050
1558-0016
DOI:10.1109/TITS.2023.3348466