航空公司机组调度问题的多目标数学公式:MODE和NSGA-II求解方法

V. Baradaran, A. Hosseinian
{"title":"航空公司机组调度问题的多目标数学公式:MODE和NSGA-II求解方法","authors":"V. Baradaran, A. Hosseinian","doi":"10.52547/jimp.11.1.247","DOIUrl":null,"url":null,"abstract":"In this research, a multi-objective mathematical model is proposed for the airline multi-skilled crew scheduling problem. The multi-skilled crew can be assigned to flights and airplanes according to their skills. The objective functions of the proposed model are: (1) Maximizing the number of leave days planned according to the days announced by the flight crew, and (2) Minimizing the penalty costs associated with violation of minimum and maximum working hours. Several test problems have been designed based on the data acquired by the airline studied in this research. Due to the NP-hard essence of the model, we have employed two meta-heuristics, namely the multi-objective differential evolution (MODE) and Non-dominated Sorting Genetic Algorithm II (NSGA-II). These algorithms are calibrated using the Taguchi method. The algorithms have been compared based on several multi-objective performance measures. Each algorithm has been more successful in terms of some metrics. The comparisons between algorithms and sensitivity analysis show that the proposed model and algorithms can produce appropriate schedules for the airline crew scheduling problem.","PeriodicalId":303885,"journal":{"name":"Journal of Industrial Management Perspective","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A Multi-Objective Mathematical Formulation for the Airline Crew Scheduling Problem: MODE and NSGA-II Solution Approaches\",\"authors\":\"V. Baradaran, A. Hosseinian\",\"doi\":\"10.52547/jimp.11.1.247\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this research, a multi-objective mathematical model is proposed for the airline multi-skilled crew scheduling problem. The multi-skilled crew can be assigned to flights and airplanes according to their skills. The objective functions of the proposed model are: (1) Maximizing the number of leave days planned according to the days announced by the flight crew, and (2) Minimizing the penalty costs associated with violation of minimum and maximum working hours. Several test problems have been designed based on the data acquired by the airline studied in this research. Due to the NP-hard essence of the model, we have employed two meta-heuristics, namely the multi-objective differential evolution (MODE) and Non-dominated Sorting Genetic Algorithm II (NSGA-II). These algorithms are calibrated using the Taguchi method. The algorithms have been compared based on several multi-objective performance measures. Each algorithm has been more successful in terms of some metrics. The comparisons between algorithms and sensitivity analysis show that the proposed model and algorithms can produce appropriate schedules for the airline crew scheduling problem.\",\"PeriodicalId\":303885,\"journal\":{\"name\":\"Journal of Industrial Management Perspective\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-03-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Industrial Management Perspective\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.52547/jimp.11.1.247\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Industrial Management Perspective","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.52547/jimp.11.1.247","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

本文针对航空公司多技能机组调度问题,提出了一个多目标数学模型。多技能机组人员可以根据他们的技能分配到航班和飞机上。该模型的目标函数是:(1)根据机组人员公布的天数,使计划休假天数最大化;(2)使违反最低和最高工作时间的处罚成本最小化。根据本研究中所研究的航空公司所获得的数据,设计了几个测试问题。由于模型的NP-hard本质,我们采用了两种元启发式方法,即多目标差分进化(MODE)和非支配排序遗传算法II (NSGA-II)。这些算法使用田口方法进行校准。基于多个多目标性能指标对算法进行了比较。就某些指标而言,每种算法都更成功。通过对算法和灵敏度分析的比较,表明所提出的模型和算法能够为航空公司机组调度问题生成合适的调度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Multi-Objective Mathematical Formulation for the Airline Crew Scheduling Problem: MODE and NSGA-II Solution Approaches
In this research, a multi-objective mathematical model is proposed for the airline multi-skilled crew scheduling problem. The multi-skilled crew can be assigned to flights and airplanes according to their skills. The objective functions of the proposed model are: (1) Maximizing the number of leave days planned according to the days announced by the flight crew, and (2) Minimizing the penalty costs associated with violation of minimum and maximum working hours. Several test problems have been designed based on the data acquired by the airline studied in this research. Due to the NP-hard essence of the model, we have employed two meta-heuristics, namely the multi-objective differential evolution (MODE) and Non-dominated Sorting Genetic Algorithm II (NSGA-II). These algorithms are calibrated using the Taguchi method. The algorithms have been compared based on several multi-objective performance measures. Each algorithm has been more successful in terms of some metrics. The comparisons between algorithms and sensitivity analysis show that the proposed model and algorithms can produce appropriate schedules for the airline crew scheduling problem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信