IDEAS home Printed from https://ideas.repec.org/a/spr/orspec/v43y2021i3d10.1007_s00291-020-00591-z.html
   My bibliography  Save this article

A novel solution approach with ML-based pseudo-cuts for the Flight and Maintenance Planning problem

Author

Listed:
  • Franco Peschiera

    (Université de Toulouse)

  • Robert Dell

    (Naval Postgraduate School)

  • Johannes Royset

    (Naval Postgraduate School)

  • Alain Haït

    (Université de Toulouse)

  • Nicolas Dupin

    (Université Paris-Saclay)

  • Olga Battaïa

    (KEDGE Business School)

Abstract

This paper deals with the long-term Military Flight and Maintenance Planning problem. In order to solve this problem efficiently, we propose a new solution approach based on a new Mixed Integer Program and the use of both valid cuts generated on the basis of initial conditions and learned cuts based on the prediction of certain characteristics of optimal or near-optimal solutions. These learned cuts are generated by training a Machine Learning model on the input data and results of 5000 instances. This approach helps to reduce the solution time with little losses in optimality and feasibility in comparison with alternative matheuristic methods. The obtained experimental results show the benefit of a new way of adding learned cuts to problems based on predicting specific characteristics of solutions.

Suggested Citation

  • Franco Peschiera & Robert Dell & Johannes Royset & Alain Haït & Nicolas Dupin & Olga Battaïa, 2021. "A novel solution approach with ML-based pseudo-cuts for the Flight and Maintenance Planning problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(3), pages 635-664, September.
    • Handle: RePEc:spr:orspec:v:43:y:2021:i:3:d:10.1007_s00291-020-00591-z
    DOI: 10.1007/s00291-020-00591-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00291-020-00591-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00291-020-00591-z?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. M. W. P. Savelsbergh, 1994. "Preprocessing and Probing Techniques for Mixed Integer Programming Problems," INFORMS Journal on Computing, INFORMS, vol. 6(4), pages 445-454, November.
    2. El-Ghazali Talbi, 2016. "Combining metaheuristics with mathematical programming, constraint programming and machine learning," Annals of Operations Research, Springer, vol. 240(1), pages 171-215, May.
    3. Gavranis, Andreas & Kozanidis, George, 2015. "An exact solution algorithm for maximizing the fleet availability of a unit of aircraft subject to flight and maintenance requirements," European Journal of Operational Research, Elsevier, vol. 242(2), pages 631-643.
    4. Adamo, Tommaso & Ghiani, Gianpaolo & Guerriero, Emanuela & Manni, Emanuele, 2017. "Automatic instantiation of a Variable Neighborhood Descent from a Mixed Integer Programming model," Operations Research Perspectives, Elsevier, vol. 4(C), pages 123-135.
    5. Rockafellar, R.T. & Royset, J.O., 2010. "On buffered failure probability in design and optimization of structures," Reliability Engineering and System Safety, Elsevier, vol. 95(5), pages 499-510.
    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. Robin Dee & Armin Fügenschuh & George Kaimakamis, 2021. "The Unit Re-Balancing Problem," Mathematics, MDPI, vol. 9(24), pages 1-19, December.
    2. Cha, Guesik & Park, Junseok & Moon, Ilkyeong, 2023. "Military aircraft flight and maintenance planning model considering heterogeneous maintenance tasks," Reliability Engineering and System Safety, Elsevier, vol. 239(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. José García & José Lemus-Romani & Francisco Altimiras & Broderick Crawford & Ricardo Soto & Marcelo Becerra-Rozas & Paola Moraga & Alex Paz Becerra & Alvaro Peña Fritz & Jose-Miguel Rubio & Gino Astor, 2021. "A Binary Machine Learning Cuckoo Search Algorithm Improved by a Local Search Operator for the Set-Union Knapsack Problem," Mathematics, MDPI, vol. 9(20), pages 1-19, October.
    2. Matthew Norton & Valentyn Khokhlov & Stan Uryasev, 2021. "Calculating CVaR and bPOE for common probability distributions with application to portfolio optimization and density estimation," Annals of Operations Research, Springer, vol. 299(1), pages 1281-1315, April.
    3. Xiaojiao Tong & Hailin Sun & Xiao Luo & Quanguo Zheng, 2018. "Distributionally robust chance constrained optimization for economic dispatch in renewable energy integrated systems," Journal of Global Optimization, Springer, vol. 70(1), pages 131-158, January.
    4. Thilini V. Mahanama & Abootaleb Shirvani & Svetlozar Rachev, 2023. "The Financial Market of Indices of Socioeconomic Wellbeing," Papers 2303.05654, arXiv.org.
    5. Massimiliano Amarante, 2016. "A representation of risk measures," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 39(1), pages 95-103, April.
    6. José García & Victor Yepes & José V. Martí, 2020. "A Hybrid k-Means Cuckoo Search Algorithm Applied to the Counterfort Retaining Walls Problem," Mathematics, MDPI, vol. 8(4), pages 1-22, April.
    7. Cappanera, Paola & Visintin, Filippo & Banditori, Carlo, 2014. "Comparing resource balancing criteria in master surgical scheduling: A combined optimisation-simulation approach," International Journal of Production Economics, Elsevier, vol. 158(C), pages 179-196.
    8. Mafusalov, Alexander & Uryasev, Stan, 2016. "CVaR (superquantile) norm: Stochastic case," European Journal of Operational Research, Elsevier, vol. 249(1), pages 200-208.
    9. Pilla, Venkata L. & Rosenberger, Jay M. & Chen, Victoria & Engsuwan, Narakorn & Siddappa, Sheela, 2012. "A multivariate adaptive regression splines cutting plane approach for solving a two-stage stochastic programming fleet assignment model," European Journal of Operational Research, Elsevier, vol. 216(1), pages 162-171.
    10. José García & José V. Martí & Víctor Yepes, 2020. "The Buttressed Walls Problem: An Application of a Hybrid Clustering Particle Swarm Optimization Algorithm," Mathematics, MDPI, vol. 8(6), pages 1-22, May.
    11. R. Tyrrell Rockafellar & Johannes O. Royset, 2018. "Superquantile/CVaR risk measures: second-order theory," Annals of Operations Research, Springer, vol. 262(1), pages 3-28, March.
    12. Lorena Pradenas & Marco Fuentes & Víctor Parada, 2020. "Optimizing waste storage areas in health care centers," Annals of Operations Research, Springer, vol. 295(1), pages 503-516, December.
    13. Carlos Lagos & Felipe Delgado & Mathias A. Klapp, 2020. "Dynamic Optimization for Airline Maintenance Operations," Transportation Science, INFORMS, vol. 54(4), pages 998-1015, July.
    14. José García & Paola Moraga & Matias Valenzuela & Hernan Pinto, 2020. "A db-Scan Hybrid Algorithm: An Application to the Multidimensional Knapsack Problem," Mathematics, MDPI, vol. 8(4), pages 1-22, April.
    15. José Lemus-Romani & Marcelo Becerra-Rozas & Broderick Crawford & Ricardo Soto & Felipe Cisternas-Caneo & Emanuel Vega & Mauricio Castillo & Diego Tapia & Gino Astorga & Wenceslao Palma & Carlos Castro, 2021. "A Novel Learning-Based Binarization Scheme Selector for Swarm Algorithms Solving Combinatorial Problems," Mathematics, MDPI, vol. 9(22), pages 1-41, November.
    16. Kumar Abhishek & Sven Leyffer & Jeff Linderoth, 2010. "FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs," INFORMS Journal on Computing, INFORMS, vol. 22(4), pages 555-567, November.
    17. Abate, Arega Getaneh & Riccardi, Rossana & Ruiz, Carlos, 2021. "Contracts in electricity markets under EU ETS: A stochastic programming approach," Energy Economics, Elsevier, vol. 99(C).
    18. Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.
    19. Feng, Qiang & Bi, Xiong & Zhao, Xiujie & Chen, Yiran & Sun, Bo, 2017. "Heuristic hybrid game approach for fleet condition-based maintenance planning," Reliability Engineering and System Safety, Elsevier, vol. 157(C), pages 166-176.

    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:spr:orspec:v:43:y:2021:i:3:d:10.1007_s00291-020-00591-z. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.