IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v240y2016i1d10.1007_s10479-015-2034-y.html
   My bibliography  Save this article

Combining metaheuristics with mathematical programming, constraint programming and machine learning

Author

Listed:
  • El-Ghazali Talbi

    (University of Lille 1)

Abstract

During the last years, interest on hybrid metaheuristics has risen considerably in the field of optimization and machine learning. The best results found for many optimization problems in science and industry are obtained by hybrid optimization algorithms. Combinations of optimization tools such as metaheuristics, mathematical programming, constraint programming and machine learning, have provided very efficient optimization algorithms. Four different types of combinations are considered in this paper: (1) Combining metaheuristics with complementary metaheuristics. (2) Combining metaheuristics with exact methods from mathematical programming approaches which are mostly used in the operations research community. (3) Combining metaheuristics with constraint programming approaches developed in the artificial intelligence community. (4) Combining metaheuristics with machine learning and data mining techniques.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:240:y:2016:i:1:d:10.1007_s10479-015-2034-y
    DOI: 10.1007/s10479-015-2034-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-015-2034-y
    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/s10479-015-2034-y?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. Taillard, Eric D. & Gambardella, Luca M. & Gendreau, Michel & Potvin, Jean-Yves, 2001. "Adaptive memory programming: A unified view of metaheuristics," European Journal of Operational Research, Elsevier, vol. 135(1), pages 1-16, November.
    2. David Applegate & William Cook, 1991. "A Computational Study of the Job-Shop Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 3(2), pages 149-156, May.
    3. V. Chvatal, 1979. "A Greedy Heuristic for the Set-Covering Problem," Mathematics of Operations Research, INFORMS, vol. 4(3), pages 233-235, August.
    4. Dowsland, Kathryn A. & Herbert, Edward A. & Kendall, Graham & Burke, Edmund, 2006. "Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems," European Journal of Operational Research, Elsevier, vol. 168(2), pages 390-402, January.
    5. Thomas A. Feo & Mauricio G. C. Resende & Stuart H. Smith, 1994. "A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set," Operations Research, INFORMS, vol. 42(5), pages 860-878, October.
    6. William Cook & Paul Seymour, 2003. "Tour Merging via Branch-Decomposition," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 233-248, August.
    7. Marshall L. Fisher, 1985. "An Applications Oriented Guide to Lagrangian Relaxation," Interfaces, INFORMS, vol. 15(2), pages 10-21, April.
    8. Rosing, K. E. & ReVelle, C. S., 1997. "Heuristic concentration: Two stage solution construction," European Journal of Operational Research, Elsevier, vol. 97(1), pages 75-86, February.
    9. P. C. Gilmore & R. E. Gomory, 1961. "A Linear Programming Approach to the Cutting-Stock Problem," Operations Research, INFORMS, vol. 9(6), pages 849-859, December.
    10. Richard M. Karp, 1977. "Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 209-224, August.
    11. Vittorio Maniezzo, 1999. "Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 11(4), pages 358-369, November.
    12. Dowsland, Kathryn A., 1998. "Nurse scheduling with tabu search and strategic oscillation," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 393-407, April.
    13. Steven Prestwich, 2002. "Combining the Scalability of Local Search with the Pruning Techniques of Systematic Search," Annals of Operations Research, Springer, vol. 115(1), pages 51-72, September.
    14. Augerat, P. & Belenguer, J. M. & Benavent, E. & Corberan, A. & Naddef, D., 1998. "Separating capacity constraints in the CVRP using tabu search," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 546-557, April.
    15. Jourdan, L. & Basseur, M. & Talbi, E.-G., 2009. "Hybridizing exact methods and metaheuristics: A taxonomy," European Journal of Operational Research, Elsevier, vol. 199(3), pages 620-629, December.
    16. K S Hindi & K Fleszar & C Charalambous, 2003. "An effective heuristic for the CLSP with set-up times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(5), pages 490-498, May.
    17. Lourenco, Helena Ramalhinho, 1995. "Job-shop scheduling: Computational study of local search and large-step optimization methods," European Journal of Operational Research, Elsevier, vol. 83(2), pages 347-364, June.
    18. Manuel Laguna & Thomas A. Feo & Hal C. Elrod, 1994. "A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem," Operations Research, INFORMS, vol. 42(4), pages 677-687, August.
    19. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    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. David Sacramento & Christine Solnon & David Pisinger, 2020. "Constraint Programming and Local Search Heuristic: a Matheuristic Approach for Routing and Scheduling Feeder Vessels in Multi-terminal Ports," SN Operations Research Forum, Springer, vol. 1(4), pages 1-33, December.
    2. 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.
    3. Giuseppe Fragapane & Dmitry Ivanov & Mirco Peron & Fabio Sgarbossa & Jan Ola Strandhagen, 2022. "Increasing flexibility and productivity in Industry 4.0 production networks with autonomous mobile robots and smart intralogistics," Annals of Operations Research, Springer, vol. 308(1), pages 125-143, January.
    4. 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.
    5. 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.
    6. Jann Michael Weinand & Kenneth Sorensen & Pablo San Segundo & Max Kleinebrahm & Russell McKenna, 2020. "Research trends in combinatorial optimisation," Papers 2012.01294, arXiv.org.
    7. 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.
    8. 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.
    9. 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.
    10. José García & Gino Astorga & Víctor Yepes, 2021. "An Analysis of a KNN Perturbation Operator: An Application to the Binarization of Continuous Metaheuristics," Mathematics, MDPI, vol. 9(3), pages 1-20, January.
    11. 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.
    12. Yulia Sullivan & Marc Bourmont & Mary Dunaway, 2022. "Appraisals of harms and injustice trigger an eerie feeling that decreases trust in artificial intelligence systems," Annals of Operations Research, Springer, vol. 308(1), pages 525-548, January.
    13. Václavík, Roman & Novák, Antonín & Šůcha, Přemysl & Hanzálek, Zdeněk, 2018. "Accelerating the Branch-and-Price Algorithm Using Machine Learning," European Journal of Operational Research, Elsevier, vol. 271(3), pages 1055-1069.
    14. 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.
    15. Christina Iliopoulou & Konstantinos Kepaptsoglou & Eleni Vlahogianni, 2019. "Metaheuristics for the transit route network design problem: a review and comparative analysis," Public Transport, Springer, vol. 11(3), pages 487-521, October.
    16. Emanuel Vega & Ricardo Soto & Pablo Contreras & Broderick Crawford & Javier Peña & Carlos Castro, 2022. "Combining a Population-Based Approach with Multiple Linear Models for Continuous and Discrete Optimization Problems," Mathematics, MDPI, vol. 10(16), pages 1-28, August.
    17. Emanuel Vega & Ricardo Soto & Broderick Crawford & Javier Peña & Carlos Castro, 2021. "A Learning-Based Hybrid Framework for Dynamic Balancing of Exploration-Exploitation: Combining Regression Analysis and Metaheuristics," Mathematics, MDPI, vol. 9(16), pages 1-23, August.
    18. 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.
    19. Sunhyung Yoo & Jinwoo Brian Lee & Hoon Han, 2023. "A Reinforcement Learning approach for bus network design and frequency setting optimisation," Public Transport, Springer, vol. 15(2), pages 503-534, June.
    20. Alexander Biele & Lars Mönch, 2018. "Hybrid approaches to optimize mixed-model assembly lines in low-volume manufacturing," Journal of Heuristics, Springer, vol. 24(1), pages 49-81, February.
    21. 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.

    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. Jourdan, L. & Basseur, M. & Talbi, E.-G., 2009. "Hybridizing exact methods and metaheuristics: A taxonomy," European Journal of Operational Research, Elsevier, vol. 199(3), pages 620-629, December.
    2. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    3. Vipul Jain & Ignacio E. Grossmann, 2001. "Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 13(4), pages 258-276, November.
    4. G I Zobolas & C D Tarantilis & G Ioannou, 2009. "A hybrid evolutionary algorithm for the job shop scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(2), pages 221-235, February.
    5. Huisman, D. & Jans, R.F. & Peeters, M. & Wagelmans, A.P.M., 2003. "Combining Column Generation and Lagrangian Relaxation," ERIM Report Series Research in Management ERS-2003-092-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    6. Omid Shahvari & Rasaratnam Logendran & Madjid Tavana, 2022. "An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems," Journal of Scheduling, Springer, vol. 25(5), pages 589-621, October.
    7. S. David Wu & Eui-Seok Byeon & Robert H. Storer, 1999. "A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness," Operations Research, INFORMS, vol. 47(1), pages 113-124, February.
    8. Rostami, Borzou & Malucelli, Federico & Belotti, Pietro & Gualandi, Stefano, 2016. "Lower bounding procedure for the asymmetric quadratic traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 253(3), pages 584-592.
    9. Schirmer, Andreas & Riesenberg, Sven, 1997. "Parameterized heuristics for project scheduling: Biased random sampling methods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 456, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    10. Barry C. Smith & Ellis L. Johnson, 2006. "Robust Airline Fleet Assignment: Imposing Station Purity Using Station Decomposition," Transportation Science, INFORMS, vol. 40(4), pages 497-516, November.
    11. Richard Freling & H. Edwin Romeijn & Dolores Romero Morales & Albert P. M. Wagelmans, 2003. "A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem," Operations Research, INFORMS, vol. 51(6), pages 922-939, December.
    12. Fırat, M. & Briskorn, D. & Laugier, A., 2016. "A Branch-and-Price algorithm for stable workforce assignments with hierarchical skills," European Journal of Operational Research, Elsevier, vol. 251(2), pages 676-685.
    13. Mobin, Mohammadsadegh & Li, Zhaojun & Cheraghi, S. Hossein & Wu, Gongyu, 2019. "An approach for design Verification and Validation planning and optimization for new product reliability improvement," Reliability Engineering and System Safety, Elsevier, vol. 190(C), pages 1-1.
    14. Marc Peeters & Zeger Degraeve, 2004. "The Co-Printing Problem: A Packing Problem with a Color Constraint," Operations Research, INFORMS, vol. 52(4), pages 623-638, August.
    15. Sven de Vries & Rakesh Vohra, 2000. "Combinatorial Auctions: A Survey," Discussion Papers 1296, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    16. Claudio Arbib & Fabrizio Marinelli & Fabrizio Rossi & Francesco Di Iorio, 2002. "Cutting and Reuse: An Application from Automobile Component Manufacturing," Operations Research, INFORMS, vol. 50(6), pages 923-934, December.
    17. Klose, Andreas & Gortz, Simon, 2007. "A branch-and-price algorithm for the capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1109-1125, June.
    18. Yogesh K. Agarwal, 2002. "Design of Capacitated Multicommodity Networks with Multiple Facilities," Operations Research, INFORMS, vol. 50(2), pages 333-344, April.
    19. A. Ozolins, 2020. "A new exact algorithm for no-wait job shop problem to minimize makespan," Operational Research, Springer, vol. 20(4), pages 2333-2363, December.
    20. Timo Gschwind & Stefan Irnich, 2014. "Dual Inequalities for Stabilized Column Generation Revisited," Working Papers 1407, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz, revised 23 Jul 2014.

    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:annopr:v:240:y:2016:i:1:d:10.1007_s10479-015-2034-y. 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.