IDEAS home Printed from https://ideas.repec.org/h/spr/lnechp/978-3-319-20430-7_11.html
   My bibliography  Save this book chapter

Integer Programming Based Approaches for Multi-Trip Location Routing

In: Computational Management Science

Author

Listed:
  • Rita Macedo

    (Université de Valenciennes)

  • Bruna Ramos

    (Universidade do Minho)

  • Cláudio Alves

    (Universidade do Minho)

  • José Valério Carvalho

    (Universidade do Minho)

  • Saïd Hanafi

    (Université de Valenciennes)

  • Nenad Mladenović

    (Université de Valenciennes)

Abstract

The multi-trip location routing problem consists in selecting the depots to open and the routes that should be performed to serve a set of clients at minimum cost. The multi-trip variant considers the possibility for a vehicle to perform more than a single route during the planning period, and hence it applies typically to cases in which the trips are performed within a small geographic area and involves for example the transportation of perishable goods. As a consequence, the inherent complexity of the problem increases as it has now to determine which routes should be assigned to the vehicles. In this paper, we explore an improved network flow formulation for this problem, and we compare it with another compact formulation proposed in the literature. We describe also an iterative rounding heuristic that relies on this model. We show through computational experiments on benchmark instances that the model provides good lower bounds, and that it can be used both by commercial solvers and heuristics to derive good quality solutions for the problem.

Suggested Citation

  • Rita Macedo & Bruna Ramos & Cláudio Alves & José Valério Carvalho & Saïd Hanafi & Nenad Mladenović, 2016. "Integer Programming Based Approaches for Multi-Trip Location Routing," Lecture Notes in Economics and Mathematical Systems, in: Raquel J. Fonseca & Gerhard-Wilhelm Weber & João Telhada (ed.), Computational Management Science, edition 1, pages 79-90, Springer.
    • Handle: RePEc:spr:lnechp:978-3-319-20430-7_11
    DOI: 10.1007/978-3-319-20430-7_11
    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:lnechp:978-3-319-20430-7_11. 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.