IDEAS home Printed from https://ideas.repec.org/p/ant/wpaper/2014020.html
   My bibliography  Save this paper

Generalized local branching heuristics and the capacitated ring tree problem

Author

Listed:
  • HILL, Alessandro
  • VOß, Stefan

Abstract

In this paper we present a heuristic framework that is based on mathematical programming to solve network design problems. Our techniques combine local branching with locally exact refinements. In an iterative strategy an existing solution is refined by solving restricted mixed integer programs (MIPs) to optimality. These are obtained from the master problem MIP by (1) fixing a subset of binary variables and (2) limiting the number of variable flips among the unfixed variables. We introduce generalized local branching cuts which enforce (1) and (2). Using these concepts we develop an efficient algorithm for the capacitated ring tree problem (CRTP), a recent network design model for reliable capacitated networks that combines cycle and tree structures. Our implementation operates on top of an efficient branch & cut algorithm for the CRTP. The sets of refinement variables are deduced from single and multi-ball CRTP-tailored network node clusters. We provide computational results using a set of literature instances. We show that the approach is capable of improving existing best results for the CRTP when integrated into a multi-start local search heuristic, but is also efficient when used independently.

Suggested Citation

  • HILL, Alessandro & VOß, Stefan, 2014. "Generalized local branching heuristics and the capacitated ring tree problem," Working Papers 2014020, University of Antwerp, Faculty of Business and Economics.
  • Handle: RePEc:ant:wpaper:2014020
    as

    Download full text from publisher

    File URL: https://repository.uantwerpen.be/docman/irua/e2cabc/145281.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. HILL, Alessandro & VOß, Stefan, 2014. "Optimal capacitated ring trees," Working Papers 2014012, University of Antwerp, Faculty of Business and Economics.
    2. HILL, Alessandro, 2014. "Multi-exchange neighborhoods for the capacitated ring tree problem," Working Papers 2014011, University of Antwerp, Faculty of Business and Economics.
    3. HILL, Alessandro & VOß, Stefan, 2014. "An equi-model matheuristic for the multi-depot ring star problem," Working Papers 2014015, University of Antwerp, Faculty of Business and Economics.
    Full references (including those not matched with items on IDEAS)

    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. HILL, Alessandro, 2014. "Multi-exchange neighborhoods for the capacitated ring tree problem," Working Papers 2014011, University of Antwerp, Faculty of Business and Economics.
    2. HILL, Alessandro & VOß, Stefan, 2014. "Optimal capacitated ring trees," Working Papers 2014012, University of Antwerp, Faculty of Business and Economics.
    3. Kaarthik Sundar & Sivakumar Rathinam, 2017. "Multiple depot ring star problem: a polyhedral study and an exact algorithm," Journal of Global Optimization, Springer, vol. 67(3), pages 527-551, March.

    More about this item

    Keywords

    Capacitated ring tree problem; Local branching; Mathematical programming; Local search; Network design; Matheuristic;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:ant:wpaper:2014020. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: . General contact details of provider: https://edirc.repec.org/data/ftufsbe.html .

    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: Joeri Nys (email available below). General contact details of provider: https://edirc.repec.org/data/ftufsbe.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.