IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v296y2022i2p393-422.html
   My bibliography  Save this article

Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: A state-of-the-art

Author

Listed:
  • Karimi-Mamaghan, Maryam
  • Mohammadi, Mehrdad
  • Meyer, Patrick
  • Karimi-Mamaghan, Amir Mohammad
  • Talbi, El-Ghazali

Abstract

In recent years, there has been a growing research interest in integrating machine learning techniques into meta-heuristics for solving combinatorial optimization problems. This integration aims to lead meta-heuristics toward an efficient, effective, and robust search and improve their performance in terms of solution quality, convergence rate, and robustness.

Suggested Citation

  • Karimi-Mamaghan, Maryam & Mohammadi, Mehrdad & Meyer, Patrick & Karimi-Mamaghan, Amir Mohammad & Talbi, El-Ghazali, 2022. "Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: A state-of-the-art," European Journal of Operational Research, Elsevier, vol. 296(2), pages 393-422.
    • Handle: RePEc:eee:ejores:v:296:y:2022:i:2:p:393-422
    DOI: 10.1016/j.ejor.2021.04.032
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221721003623
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2021.04.032?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. Allahverdi, Ali, 2015. "The third comprehensive survey on scheduling problems with setup times/costs," European Journal of Operational Research, Elsevier, vol. 246(2), pages 345-378.
    2. Maturana, Jorge & Riff, Maria-Cristina, 2007. "Solving the short-term electrical generation scheduling problem by an adaptive evolutionary approach," European Journal of Operational Research, Elsevier, vol. 179(3), pages 677-691, June.
    3. Mosadegh, H. & Fatemi Ghomi, S.M.T. & Süer, G.A., 2020. "Stochastic mixed-model assembly line sequencing problem: Mathematical modeling and Q-learning based simulated annealing hyper-heuristics," European Journal of Operational Research, Elsevier, vol. 282(2), pages 530-544.
    4. Zhalechian, M. & Tavakkoli-Moghaddam, R. & Zahiri, B. & Mohammadi, M., 2016. "Sustainable design of a closed-loop location-routing-inventory supply chain network under mixed uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 89(C), pages 182-214.
    5. Corne, David & Dhaenens, Clarisse & Jourdan, Laetitia, 2012. "Synergies between operations research and data mining: The emerging use of multi-objective approaches," European Journal of Operational Research, Elsevier, vol. 221(3), pages 469-479.
    6. Wawrzyniak, Jakub & Drozdowski, Maciej & Sanlaville, Éric, 2020. "Selecting algorithms for large berth allocation problems," European Journal of Operational Research, Elsevier, vol. 283(3), pages 844-862.
    7. Messelis, Tommy & De Causmaecker, Patrick, 2014. "An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 233(3), pages 511-528.
    8. Karimi-Mamaghan, Maryam & Mohammadi, Mehrdad & Pirayesh, Amir & Karimi-Mamaghan, Amir Mohammad & Irani, Hassan, 2020. "Hub-and-spoke network design under congestion: A learning based metaheuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    9. Mohammadi, Mehrdad & Jula, Payman & Tavakkoli-Moghaddam, Reza, 2019. "Reliable single-allocation hub location problem with disruptions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 123(C), pages 90-120.
    10. Yong Deng & Yang Liu & Deyun Zhou, 2015. "An Improved Genetic Algorithm with Initial Population Strategy for Symmetric TSP," Mathematical Problems in Engineering, Hindawi, vol. 2015, pages 1-6, October.
    11. Gerhard Reinelt, 1991. "TSPLIB—A Traveling Salesman Problem Library," INFORMS Journal on Computing, INFORMS, vol. 3(4), pages 376-384, November.
    12. Edmund K Burke & Michel Gendreau & Matthew Hyde & Graham Kendall & Gabriela Ochoa & Ender Özcan & Rong Qu, 2013. "Hyper-heuristics: a survey of the state of the art," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(12), pages 1695-1724, December.
    13. Bo Peng & Yuan Zhang & Yuvraj Gajpal & Xiding Chen, 2019. "A Memetic Algorithm for the Green Vehicle Routing Problem," Sustainability, MDPI, vol. 11(21), pages 1-20, October.
    14. Koç, Çağrı & Bektaş, Tolga & Jabali, Ola & Laporte, Gilbert, 2016. "Thirty years of heterogeneous vehicle routing," European Journal of Operational Research, Elsevier, vol. 249(1), pages 1-21.
    15. Taillard, E., 1993. "Benchmarks for basic scheduling problems," European Journal of Operational Research, Elsevier, vol. 64(2), pages 278-285, January.
    16. Martin, Simon & Ouelhadj, Djamila & Beullens, Patrick & Ozcan, Ender & Juan, Angel A. & Burke, Edmund K., 2016. "A multi-agent based cooperative approach to scheduling and routing," European Journal of Operational Research, Elsevier, vol. 254(1), pages 169-178.
    17. Voudouris, Christos & Tsang, Edward, 1999. "Guided local search and its application to the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 113(2), pages 469-499, March.
    18. Bengio, Yoshua & Lodi, Andrea & Prouvost, Antoine, 2021. "Machine learning for combinatorial optimization: A methodological tour d’horizon," European Journal of Operational Research, Elsevier, vol. 290(2), pages 405-421.
    19. Gao, Shangce & Wang, Yirui & Cheng, Jiujun & Inazumi, Yasuhiro & Tang, Zheng, 2016. "Ant colony optimization with clustering for solving the dynamic location routing problem," Applied Mathematics and Computation, Elsevier, vol. 285(C), pages 149-173.
    20. Karimi-Mamaghan, Maryam & Mohammadi, Mehrdad & Jula, Payman & Pirayesh, Amir & Ahmadi, Hadi, 2020. "A learning-based metaheuristic for a multi-objective agile inspection planning model under uncertainty," European Journal of Operational Research, Elsevier, vol. 285(2), pages 513-537.
    21. Benlic, Una & Epitropakis, Michael G. & Burke, Edmund K., 2017. "A hybrid breakout local search and reinforcement learning approach to the vertex separator problem," European Journal of Operational Research, Elsevier, vol. 261(3), pages 803-818.
    22. 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.
    23. Edmund K. Burke & Matthew R. Hyde & Graham Kendall & Gabriela Ochoa & Ender Özcan & John R. Woodward, 2019. "A Classification of Hyper-Heuristic Approaches: Revisited," International Series in Operations Research & Management Science, in: Michel Gendreau & Jean-Yves Potvin (ed.), Handbook of Metaheuristics, edition 3, chapter 0, pages 453-477, Springer.
    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. de Oliveira, Raphael Mazzine Barbosa & Sörensen, Kenneth & Martens, David, 2024. "A model-agnostic and data-independent tabu search algorithm to generate counterfactuals for tabular, image, and text data," European Journal of Operational Research, Elsevier, vol. 317(2), pages 286-302.
    2. 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.
    3. Samah Jomah & Aji S, 2024. "Meta-Heuristic Scheduling: A Review on Swarm Intelligence and Hybrid Meta-Heuristics Algorithms for Cloud Computing," SN Operations Research Forum, Springer, vol. 5(4), pages 1-42, December.
    4. Camur, Mustafa C. & Sharkey, Thomas C. & Vogiatzis, Chrysafis, 2023. "The stochastic pseudo-star degree centrality problem," European Journal of Operational Research, Elsevier, vol. 308(2), pages 525-539.
    5. Mohammadi, Mehrdad & Dehghan, Milad & Pirayesh, Amir & Dolgui, Alexandre, 2022. "Bi‐objective optimization of a stochastic resilient vaccine distribution network in the context of the COVID‐19 pandemic," Omega, Elsevier, vol. 113(C).
    6. Fajemisin, Adejuyigbe O. & Maragno, Donato & den Hertog, Dick, 2024. "Optimization with constraint learning: A framework and survey," European Journal of Operational Research, Elsevier, vol. 314(1), pages 1-14.
    7. Lagos, Felipe & Pereira, Jordi, 2024. "Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 312(1), pages 70-91.
    8. Fang, Chao & Han, Zonglei & Wang, Wei & Zio, Enrico, 2023. "Routing UAVs in landslides Monitoring: A neural network heuristic for team orienteering with mandatory visits," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 175(C).
    9. Filom, Siyavash & Amiri, Amir M. & Razavi, Saiedeh, 2022. "Applications of machine learning methods in port operations – A systematic literature review," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
    10. Hashemi-Petroodi, S. Ehsan & Thevenin, Simon & Kovalev, Sergey & Dolgui, Alexandre, 2023. "Markov decision process for multi-manned mixed-model assembly lines with walking workers," International Journal of Production Economics, Elsevier, vol. 255(C).
    11. Eduardo Guzman & Beatriz Andres & Raul Poler, 2022. "A Decision-Making Tool for Algorithm Selection Based on a Fuzzy TOPSIS Approach to Solve Replenishment, Production and Distribution Planning Problems," Mathematics, MDPI, vol. 10(9), pages 1-28, May.
    12. Karimi-Mamaghan, Maryam & Mohammadi, Mehrdad & Pasdeloup, Bastien & Meyer, Patrick, 2023. "Learning to select operators in meta-heuristics: An integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 304(3), pages 1296-1330.
    13. Marcelo Becerra-Rozas & Felipe Cisternas-Caneo & Broderick Crawford & Ricardo Soto & José García & Gino Astorga & Wenceslao Palma, 2022. "Embedded Learning Approaches in the Whale Optimizer to Solve Coverage Combinatorial Problems," Mathematics, MDPI, vol. 10(23), pages 1-18, November.

    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. Karimi-Mamaghan, Maryam & Mohammadi, Mehrdad & Pasdeloup, Bastien & Meyer, Patrick, 2023. "Learning to select operators in meta-heuristics: An integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 304(3), pages 1296-1330.
    2. Mohri, Seyed Sina & Mohammadi, Mehrdad & Gendreau, Michel & Pirayesh, Amir & Ghasemaghaei, Ali & Salehi, Vahid, 2022. "Hazardous material transportation problems: A comprehensive overview of models and solution approaches," European Journal of Operational Research, Elsevier, vol. 302(1), pages 1-38.
    3. Müller, David & Müller, Marcus G. & Kress, Dominik & Pesch, Erwin, 2022. "An algorithm selection approach for the flexible job shop scheduling problem: Choosing constraint programming solvers through machine learning," European Journal of Operational Research, Elsevier, vol. 302(3), pages 874-891.
    4. Muren, & Wu, Jianjun & Zhou, Li & Du, Zhiping & Lv, Ying, 2019. "Mixed steepest descent algorithm for the traveling salesman problem and application in air logistics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 87-102.
    5. Salii, Yaroslav, 2019. "Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization," European Journal of Operational Research, Elsevier, vol. 272(1), pages 32-42.
    6. S Salhi & A Al-Khedhairi, 2010. "Integrating heuristic information into exact methods: The case of the vertex p-centre problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1619-1631, November.
    7. Rafael Blanquero & Emilio Carrizosa & Amaya Nogales-Gómez & Frank Plastria, 2014. "Single-facility huff location problems on networks," Annals of Operations Research, Springer, vol. 222(1), pages 175-195, November.
    8. Martins, Francisco Leonardo Bezerra & do Nascimento, José Cláudio, 2022. "Power law dynamics in genealogical graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 596(C).
    9. Shahvari, Omid & Logendran, Rasaratnam, 2016. "Hybrid flow shop batching and scheduling with a bi-criteria objective," International Journal of Production Economics, Elsevier, vol. 179(C), pages 239-258.
    10. Marjan Marzban & Qian-Ping Gu & Xiaohua Jia, 2016. "New analysis and computational study for the planar connected dominating set problem," Journal of Combinatorial Optimization, Springer, vol. 32(1), pages 198-225, July.
    11. Ferrer, José M. & Martín-Campo, F. Javier & Ortuño, M. Teresa & Pedraza-Martínez, Alfonso J. & Tirado, Gregorio & Vitoriano, Begoña, 2018. "Multi-criteria optimization for last mile distribution of disaster relief aid: Test cases and applications," European Journal of Operational Research, Elsevier, vol. 269(2), pages 501-515.
    12. R. Baldacci & E. Hadjiconstantinou & A. Mingozzi, 2004. "An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation," Operations Research, INFORMS, vol. 52(5), pages 723-738, October.
    13. Roberto Tadei & Guido Perboli & Francesca Perfetti, 2017. "The multi-path Traveling Salesman Problem with stochastic travel costs," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 3-23, March.
    14. Raeesi, Ramin & Sahebjamnia, Navid & Mansouri, S. Afshin, 2023. "The synergistic effect of operational research and big data analytics in greening container terminal operations: A review and future directions," European Journal of Operational Research, Elsevier, vol. 310(3), pages 943-973.
    15. Lancia, Giuseppe & Vidoni, Paolo, 2020. "Finding the largest triangle in a graph in expected quadratic time," European Journal of Operational Research, Elsevier, vol. 286(2), pages 458-467.
    16. Oya Ekin Karaşan & A. Ridha Mahjoub & Onur Özkök & Hande Yaman, 2014. "Survivability in Hierarchical Telecommunications Networks Under Dual Homing," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 1-15, February.
    17. Paredes-Belmar, Germán & Montero, Elizabeth & Lüer-Villagra, Armin & Marianov, Vladimir & Araya-Sassi, Claudio, 2022. "Vehicle routing for milk collection with gradual blending: A case arising in Chile," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1403-1416.
    18. 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.
    19. Thanh Tan Doan & Nathalie Bostel & Minh Hoàng Hà & Vu Hoang Vuong Nguyen, 2023. "New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule," Journal of Combinatorial Optimization, Springer, vol. 46(1), pages 1-27, August.
    20. Pop, Petrică C. & Cosma, Ovidiu & Sabo, Cosmin & Sitar, Corina Pop, 2024. "A comprehensive survey on the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 314(3), pages 819-835.

    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:296:y:2022:i:2:p:393-422. 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.