IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-28697-6_70.html
   My bibliography  Save this book chapter

Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem

In: Operations Research Proceedings 2014

Author

Listed:
  • Claudia Schlebusch

    (Johannes Gutenberg University Mainz)

  • Stefan Irnich

    (Johannes Gutenberg University Mainz)

Abstract

The basic multiple-vehicleSchlebusch, Claudia arc-routingIrnich, Stefan problem is called capacitated arc-routing problem (CARP) and was introduced by Golden and Wong (Networks 11:305–315, 1981 [9]). This paper presents a full-fledged branch-and-price (bap) algorithm for the CARP. In the first phase, the one-index formulation of the CARP is solved in order to produce strong cuts and an excellent lower bound. In the second phase, the master program is initialized with the strong cuts, CARP tours are iteratively generated by a pricing procedure, and branching is required to produce integer solutions. Furthermore, different pricing problem relaxations are analyzed and the construction of new labeling algorithms for their solution is presented. The cut-first branch-and-price second algorithm provides a powerful approach to solve knowingly hard instances of the CARP to proven optimality.

Suggested Citation

  • Claudia Schlebusch & Stefan Irnich, 2016. "Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem," Operations Research Proceedings, in: Marco Lübbecke & Arie Koster & Peter Letmathe & Reinhard Madlener & Britta Peis & Grit Walther (ed.), Operations Research Proceedings 2014, edition 1, pages 501-506, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-28697-6_70
    DOI: 10.1007/978-3-319-28697-6_70
    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-319-28697-6_70. 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.