An Interval Integrated Optimization to Air-Cargo Hub Network Design and Airline Fleet Planning

IF 2 4区 工程技术 Q2 ENGINEERING, CIVIL
Yu Wang, Tao Zhu, Kaibo Yuan, Peiwen Zhang, Zhe Liang, Jinfu Zhu
{"title":"An Interval Integrated Optimization to Air-Cargo Hub Network Design and Airline Fleet Planning","authors":"Yu Wang,&nbsp;Tao Zhu,&nbsp;Kaibo Yuan,&nbsp;Peiwen Zhang,&nbsp;Zhe Liang,&nbsp;Jinfu Zhu","doi":"10.1155/2024/5754231","DOIUrl":null,"url":null,"abstract":"<div>\n <p>The objective of this study is to minimize the overall transportation cost through the joint decision-making for air-cargo hub network design and fleet planning under the uncertain environment. This joint decision-making considers various factors, including hub location, node connectivity, fleet size, and flight frequency. It takes into account several uncertain parameters such as air-cargo demand and transportation cost in a realistic setting. We propose a mixed-integer programming model tailored to the characteristics of such problem, which utilizes interval numbers to address these challenges. This model aims to provide a robust scheme for the joint hub network design and the fleet planning in the uncertain environment. An improved probability-based interval ranking method is proposed to solve the model. This transformation converts the proposed model into an equivalent real-number one, simplifying the solving process. Then a hybrid heuristic algorithm, combining the advantages of Memory-Based Genetic Algorithm (MBGA) and Greedy Heuristic Procedure (GHP), is introduced to enhance the solving speed. Finally, the performance of our proposed model and algorithm is verified using real-world data from the Australian postal dataset. The results show that the proposed model reduces hub construction costs by 1.37% and fleet operational costs by 7.60%, respectively, as opposed to the use of traditional approaches. The computational time of the proposed algorithm is reduced by 28.4% and 36.5%, respectively, when compared to the use of Genetic Algorithm (GA) and Variable Neighborhood Search (VNS) algorithm.</p>\n </div>","PeriodicalId":50259,"journal":{"name":"Journal of Advanced Transportation","volume":"2024 1","pages":""},"PeriodicalIF":2.0000,"publicationDate":"2024-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2024/5754231","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Advanced Transportation","FirstCategoryId":"5","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1155/2024/5754231","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, CIVIL","Score":null,"Total":0}
引用次数: 0

Abstract

The objective of this study is to minimize the overall transportation cost through the joint decision-making for air-cargo hub network design and fleet planning under the uncertain environment. This joint decision-making considers various factors, including hub location, node connectivity, fleet size, and flight frequency. It takes into account several uncertain parameters such as air-cargo demand and transportation cost in a realistic setting. We propose a mixed-integer programming model tailored to the characteristics of such problem, which utilizes interval numbers to address these challenges. This model aims to provide a robust scheme for the joint hub network design and the fleet planning in the uncertain environment. An improved probability-based interval ranking method is proposed to solve the model. This transformation converts the proposed model into an equivalent real-number one, simplifying the solving process. Then a hybrid heuristic algorithm, combining the advantages of Memory-Based Genetic Algorithm (MBGA) and Greedy Heuristic Procedure (GHP), is introduced to enhance the solving speed. Finally, the performance of our proposed model and algorithm is verified using real-world data from the Australian postal dataset. The results show that the proposed model reduces hub construction costs by 1.37% and fleet operational costs by 7.60%, respectively, as opposed to the use of traditional approaches. The computational time of the proposed algorithm is reduced by 28.4% and 36.5%, respectively, when compared to the use of Genetic Algorithm (GA) and Variable Neighborhood Search (VNS) algorithm.

Abstract Image

用于航空货运枢纽网络设计和航空公司机队规划的区间综合优化方法
本研究的目标是在不确定环境下,通过航空货运枢纽网络设计和机队规划的联合决策,最大限度地降低总体运输成本。这种联合决策考虑了多种因素,包括枢纽位置、节点连接、机队规模和航班频率。它在现实环境中考虑到了航空货运需求和运输成本等多个不确定参数。我们针对此类问题的特点提出了一种混合整数编程模型,利用区间数来应对这些挑战。该模型旨在为不确定环境下的联合枢纽网络设计和机队规划提供稳健的方案。为求解该模型,提出了一种改进的基于概率的区间排序方法。这种转换将提出的模型转换为等效实数模型,从而简化了求解过程。然后,结合基于内存的遗传算法(MBGA)和贪婪启发式程序(GHP)的优点,引入了一种混合启发式算法,以提高求解速度。最后,利用澳大利亚邮政数据集的实际数据验证了我们提出的模型和算法的性能。结果表明,与使用传统方法相比,所提出的模型分别降低了 1.37% 的枢纽建设成本和 7.60% 的车队运营成本。与使用遗传算法(GA)和可变邻域搜索(VNS)算法相比,拟议算法的计算时间分别减少了 28.4% 和 36.5%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Advanced Transportation
Journal of Advanced Transportation 工程技术-工程:土木
CiteScore
5.00
自引率
8.70%
发文量
466
审稿时长
7.3 months
期刊介绍: The Journal of Advanced Transportation (JAT) is a fully peer reviewed international journal in transportation research areas related to public transit, road traffic, transport networks and air transport. It publishes theoretical and innovative papers on analysis, design, operations, optimization and planning of multi-modal transport networks, transit & traffic systems, transport technology and traffic safety. Urban rail and bus systems, Pedestrian studies, traffic flow theory and control, Intelligent Transport Systems (ITS) and automated and/or connected vehicles are some topics of interest. Highway engineering, railway engineering and logistics do not fall within the aims and scope of JAT.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信