[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v283y2020i3p1040-1054.html
   My bibliography  Save this article

A branch-and-price heuristic for the crew pairing problem with language constraints

Author

Listed:
  • Quesnel, Frédéric
  • Desaulniers, Guy
  • Soumis, François
Abstract
In large commercial airlines, the monthly schedule (roster) of the crew members is usually determined by solving two problems sequentially, namely, the crew pairing problem (CPP) and the crew rostering problem (CRP). While the CPP finds a set of low-cost feasible anonymous pairings, the CRP assigns these pairings to the crew members to create a valid roster. The CRP often involves language constraints, which request language qualifications among the crew members operating some flights. In this case, the pairings returned by the CPP are not necessarily compatible with the qualifications of the available crew members, resulting in a large number of violated language constraints in the CRP. In this paper, we propose a new CPP variant, called the CPP with language constraints (CPPLC), that takes into account two types of soft language constraints that help producing more suitable pairings for satisfying the CRP language constraints. To solve the CPPLC, we develop a branch-and-price heuristic that includes an efficient partial pricing strategy for handling the large number of subproblems needed to model the language constraints. We also propose an acceleration technique to compute a high-quality (usually fractional) solution at the root node of the search tree. The proposed algorithm is tested on seven real-world datasets. We show that pairings produced by the CPPLC are better-suited for the CRP, resulting in a reduction of the number of violated CRP language constraints that varies between 61% and 96%, when compared to the pairings obtained from the traditional CPP.

Suggested Citation

  • Quesnel, Frédéric & Desaulniers, Guy & Soumis, François, 2020. "A branch-and-price heuristic for the crew pairing problem with language constraints," European Journal of Operational Research, Elsevier, vol. 283(3), pages 1040-1054.
    • Handle: RePEc:eee:ejores:v:283:y:2020:i:3:p:1040-1054
    DOI: 10.1016/j.ejor.2019.11.043
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221719309555
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2019.11.043?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Souai, Nadia & Teghem, Jacques, 2009. "Genetic algorithm based approach for the integrated airline crew-pairing and rostering problem," European Journal of Operational Research, Elsevier, vol. 199(3), pages 674-683, December.
    2. Desaulniers, G. & Desrosiers, J. & Dumas, Y. & Marc, S. & Rioux, B. & Solomon, M. M. & Soumis, F., 1997. "Crew pairing at Air France," European Journal of Operational Research, Elsevier, vol. 97(2), pages 245-259, March.
    3. Vahid Zeighami & François Soumis, 2019. "Combining Benders’ Decomposition and Column Generation for Integrated Crew Pairing and Personalized Crew Assignment Problems," Transportation Science, INFORMS, vol. 53(5), pages 1479-1499, September.
    4. Atoosa Kasirzadeh & Mohammed Saddoune & François Soumis, 2017. "Airline crew scheduling: models, algorithms, and data sets," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 111-137, June.
    5. Mohammed Saddoune & Guy Desaulniers & Issmail Elhallaoui & François Soumis, 2012. "Integrated Airline Crew Pairing and Crew Assignment by Dynamic Constraint Aggregation," Transportation Science, INFORMS, vol. 46(1), pages 39-55, February.
    6. Mohamed Haouari & Farah Zeghal Mansour & Hanif D. Sherali, 2019. "A New Compact Formulation for the Daily Crew Pairing Problem," Transportation Science, INFORMS, vol. 53(3), pages 811-828, May.
    7. Balaji Gopalakrishnan & Ellis. Johnson, 2005. "Airline Crew Scheduling: State-of-the-Art," Annals of Operations Research, Springer, vol. 140(1), pages 305-337, November.
    8. Maenhout, Broos & Vanhoucke, Mario, 2010. "A hybrid scatter search heuristic for personalized crew rostering in the airline industry," European Journal of Operational Research, Elsevier, vol. 206(1), pages 155-167, October.
    9. Pamela H. Vance & Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser, 1997. "Airline Crew Scheduling: A New Formulation and Decomposition Algorithm," Operations Research, INFORMS, vol. 45(2), pages 188-200, April.
    10. Boubaker, Khaled & Desaulniers, Guy & Elhallaoui, Issmail, 2010. "Bidline scheduling with equity by heuristic dynamic constraint aggregation," Transportation Research Part B: Methodological, Elsevier, vol. 44(1), pages 50-61, January.
    11. Villeneuve, Daniel & Desaulniers, Guy, 2005. "The shortest path problem with forbidden paths," European Journal of Operational Research, Elsevier, vol. 165(1), pages 97-107, August.
    12. Ioannis T. Christou & Armand Zakarian & Jun-Min Liu & Helen Carter, 1999. "A Two-Phase Genetic Algorithm for Large-Scale Bidline-Generation Problems at Delta Air Lines," Interfaces, INFORMS, vol. 29(5), pages 51-65, October.
    13. Cynthia Barnhart & Levent Hatay & Ellis L. Johnson, 1995. "Deadhead Selection for the Long-Haul Crew Pairing Problem," Operations Research, INFORMS, vol. 43(3), pages 491-499, June.
    14. Medard, Claude P. & Sawhney, Nidhi, 2007. "Airline crew scheduling from planning to operations," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1013-1027, December.
    15. Michel Gamache & François Soumis & Daniel Villeneuve & Jacques Desrosiers & Éric Gélinas, 1998. "The Preferential Bidding System at Air Canada," Transportation Science, INFORMS, vol. 32(3), pages 246-255, August.
    16. Valentina Cacchiani & Juan-José Salazar-González, 2017. "Optimal Solutions to a Real-World Integrated Airline Scheduling Problem," Transportation Science, INFORMS, vol. 51(1), pages 250-268, February.
    17. Michel Gamache & François Soumis & Gérald Marquis & Jacques Desrosiers, 1999. "A Column Generation Approach for Large-Scale Aircrew Rostering Problems," Operations Research, INFORMS, vol. 47(2), pages 247-263, April.
    18. Stefan Irnich & Guy Desaulniers, 2005. "Shortest Path Problems with Resource Constraints," Springer Books, in: Guy Desaulniers & Jacques Desrosiers & Marius M. Solomon (ed.), Column Generation, chapter 0, pages 33-65, Springer.
    19. Jesica Armas & Luis Cadarso & Angel A. Juan & Javier Faulin, 2017. "A multi-start randomized heuristic for real-life crew rostering problems in airlines with work-balancing goals," Annals of Operations Research, Springer, vol. 258(2), pages 825-848, November.
    20. Jeffery Weir & Ellis Johnson, 2004. "A Three-Phase Approach to Solving the Bidline Problem," Annals of Operations Research, Springer, vol. 127(1), pages 283-308, March.
    21. Niklas Kohl & Stefan Karisch, 2004. "Airline Crew Rostering: Problem Types, Modeling, and Optimization," Annals of Operations Research, Springer, vol. 127(1), pages 223-257, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hua, Shijia & Zeng, Wenjia & Liu, Xinglu & Qi, Mingyao, 2022. "Optimality-guaranteed algorithms on the dynamic shared-taxi problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    2. Wen, Xin & Chung, Sai-Ho & Ji, Ping & Sheu, Jiuh-Biing, 2022. "Individual scheduling approach for multi-class airline cabin crew with manpower requirement heterogeneity," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 163(C).
    3. Weihao Ouyang & Xiaohong Zhu, 2023. "Meta-Heuristic Solver with Parallel Genetic Algorithm Framework in Airline Crew Scheduling," Sustainability, MDPI, vol. 15(2), pages 1-21, January.
    4. Feng, Tao & Lusby, Richard M. & Zhang, Yongxiang & Tao, Siyu & Zhang, Bojian & Peng, Qiyuan, 2024. "A branch-and-price algorithm for integrating urban rail crew scheduling and rostering problems," Transportation Research Part B: Methodological, Elsevier, vol. 183(C).
    5. Zeren, Bahadır & Özcan, Ender & Deveci, Muhammet, 2024. "An adaptive greedy heuristic for large scale airline crew pairing problems," Journal of Air Transport Management, Elsevier, vol. 114(C).
    6. Xu, Yifan & Adler, Nicole & Wandelt, Sebastian & Sun, Xiaoqian, 2024. "Competitive integrated airline schedule design and fleet assignment," European Journal of Operational Research, Elsevier, vol. 314(1), pages 32-50.
    7. Wen, Xin & Sun, Xuting & Sun, Yige & Yue, Xiaohang, 2021. "Airline crew scheduling: Models and algorithms," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 149(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Atoosa Kasirzadeh & Mohammed Saddoune & François Soumis, 2017. "Airline crew scheduling: models, algorithms, and data sets," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 111-137, June.
    2. Vahid Zeighami & François Soumis, 2019. "Combining Benders’ Decomposition and Column Generation for Integrated Crew Pairing and Personalized Crew Assignment Problems," Transportation Science, INFORMS, vol. 53(5), pages 1479-1499, September.
    3. Philippe Racette & Frédéric Quesnel & Andrea Lodi & François Soumis, 2024. "Gaining insight into crew rostering instances through ML-based sequential assignment," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 32(3), pages 537-578, October.
    4. Frédéric Quesnel & Guy Desaulniers & Frédéric Quesnel, 2020. "Improving Air Crew Rostering by Considering Crew Preferences in the Crew Pairing Problem," Transportation Science, INFORMS, vol. 54(1), pages 97-114, January.
    5. Saddoune, Mohammed & Desaulniers, Guy & Elhallaoui, Issmail & Soumis, François, 2011. "Integrated airline crew scheduling: A bi-dynamic constraint aggregation method using neighborhoods," European Journal of Operational Research, Elsevier, vol. 212(3), pages 445-454, August.
    6. Boubaker, Khaled & Desaulniers, Guy & Elhallaoui, Issmail, 2010. "Bidline scheduling with equity by heuristic dynamic constraint aggregation," Transportation Research Part B: Methodological, Elsevier, vol. 44(1), pages 50-61, January.
    7. Guy Desaulniers & François Lessard & Mohammed Saddoune & François Soumis, 2020. "Dynamic Constraint Aggregation for Solving Very Large-scale Airline Crew Pairing Problems," SN Operations Research Forum, Springer, vol. 1(3), pages 1-23, September.
    8. Mohammed Saddoune & Guy Desaulniers & Issmail Elhallaoui & François Soumis, 2012. "Integrated Airline Crew Pairing and Crew Assignment by Dynamic Constraint Aggregation," Transportation Science, INFORMS, vol. 46(1), pages 39-55, February.
    9. Maenhout, Broos & Vanhoucke, Mario, 2010. "A hybrid scatter search heuristic for personalized crew rostering in the airline industry," European Journal of Operational Research, Elsevier, vol. 206(1), pages 155-167, October.
    10. Jesica Armas & Luis Cadarso & Angel A. Juan & Javier Faulin, 2017. "A multi-start randomized heuristic for real-life crew rostering problems in airlines with work-balancing goals," Annals of Operations Research, Springer, vol. 258(2), pages 825-848, November.
    11. Zeren, Bahadır & Özcan, Ender & Deveci, Muhammet, 2024. "An adaptive greedy heuristic for large scale airline crew pairing problems," Journal of Air Transport Management, Elsevier, vol. 114(C).
    12. Doi, Tsubasa & Nishi, Tatsushi & Voß, Stefan, 2018. "Two-level decomposition-based matheuristic for airline crew rostering problems with fair working time," European Journal of Operational Research, Elsevier, vol. 267(2), pages 428-438.
    13. Mohamed Haouari & Farah Zeghal Mansour & Hanif D. Sherali, 2019. "A New Compact Formulation for the Daily Crew Pairing Problem," Transportation Science, INFORMS, vol. 53(3), pages 811-828, May.
    14. Wen, Xin & Chung, Sai-Ho & Ji, Ping & Sheu, Jiuh-Biing, 2022. "Individual scheduling approach for multi-class airline cabin crew with manpower requirement heterogeneity," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 163(C).
    15. Zeighami, Vahid & Saddoune, Mohammed & Soumis, François, 2020. "Alternating Lagrangian decomposition for integrated airline crew scheduling problem," European Journal of Operational Research, Elsevier, vol. 287(1), pages 211-224.
    16. Schrotenboer, Albert H. & Wenneker, Rob & Ursavas, Evrim & Zhu, Stuart X., 2023. "Reliable reserve-crew scheduling for airlines," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 178(C).
    17. Weihao Ouyang & Xiaohong Zhu, 2023. "Meta-Heuristic Solver with Parallel Genetic Algorithm Framework in Airline Crew Scheduling," Sustainability, MDPI, vol. 15(2), pages 1-21, January.
    18. Sai Ho Chung & Hoi Lam Ma & Hing Kai Chan, 2017. "Cascading Delay Risk of Airline Workforce Deployments with Crew Pairing and Schedule Optimization," Risk Analysis, John Wiley & Sons, vol. 37(8), pages 1443-1458, August.
    19. Parmentier, Axel & Meunier, Frédéric, 2020. "Aircraft routing and crew pairing: Updated algorithms at Air France," Omega, Elsevier, vol. 93(C).
    20. Jütte, Silke & Thonemann, Ulrich W., 2012. "Divide-and-price: A decomposition algorithm for solving large railway crew scheduling problems," European Journal of Operational Research, Elsevier, vol. 219(2), pages 214-223.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:283:y:2020:i:3:p:1040-1054. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.