IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v70y2018i1d10.1007_s10898-017-0600-3.html
   My bibliography  Save this article

A computational study of primal heuristics inside an MI(NL)P solver

Author

Listed:
  • Timo Berthold

    (FICO)

Abstract

Primal heuristics are a fundamental component of state-of-the-art global solvers for mixed integer linear programming (MIP) and mixed integer nonlinear programming (MINLP). In this paper, we investigate the impact of primal heuristics on the overall solution process. We present a computational study, in which we compare the performance of the MIP and MINLP solver SCIP with and without primal heuristics on six test sets with altogether 983 instances from academic and industrial sources. We analyze how primal heuristics affect the solver regarding seven different measures of performance and show that the impact differs by orders of magnitude. We further argue that the harder a problem is to solve to global optimality, the more important the deployment of primal heuristics becomes.

Suggested Citation

  • Timo Berthold, 2018. "A computational study of primal heuristics inside an MI(NL)P solver," Journal of Global Optimization, Springer, vol. 70(1), pages 189-206, January.
    • Handle: RePEc:spr:jglopt:v:70:y:2018:i:1:d:10.1007_s10898-017-0600-3
    DOI: 10.1007/s10898-017-0600-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-017-0600-3
    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/s10898-017-0600-3?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. Diethard Klatte & Hans-Jakob Lüthi & Karl Schmedders (ed.), 2012. "Operations Research Proceedings 2011," Operations Research Proceedings, Springer, edition 127, number 978-3-642-29210-1, March.
    2. Matteo Fischetti & Michele Monaci, 2014. "Exploiting Erraticism in Search," Operations Research, INFORMS, vol. 62(1), pages 114-122, February.
    3. Ruth Misener & Christodoulos Floudas, 2013. "GloMIQO: Global mixed-integer quadratic optimizer," Journal of Global Optimization, Springer, vol. 57(1), pages 3-50, September.
    4. Quinn McNemar, 1947. "Note on the sampling error of the difference between correlated proportions or percentages," Psychometrika, Springer;The Psychometric Society, vol. 12(2), pages 153-157, June.
    5. Tobias Achterberg & Timo Berthold & Gregor Hendel, 2012. "Rounding and Propagation Heuristics for Mixed Integer Programming," Operations Research Proceedings, in: Diethard Klatte & Hans-Jakob Lüthi & Karl Schmedders (ed.), Operations Research Proceedings 2011, edition 127, pages 71-76, Springer.
    6. Pierre Bonami & João Gonçalves, 2012. "Heuristics for convex mixed integer nonlinear programs," Computational Optimization and Applications, Springer, vol. 51(2), pages 729-747, March.
    7. Thorsten Koch & Ted Ralphs & Yuji Shinano, 2012. "Could we use a million cores to solve an integer program?," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 76(1), pages 67-93, August.
    8. Michael R. Bussieck & Arne Stolbjerg Drud & Alexander Meeraus, 2003. "MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming," INFORMS Journal on Computing, INFORMS, vol. 15(1), pages 114-119, February.
    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. Meenarli Sharma & Prashant Palkar & Ashutosh Mahajan, 2022. "Linearization and parallelization schemes for convex mixed-integer nonlinear optimization," Computational Optimization and Applications, Springer, vol. 81(2), pages 423-478, March.

    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. Christoph Neumann & Oliver Stein & Nathan Sudermann-Merx, 2020. "Granularity in Nonlinear Mixed-Integer Optimization," Journal of Optimization Theory and Applications, Springer, vol. 184(2), pages 433-465, February.
    2. Schepler, Xavier & Rossi, André & Gurevsky, Evgeny & Dolgui, Alexandre, 2022. "Solving robust bin-packing problems with a branch-and-price approach," European Journal of Operational Research, Elsevier, vol. 297(3), pages 831-843.
    3. Lluís-Miquel Munguía & Shabbir Ahmed & David A. Bader & George L. Nemhauser & Yufen Shao, 2018. "Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs," Computational Optimization and Applications, Springer, vol. 69(1), pages 1-24, January.
    4. Luke Mason & Vicky Mak-Hau & Andreas Ernst, 2015. "A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning," Computational Optimization and Applications, Springer, vol. 60(2), pages 441-477, March.
    5. Uttam Bandyopadhyay & Atanu Biswas & Shirsendu Mukherjee, 2009. "Adaptive two-treatment two-period crossover design for binary treatment responses incorporating carry-over effects," Statistical Methods & Applications, Springer;Società Italiana di Statistica, vol. 18(1), pages 13-33, March.
    6. Chacón, José E. & Fernández Serrano, Javier, 2024. "Bayesian taut splines for estimating the number of modes," Computational Statistics & Data Analysis, Elsevier, vol. 196(C).
    7. Elisangela Martins de Sá & Ivan Contreras & Jean-François Cordeau & Ricardo Saraiva de Camargo & Gilberto de Miranda, 2015. "The Hub Line Location Problem," Transportation Science, INFORMS, vol. 49(3), pages 500-518, August.
    8. Chunyi Wang & Fengzhang Luo & Zheng Jiao & Xiaolei Zhang & Zhipeng Lu & Yanshuo Wang & Ren Zhao & Yang Yang, 2022. "An Enhanced Second-Order Cone Programming-Based Evaluation Method on Maximum Hosting Capacity of Solar Energy in Distribution Systems with Integrated Energy," Energies, MDPI, vol. 15(23), pages 1-19, November.
    9. Kayse Lee Maass & Vera Mann Hey Lo & Anna Weiss & Mark S. Daskin, 2015. "Maximizing Diversity in the Engineering Global Leadership Cultural Families," Interfaces, INFORMS, vol. 45(4), pages 293-304, August.
    10. Bester Tawona Mudereri & Elfatih M. Abdel-Rahman & Shepard Ndlela & Louisa Delfin Mutsa Makumbe & Christabel Chiedza Nyanga & Henri E. Z. Tonnang & Samira A. Mohamed, 2022. "Integrating the Strength of Multi-Date Sentinel-1 and -2 Datasets for Detecting Mango ( Mangifera indica L.) Orchards in a Semi-Arid Environment in Zimbabwe," Sustainability, MDPI, vol. 14(10), pages 1-23, May.
    11. Kai Zhou & Mustafa R. Kılınç & Xi Chen & Nikolaos V. Sahinidis, 2018. "An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver," Journal of Global Optimization, Springer, vol. 70(3), pages 497-516, March.
    12. Nosi, Costanza & D’Agostino, Antonella & Pratesi, Carlo Alberto & Barbarossa, Camilla, 2021. "Evaluating a social marketing campaign on healthy nutrition and lifestyle among primary-school children: A mixed-method research design," Evaluation and Program Planning, Elsevier, vol. 89(C).
    13. Gabriel Frahm, 2018. "An Intersection–Union Test for the Sharpe Ratio," Risks, MDPI, vol. 6(2), pages 1-13, April.
    14. John E. Core, 2010. "Discussion of Chief Executive Officer Equity Incentives and Accounting Irregularities," Journal of Accounting Research, Wiley Blackwell, vol. 48(2), pages 273-287, May.
    15. Wei Xia & Juan C. Vera & Luis F. Zuluaga, 2020. "Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 40-56, January.
    16. Liang Chen & Wei-Kun Chen & Mu-Ming Yang & Yu-Hong Dai, 2021. "An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron," Journal of Global Optimization, Springer, vol. 81(3), pages 659-689, November.
    17. Yanchao Liu, 2019. "A Progressive Motion-Planning Algorithm and Traffic Flow Analysis for High-Density 2D Traffic," Transportation Science, INFORMS, vol. 53(6), pages 1501-1525, November.
    18. Preety Srivastava & Xueyan Zhao, 2010. "What Do the Bingers Drink? Micro‐Unit Evidence on Negative Externalities and Drinker Characteristics of Alcohol Consumption by Beverage Types," Economic Papers, The Economic Society of Australia, vol. 29(2), pages 229-250, June.
    19. Hanousek Jan & Kočenda Evžen & Novotný Jan, 2012. "The identification of price jumps," Monte Carlo Methods and Applications, De Gruyter, vol. 18(1), pages 53-77, January.
    20. Monnery, Benjamin & Wolff, François-Charles & Henneguelle, Anaïs, 2020. "Prison, semi-liberty and recidivism: Bounding causal effects in a survival model," International Review of Law and Economics, Elsevier, vol. 61(C).

    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:jglopt:v:70:y:2018:i:1:d:10.1007_s10898-017-0600-3. 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.