Minimizing user inconvenience and operational costs in a dial-a-flight problem for flying safaris

IF 1.1 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Infor Pub Date : 2022-10-07 DOI:10.1080/03155986.2022.2129210

J. Cordeau, M. Iori, N. F. M. Mendes, Davide Nelli, Riccardo Tedeschi

{"title":"Minimizing user inconvenience and operational costs in a dial-a-flight problem for flying safaris","authors":"J. Cordeau, M. Iori, N. F. M. Mendes, Davide Nelli, Riccardo Tedeschi","doi":"10.1080/03155986.2022.2129210","DOIUrl":null,"url":null,"abstract":"Abstract We study a Dial-a-Flight Problem faced by one of the major safari airline companies in Tanzania. Given a set of daily passenger requests and a fleet of heterogeneous airplanes, the problem requires to determine the best set of itineraries to transport the passengers from their origins to the requested destinations within specific time windows, while satisfying a number of operational constraints. The aim is to minimize user inconvenience, measured by delays with respect to the pre-defined time windows and by the number of intermediate stops in the itineraries, and operational cost. The problem is complicated by the high number of daily requests in peak touristic periods, and by the fact that refueling is possible only at a limited number of airstrips. We solve the problem by means of an adaptive large neighborhood search, which we enrich with local search operators and a set partitioning model. Extensive computational tests on real-world instances prove the effectiveness of the proposed algorithm, which can improve the solutions found by the company both in terms of operational cost and user inconvenience, in reasonable computational time.","PeriodicalId":13645,"journal":{"name":"Infor","volume":"127 1","pages":"104 - 140"},"PeriodicalIF":1.1000,"publicationDate":"2022-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Infor","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1080/03155986.2022.2129210","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 3

Abstract

Abstract We study a Dial-a-Flight Problem faced by one of the major safari airline companies in Tanzania. Given a set of daily passenger requests and a fleet of heterogeneous airplanes, the problem requires to determine the best set of itineraries to transport the passengers from their origins to the requested destinations within specific time windows, while satisfying a number of operational constraints. The aim is to minimize user inconvenience, measured by delays with respect to the pre-defined time windows and by the number of intermediate stops in the itineraries, and operational cost. The problem is complicated by the high number of daily requests in peak touristic periods, and by the fact that refueling is possible only at a limited number of airstrips. We solve the problem by means of an adaptive large neighborhood search, which we enrich with local search operators and a set partitioning model. Extensive computational tests on real-world instances prove the effectiveness of the proposed algorithm, which can improve the solutions found by the company both in terms of operational cost and user inconvenience, in reasonable computational time.

查看原文本刊更多论文

最大限度地减少用户的不便和操作成本，在一个拨号飞行问题的飞行狩猎

摘要:本文研究了坦桑尼亚一家大型旅游航空公司所面临的一个航班拨号问题。给定一组每日乘客请求和一组不同类型的飞机，该问题需要确定一组最佳行程，以便在特定的时间窗口内将乘客从出发地运送到请求的目的地，同时满足许多操作约束。其目的是尽量减少用户的不便，以相对于预先定义的时间窗口的延误和行程中中间站点的数量以及运营成本来衡量。在旅游高峰期，每天都有大量的请求，而且只能在有限的几个飞机跑道加油，这使问题变得更加复杂。我们通过自适应大邻域搜索来解决这个问题，并在此基础上充实了局部搜索算子和集合划分模型。对实际实例的大量计算测试证明了所提出算法的有效性，在合理的计算时间内，该算法可以在操作成本和用户不便方面改进公司找到的解决方案。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Infor 管理科学-计算机：信息系统

CiteScore

2.60

自引率

7.70%

发文量

审稿时长

>12 weeks

期刊介绍： INFOR: Information Systems and Operational Research is published and sponsored by the Canadian Operational Research Society. It provides its readers with papers on a powerful combination of subjects: Information Systems and Operational Research. The importance of combining IS and OR in one journal is that both aim to expand quantitative scientific approaches to management. With this integration, the theory, methodology, and practice of OR and IS are thoroughly examined. INFOR is available in print and online.