IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-030-18500-8_64.html
   My bibliography  Save this book chapter

Adaptive Algorithmic Behavior for Solving Mixed Integer Programs Using Bandit Algorithms

In: Operations Research Proceedings 2018

Author

Listed:
  • Gregor Hendel

    (Zuse Institute Berlin)

  • Matthias Miltenberger

    (Zuse Institute Berlin)

  • Jakob Witzig

    (Zuse Institute Berlin)

Abstract

State-of-the-art solvers for mixed integer programs (MIP) govern a variety of algorithmic components. Ideally, the solver adaptively learns to concentrate its computational budget on those components that perform well on a particular problem, especially if they are time consuming. We focus on three such algorithms, namely the classes of large neighborhood search and diving heuristics as well as Simplex pricing strategies. For each class we propose a selection strategy that is updated based on the observed runtime behavior, aiming to ultimately select only the best algorithms for a given instance. We review several common strategies for such a selection scenario under uncertainty, also known as Multi Armed Bandit Problem. In order to apply those bandit strategies, we carefully design reward functions to rank and compare each individual heuristic or pricing algorithm within its respective class. Finally, we discuss the computational benefits of using the proposed adaptive selection within the SCIP Optimization Suite on publicly available MIP instances.

Suggested Citation

  • Gregor Hendel & Matthias Miltenberger & Jakob Witzig, 2019. "Adaptive Algorithmic Behavior for Solving Mixed Integer Programs Using Bandit Algorithms," Operations Research Proceedings, in: Bernard Fortz & Martine LabbĂ© (ed.), Operations Research Proceedings 2018, pages 513-519, Springer.
    • Handle: RePEc:spr:oprchp:978-3-030-18500-8_64
    DOI: 10.1007/978-3-030-18500-8_64
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:oprchp:978-3-030-18500-8_64. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.