IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-662-43871-8_58.html
   My bibliography  Save this book chapter

Solving a Variant of the Hub Location-Routing Problem

In: Liss 2014

Author

Listed:
  • Mauro Cardoso Lopes

    (IC/UNICAMP)

  • Thiago Alves de Queiroz

    (UFG-Campus Catalão)

  • Carlos Eduardo de Andrade

    (IC/UNICAMP)

  • FlávioKeidi Miyazawa

    (IC/UNICAMP)

Abstract

We investigate a variant of the many-to-many (hub) location-routing problem, which consists in partitioning the set of vertices of a graph into cycles containing exactly one hub each, and determining an extra cycle interconnecting all hubs. A local search heuristic that considers add/remove and swap operations is developed.Also, a branch-and-cut approach that solves an integer formulation is investigated.Computational experiments on several instances adapted from literature show that our algorithms are good to deal with small to medium-sized instances.

Suggested Citation

  • Mauro Cardoso Lopes & Thiago Alves de Queiroz & Carlos Eduardo de Andrade & FlávioKeidi Miyazawa, 2015. "Solving a Variant of the Hub Location-Routing Problem," Springer Books, in: Zhenji Zhang & Zuojun Max Shen & Juliang Zhang & Runtong Zhang (ed.), Liss 2014, edition 127, pages 395-400, Springer.
    • Handle: RePEc:spr:sprchp:978-3-662-43871-8_58
    DOI: 10.1007/978-3-662-43871-8_58
    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Venkatesh Pandiri & Alok Singh, 2021. "A simple hyper-heuristic approach for a variant of many-to-many hub location-routing problem," Journal of Heuristics, Springer, vol. 27(5), pages 791-868, October.

    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:sprchp:978-3-662-43871-8_58. 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.