{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T19:32:58Z","timestamp":1775849578699,"version":"3.50.1"},"reference-count":61,"publisher":"Emerald","issue":"12","license":[{"start":{"date-parts":[[2021,9,6]],"date-time":"2021-09-06T00:00:00Z","timestamp":1630886400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["K"],"published-print":{"date-parts":[[2022,11,30]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title><jats:p>One of the main advantages of the proposed model is that it is flexible to generate <jats:italic>n<\/jats:italic>-day pairings simultaneously. It means that, despite previous researches, one-day to <jats:italic>n<\/jats:italic>-day pairings can be generated in a single model. The flexibility in generating parings causes that the proposed model leads to better solutions compared to existing models. Another advantage of the model is minimizing the risk of COVID-19 by limitation of daily flights as well as elapsed time minimization. As airports are among high risk places in COVID-19 pandemic, minimization of infection risk is considered in this model for the first time. Genetic algorithm is used as the solution approach, and its efficiency is compared to GAMS in small and medium-size problems.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title><jats:p>One of the most complex issues in airlines is crew scheduling problem which is divided into two subproblems: crew pairing problem (CPP) and crew rostering problem (CRP). Generating crew pairings is a tremendous and exhausting task as millions of pairings may be generated for an airline. Moreover, crew cost has the largest share in total cost of airlines after fuel cost. As a result, crew scheduling with the aim of cost minimization is one of the most important issues in airlines. In this paper, a new bi-objective mixed integer programming model is proposed to generate pairings in such a way that deadhead cost, crew cost and the risk of COVID-19 are minimized.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Findings<\/jats:title><jats:p>The proposed model is applied for domestic flights of Iran Air airline. The results of the study indicate that genetic algorithm solutions have only 0.414 and 0.380 gap on average to optimum values of the first and the second objective functions, respectively. Due to the flexibility of the proposed model, it improves solutions resulted from existing models with fixed-duty pairings. Crew cost is decreased by 12.82, 24.72, 4.05 and 14.86% compared to one-duty to four-duty models. In detail, crew salary is improved by 12.85, 24.64, 4.07 and 14.91% and deadhead cost is decreased by 11.87, 26.98, 3.27, and 13.35% compared to one-duty to four-duty models, respectively.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title><jats:p>The authors confirm that it is an original paper, has not been published elsewhere and is not currently under consideration of any other journal.<\/jats:p><\/jats:sec>","DOI":"10.1108\/k-02-2021-0127","type":"journal-article","created":{"date-parts":[[2021,9,6]],"date-time":"2021-09-06T14:33:29Z","timestamp":1630938809000},"page":"3545-3573","source":"Crossref","is-referenced-by-count":9,"title":["A flexible mathematical model for crew pairing optimization to generate <i>n<\/i>-day pairings considering the risk of COVID-19: a real case study"],"prefix":"10.1108","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0614-6890","authenticated-orcid":false,"given":"Bahareh","family":"Shafipour-Omrani","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7705-980X","authenticated-orcid":false,"given":"Alireza","family":"Rashidi Komijan","sequence":"additional","affiliation":[]},{"given":"Seyed Jafar","family":"Sadjadi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2338-1673","authenticated-orcid":false,"given":"Kaveh","family":"Khalili-Damghani","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8188-5426","authenticated-orcid":false,"given":"Vahidreza","family":"Ghezavati","sequence":"additional","affiliation":[]}],"member":"140","published-online":{"date-parts":[[2021,9,6]]},"reference":[{"key":"key2022112904501091900_ref001","first-page":"593","article-title":"On large-scale airline crew pairing generation","year":"2018"},{"key":"key2022112904501091900_ref002","article-title":"On learning combinatorial patterns to assist large-scale airline crew pairing optimization","year":"2020"},{"key":"key2022112904501091900_ref003","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.endm.2017.03.012","article-title":"A variable neighborhood search approach for the crew pairing problem","volume":"58","year":"2017","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"4","key":"key2022112904501091900_ref004","doi-asserted-by":"crossref","first-page":"1284","DOI":"10.1016\/j.cor.2008.02.001","article-title":"An integer programming approach to generating airline crew pairings","volume":"36","year":"2009","journal-title":"Computers and Operations Research"},{"key":"key2022112904501091900_ref005","first-page":"1501","article-title":"A robust pairing model for airline crew scheduling","volume":"53","year":"2019","journal-title":"Transportation Science"},{"issue":"3","key":"key2022112904501091900_ref006","first-page":"227","article-title":"A multi-objective robust optimization model for a facility location-allocation problem in a supply chain under uncertainty","volume":"26","year":"2015","journal-title":"Inzinerine Ekonomika-Engineering Economics"},{"issue":"2","key":"key2022112904501091900_ref007","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1007\/s10479-016-2260-y","article-title":"A multi-start randomized heuristic for real-life crew rostering problems in airlines with work-balancing goals","volume":"258","year":"2017","journal-title":"Annals of Operations Research"},{"key":"key2022112904501091900_ref008","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.cie.2011.12.005","article-title":"Crew pairing optimization based on hybrid approaches","volume":"65","year":"2013","journal-title":"Computers and Industrial Engineering"},{"key":"key2022112904501091900_ref009","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.cie.2016.12.019","article-title":"A genetic algorithm Taguchi based approach to inventory routing problem of a single perishable product with transhipment","volume":"104","year":"2017","journal-title":"Computers and Industrial Engineering"},{"key":"key2022112904501091900_ref010","volume-title":"Airline Schedule Planning","year":"2003"},{"issue":"4","key":"key2022112904501091900_ref011","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1080\/01605682.2019.1567649","article-title":"Scheduling airline reserve crew using a probabilistic crew absence and recovery model","volume":"71","year":"2020","journal-title":"Operational Research Society"},{"key":"key2022112904501091900_ref012","volume-title":"Airline Operations and Scheduling","year":"2010","edition":"2nd ed."},{"key":"key2022112904501091900_ref013","volume-title":"The Global Airline Industry","year":"2009","edition":"2nd ed."},{"key":"key2022112904501091900_ref014","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.jairtraman.2018.07.007","article-title":"Robust integrated maintenance aircraft routing and crew pairing","volume":"73","year":"2018","journal-title":"Air Transport Management"},{"key":"key2022112904501091900_ref015","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/j.endm.2013.05.117","article-title":"A heuristic approach for an integrated fleet-assignment, aircraft-routing and crew-pairing problem","volume":"41","year":"2013","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"key2022112904501091900_ref016","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2019.01.006","article-title":"Heuristic approaches for flight retiming in an integrated airline scheduling problem of a regional carrier","volume":"91","year":"2020","journal-title":"Omega"},{"key":"key2022112904501091900_ref017","year":"2020"},{"key":"key2022112904501091900_ref018","doi-asserted-by":"crossref","first-page":"35018","DOI":"10.1109\/ACCESS.2020.2974245","article-title":"Multiobjective evolutionary scheduling and rescheduling of integrated aircraft routing and crew pairing problems","volume":"8","year":"2020","journal-title":"IEEE Access"},{"key":"key2022112904501091900_ref019","article-title":"A Hybrid ant algorithm for the airline crew pairing problem","volume-title":"MICAI 2006: Advances in Artificial Intelligence. MICAI 2006. Lecture Notes in Computer Science","year":"2006"},{"issue":"1","key":"key2022112904501091900_ref020","doi-asserted-by":"crossref","first-page":"1082","DOI":"10.2991\/ijcis.2017.10.1.72","article-title":"Novel search space updating heuristics based genetic algorithm for optimizing medium-scale airline crew pairing problems","volume":"10","year":"2017","journal-title":"International Journal of Computational Intelligence Systems"},{"issue":"2018","key":"key2022112904501091900_ref021","first-page":"54","article-title":"A survey of the literature on airline crew scheduling","volume":"74","year":"2018","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"key2022112904501091900_ref022","article-title":"An enhanced MSIQDE algorithm with novel multiple strategies for global optimization problems","year":"2020","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"key":"key2022112904501091900_ref023","article-title":"A novel gate resource allocation method using improved PSO-based QEA","year":"2020","journal-title":"IEEE Transactions on Intelligent Transportation Systems"},{"key":"key2022112904501091900_ref024","first-page":"1","article-title":"Dynamic Constraint Aggregation for solving very large-scale airline crew pairing problems","volume-title":"SN Operations Research Forum","year":"2020"},{"key":"key2022112904501091900_ref025","article-title":"A hybrid genetic algorithm for airline crew pairing optimization","volume":"118","year":"2016","journal-title":"Economic and Social Development: Book of Proceeding"},{"key":"key2022112904501091900_ref026","first-page":"389","article-title":"Evolutionary algorithms for solving the airline crew pairing problem","year":"2018","journal-title":"Computers and Industrial Engineering"},{"issue":"1","key":"key2022112904501091900_ref027","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s12469-011-0038-9","article-title":"Implementing a branch and price and cut method for the airline crew pairing optimization problem","volume":"3","year":"2011","journal-title":"Public Transport"},{"issue":"10","key":"key2022112904501091900_ref028","doi-asserted-by":"crossref","first-page":"1742","DOI":"10.1057\/jors.2015.2","article-title":"Solving a large-scale crew pairing problem","volume":"66","year":"2015","journal-title":"Operational Research Society"},{"key":"key2022112904501091900_ref029","unstructured":"Financial tribune daily and contributors (2020), \u201cTravel\u201d, available at: https:\/\/financialtribune.com\/articles\/travel\/103356\/32 -growth-in-iranair-passenger-transport-in-february."},{"key":"key2022112904501091900_ref030","first-page":"623","article-title":"A new compact formulation for the daily crew pairing problem","volume":"53","year":"2019","journal-title":"Transportation Science"},{"key":"key2022112904501091900_ref031","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s10852-015-9274-3","article-title":"A new bi-objective location-routing problem for distribution of perishable products: evolutionary computation approach","volume":"14","year":"2015","journal-title":"Journal of Mathematical Modelling and Algorithms in Operations Research"},{"issue":"1","key":"key2022112904501091900_ref032","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10898-014-0222-y","article-title":"The robust crew pairing problem: model and solution methodology","volume":"62","year":"2015","journal-title":"Journal of Global Optimization"},{"key":"key2022112904501091900_ref060","first-page":"2627","article-title":"Convolutional kernel networks","volume":"27","year":"2014","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"1","key":"key2022112904501091900_ref033","doi-asserted-by":"crossref","first-page":"25","DOI":"10.4995\/wpom.v11i1.12891","article-title":"An integrated model for aircraft routing and crew scheduling: Lagrangian Relaxation and metaheuristic algorithm","volume":"11","year":"2020","journal-title":"WPOM-Working Papers on Operations Management"},{"key":"key2022112904501091900_ref034","article-title":"A heuristic method for solving airline crew pairing problems","year":"2018"},{"key":"key2022112904501091900_ref035","article-title":"A novel data-driven design paradigm for airline disruption management","year":"2021"},{"key":"key2022112904501091900_ref036","article-title":"Biased randomised iterated greedy search with local search for airline crew scheduling","year":"2018"},{"key":"key2022112904501091900_ref061","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0020-0255(01)00083-4","article-title":"Flight graph based genetic algorithm for crew scheduling in airlines","volume":"133","year":"2001","journal-title":"Information Sciences"},{"key":"key2022112904501091900_ref037","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2019.05.009","article-title":"Aircraft routing and crew pairing: updated algorithms at Air France","volume":"93","year":"2020","journal-title":"Omega"},{"key":"key2022112904501091900_ref038","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.cor.2016.11.020","article-title":"A new heuristic branching scheme for the crew pairing problem with base constraints","volume":"80","year":"2017","journal-title":"Computers and Operations Research"},{"issue":"1","key":"key2022112904501091900_ref039","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/trsc.2019.0913","article-title":"Improving air crew rostering by considering crew preferences in the crew pairing problem","volume":"54","year":"2020","journal-title":"Transportation Science"},{"issue":"4","key":"key2022112904501091900_ref040","first-page":"82","article-title":"A new mathematical model for gate assignment problem considering transit passengers and safety constraints: benders decomposition approach","volume":"16","year":"2020","journal-title":"Journal of Industrial Engineering, International"},{"issue":"2","key":"key2022112904501091900_ref041","doi-asserted-by":"publisher","first-page":"970","DOI":"10.24200\/sci.2019.51516.2230","article-title":"A mathematical model for an integrated airline fleet assignment and crew scheduling problem solved by vibration damping optimization","volume":"28","year":"2019","journal-title":"Scientia Iranica"},{"key":"key2022112904501091900_ref042","doi-asserted-by":"crossref","first-page":"114399","DOI":"10.1016\/j.eswa.2020.114399","article-title":"A reinforcement learning-based algorithm for the aircraft maintenance routing problem","volume":"169","year":"2021","journal-title":"Expert Systems with Applications"},{"key":"key2022112904501091900_ref043","article-title":"Recent advances in exact optimization of airline scheduling problems","year":"1995"},{"issue":"1","key":"key2022112904501091900_ref044","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1287\/trsc.1110.0379","article-title":"Integrated airline crew pairing and crew assignment by dynamic constraint aggregation","volume":"46","year":"2012","journal-title":"Transportation Science"},{"issue":"3","key":"key2022112904501091900_ref045","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1016\/j.cor.2010.11.003","article-title":"Aircrew pairings with possible repetitions of the same flight number","volume":"40","year":"2013","journal-title":"Computers and Operations Research"},{"key":"key2022112904501091900_ref046","first-page":"I","article-title":"A new mathematical model to cover crew pairing and rostering problems simultaneously","volume":"9","year":"2021","journal-title":"Journal of Engineering Research"},{"key":"key2022112904501091900_ref047","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.omega.2013.06.006","article-title":"Approaches to solve the fleet-assignment, aircraft-routing, crew-pairing and crew-rostering problems of a regional carrier","volume":"43","year":"2014","journal-title":"Omega"},{"issue":"1","key":"key2022112904501091900_ref048","first-page":"233","article-title":"A novel model and decomposition approach for the integrated airline fleet assignment, aircraft routing, and crew pairing problem","volume":"51","year":"2015","journal-title":"Transportation Science"},{"issue":"3","key":"key2022112904501091900_ref049","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1287\/trsc.1050.0131","article-title":"Robust airline crew pairing: move-up crews","volume":"40","year":"2006","journal-title":"Transportation Science"},{"issue":"4","key":"key2022112904501091900_ref050","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1287\/ijoc.1080.0267","article-title":"An effective deflected subgradient optimization scheme for implementing column generation for large-scale airline crew scheduling problems","volume":"20","year":"2008","journal-title":"INFORMS Journal on Computing"},{"key":"key2022112904501091900_ref051","first-page":"124","article-title":"A genetic algorithm analysis towards optimization solutions","volume":"4","year":"2014","journal-title":"International Journal of Digital Information and Wireless Communications"},{"key":"key2022112904501091900_ref052","article-title":"Integrating crew scheduling and rostering problems","year":"2010"},{"key":"key2022112904501091900_ref053","first-page":"833","article-title":"An iterative approach to robust and integrated aircraft routing and crew scheduling","volume":"5","year":"2010","journal-title":"Computers and Operations Research"},{"key":"key2022112904501091900_ref054","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.tre.2018.11.004","article-title":"Modelling the delay propagation effects of multiple resource connections in an airline network using a Bayesian network model","volume":"122","year":"2019","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"4","key":"key2022112904501091900_ref055","article-title":"Machine learning in airline crew pairing to construct initial clusters for dynamic constraint aggregation","volume":"9","year":"2020","journal-title":"EURO Journal on Transportation and Logistics"},{"key":"key2022112904501091900_ref056","article-title":"Structured convolutional kernel networks for airline crew scheduling","year":"2021"},{"key":"key2022112904501091900_ref057","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/j.tre.2019.03.013","article-title":"Flight delay prediction for commercial air transport: a deep learning approach","volume":"125","year":"2019","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"key2022112904501091900_ref058","first-page":"1213","article-title":"Combining benders' decomposition and column generation for integrated crew pairing and personalized crew assignment problems","volume":"53","year":"2019","journal-title":"Transportation Scienc"},{"key":"key2022112904501091900_ref059","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.eswa.2016.01.045","article-title":"A novel column generation strategy for large scale airline crew pairing problems","volume":"55","year":"2016","journal-title":"Expert Systems with Applications"}],"container-title":["Kybernetes"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/K-02-2021-0127\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/K-02-2021-0127\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T21:46:56Z","timestamp":1753393616000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/k\/article\/51\/12\/3545-3573\/511618"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,6]]},"references-count":61,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2021,9,6]]},"published-print":{"date-parts":[[2022,11,30]]}},"alternative-id":["10.1108\/K-02-2021-0127"],"URL":"https:\/\/doi.org\/10.1108\/k-02-2021-0127","relation":{},"ISSN":["0368-492X"],"issn-type":[{"value":"0368-492X","type":"print"}],"subject":[],"published":{"date-parts":[[2021,9,6]]}}}