IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v50y2016i2p541-558.html
   My bibliography  Save this article

The Multicommodity-Ring Location Routing Problem

Author

Listed:
  • Paolo Gianessi

    (Laboratoire d’Informatique de Paris Nord, CNRS (UMR7030), Université Paris 13, Sorbonne Paris Cité, 93430 Villetaneuse, France)

  • Laurent Alfandari

    (ESSEC Business School, 95021 Cergy Pontoise, France)

  • Lucas Létocart

    (Laboratoire d’Informatique de Paris Nord, CNRS (UMR7030), Université Paris 13, Sorbonne Paris Cité, 93430 Villetaneuse, France)

  • Roberto Wolfler Calvo

    (Laboratoire d’Informatique de Paris Nord, CNRS (UMR7030), Université Paris 13, Sorbonne Paris Cité, 93430 Villetaneuse, France)

Abstract

The multicommodity-ring location routing problem (MRLRP) studied in this paper is an NP-hard minimization problem arising in city logistics. The aim is to locate a set of urban distribution centers (UDCs) and to connect them via a ring in which massive flows of goods will circulate. Goods are transported from gates located outside the city to a UDC, and either join a second UDC through the ring before being delivered in electric vans to the final customers or are delivered directly to the customers from the first UDC. The reverse trip with pickup and transportation to the gates is also possible. A delivery service path starts at a particular UDC, then visits a subset of customers and ends at the same UDC, another UDC, or a self-service parking lot (SPL). A pickup route can start from an SPL or a UDC and ends at a UDC. The objective is to minimize the sum of the installation costs of the ring, flow transportation costs, and routing costs. The MRLRP belongs to the class of location-routing problems (LRP). We model it with a set-partitioning-like representation of delivery and pickup trips and arc-flow elements to describe goods transportation in the ring and between the ring and the gates. We present three approaches to solving the MRLRP: an exact method for small-size instances, a matheuristic for instances of a larger size, and a hybrid approach that applies the exact method to the columns output by the matheuristic. Numerical results are provided for an exhaustive set of instances, obtained by extending benchmark instances of the capacitated LRP with additional MRLRP features.

Suggested Citation

  • Paolo Gianessi & Laurent Alfandari & Lucas Létocart & Roberto Wolfler Calvo, 2016. "The Multicommodity-Ring Location Routing Problem," Transportation Science, INFORMS, vol. 50(2), pages 541-558, May.
    • Handle: RePEc:inm:ortrsc:v:50:y:2016:i:2:p:541-558
    DOI: 10.1287/trsc.2015.0600
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2015.0600
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2015.0600?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Barreto, Sergio & Ferreira, Carlos & Paixao, Jose & Santos, Beatriz Sousa, 2007. "Using clustering analysis in a capacitated location-routing problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 968-977, June.
    2. Nagy, Gabor & Salhi, Said, 2007. "Location-routing: Issues, models and methods," European Journal of Operational Research, Elsevier, vol. 177(2), pages 649-672, March.
    3. Laporte, Gilbert & Nobert, Yves, 1981. "An exact algorithm for minimizing routing and operating costs in depot location," European Journal of Operational Research, Elsevier, vol. 6(2), pages 224-226, February.
    4. Karaoglan, Ismail & Altiparmak, Fulya & Kara, Imdat & Dengiz, Berna, 2012. "The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach," Omega, Elsevier, vol. 40(4), pages 465-477.
    5. Mina, Hokey & Jayaraman, Vaidyanathan & Srivastava, Rajesh, 1998. "Combined location-routing problems: A synthesis and future research directions," European Journal of Operational Research, Elsevier, vol. 108(1), pages 1-15, July.
    6. Guerrero, W.J. & Prodhon, C. & Velasco, N. & Amaya, C.A., 2013. "Hybrid heuristic for the inventory location-routing problem with deterministic demand," International Journal of Production Economics, Elsevier, vol. 146(1), pages 359-370.
    7. S. Lin & B. W. Kernighan, 1973. "An Effective Heuristic Algorithm for the Traveling-Salesman Problem," Operations Research, INFORMS, vol. 21(2), pages 498-516, April.
    8. Matteo Fischetti & Juan José Salazar González & Paolo Toth, 1997. "A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem," Operations Research, INFORMS, vol. 45(3), pages 378-394, June.
    9. Christian Prins & Caroline Prodhon & Angel Ruiz & Patrick Soriano & Roberto Wolfler Calvo, 2007. "Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic," Transportation Science, INFORMS, vol. 41(4), pages 470-483, November.
    10. Aksen, Deniz & Altinkemer, Kemal, 2008. "A location-routing problem for the conversion to the "click-and-mortar" retailing: The static case," European Journal of Operational Research, Elsevier, vol. 186(2), pages 554-575, April.
    11. Letchford, Adam N. & Nasiri, Saeideh D. & Theis, Dirk Oliver, 2013. "Compact formulations of the Steiner Traveling Salesman Problem and related problems," European Journal of Operational Research, Elsevier, vol. 228(1), pages 83-92.
    12. Roberto Baldacci & Aristide Mingozzi & Roberto Wolfler Calvo, 2011. "An Exact Method for the Capacitated Location-Routing Problem," Operations Research, INFORMS, vol. 59(5), pages 1284-1296, October.
    13. Rosemary T. Berger & Collette R. Coullard & Mark S. Daskin, 2007. "Location-Routing Problems with Distance Constraints," Transportation Science, INFORMS, vol. 41(1), pages 29-43, February.
    14. G. Nagy & S. Salhi, 1998. "The many-to-many location-routing problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 6(2), pages 261-275, December.
    15. Prodhon, Caroline & Prins, Christian, 2014. "A survey of recent research on location-routing problems," European Journal of Operational Research, Elsevier, vol. 238(1), pages 1-17.
    16. Jenn-Rong Lin & Hsien-Chung Lei, 2009. "Distribution systems design with two-level routing considerations," Annals of Operations Research, Springer, vol. 172(1), pages 329-347, November.
    17. Tuzun, Dilek & Burke, Laura I., 1999. "A two-phase tabu search approach to the location routing problem," European Journal of Operational Research, Elsevier, vol. 116(1), pages 87-99, July.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Delle Donne, Diego & Alfandari, Laurent & Archetti, Claudia & Ljubić, Ivana, 2023. "Freight-on-Transit for urban last-mile deliveries: A strategic planning approach," Transportation Research Part B: Methodological, Elsevier, vol. 169(C), pages 53-81.
    2. Faugère, Louis & Klibi, Walid & White, Chelsea & Montreuil, Benoit, 2022. "Dynamic pooled capacity deployment for urban parcel logistics," European Journal of Operational Research, Elsevier, vol. 303(2), pages 650-667.
    3. Fontaine, Pirmin & Crainic, Teodor Gabriel & Jabali, Ola & Rei, Walter, 2021. "Scheduled service network design with resource management for two-tier multimodal city logistics," European Journal of Operational Research, Elsevier, vol. 294(2), pages 558-570.
    4. Kafle, Nabin & Zou, Bo & Lin, Jane, 2017. "Design and modeling of a crowdsource-enabled system for urban parcel relay and delivery," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 62-82.

    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. Prodhon, Caroline & Prins, Christian, 2014. "A survey of recent research on location-routing problems," European Journal of Operational Research, Elsevier, vol. 238(1), pages 1-17.
    2. Drexl, Michael & Schneider, Michael, 2015. "A survey of variants and extensions of the location-routing problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 283-308.
    3. Yanwei Zhao & Longlong Leng & Chunmiao Zhang, 2021. "A novel framework of hyper-heuristic approach and its application in location-routing problem with simultaneous pickup and delivery," Operational Research, Springer, vol. 21(2), pages 1299-1332, June.
    4. Michael Schneider & Michael Drexl, 2017. "A survey of the standard location-routing problem," Annals of Operations Research, Springer, vol. 259(1), pages 389-414, December.
    5. Nasrin Asgari & Mohsen Rajabi & Masoumeh Jamshidi & Maryam Khatami & Reza Zanjirani Farahani, 2017. "A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study," Annals of Operations Research, Springer, vol. 250(2), pages 279-308, March.
    6. Menezes, Mozart B.C. & Ruiz-Hernández, Diego & Verter, Vedat, 2016. "A rough-cut approach for evaluating location-routing decisions via approximation algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 87(C), pages 89-106.
    7. Rieck, Julia & Ehrenberg, Carsten & Zimmermann, Jürgen, 2014. "Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery," European Journal of Operational Research, Elsevier, vol. 236(3), pages 863-878.
    8. Sahar Validi & Arijit Bhattacharya & P. J. Byrne, 2020. "Sustainable distribution system design: a two-phase DoE-guided meta-heuristic solution approach for a three-echelon bi-objective AHP-integrated location-routing model," Annals of Operations Research, Springer, vol. 290(1), pages 191-222, July.
    9. Alvarez, Jose A. Lopez & Buijs, Paul & Deluster, Rogier & Coelho, Leandro C. & Ursavas, Evrim, 2020. "Strategic and operational decision-making in expanding supply chains for LNG as a fuel," Omega, Elsevier, vol. 97(C).
    10. Bagheri Hosseini, Mozhde & Dehghanian, Farzad & Salari, Majid, 2019. "Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network," European Journal of Operational Research, Elsevier, vol. 272(2), pages 655-673.
    11. Drexl, M. & Schneider, M., 2014. "A Survey of the Standard Location-Routing Problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 65940, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    12. Daniel Negrotto & Irene Loiseau, 2021. "A Branch & Cut algorithm for the prize-collecting capacitated location routing problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 34-57, April.
    13. Younes Rahmani & Wahiba Ramdane Cherif-Khettaf & Ammar Oulamara, 2016. "The two-echelon multi-products location-routing problem with pickup and delivery: formulation and heuristic approaches," International Journal of Production Research, Taylor & Francis Journals, vol. 54(4), pages 999-1019, February.
    14. Nadizadeh, Ali & Hosseini Nasab, Hasan, 2014. "Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm," European Journal of Operational Research, Elsevier, vol. 238(2), pages 458-470.
    15. Ponboon, Sattrawut & Qureshi, Ali Gul & Taniguchi, Eiichi, 2016. "Branch-and-price algorithm for the location-routing problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 86(C), pages 1-19.
    16. Karaoglan, Ismail & Altiparmak, Fulya & Kara, Imdat & Dengiz, Berna, 2011. "A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery," European Journal of Operational Research, Elsevier, vol. 211(2), pages 318-332, June.
    17. Amin Aghalari & Darweesh Ehssan Salamah & Carlos Marino & Mohammad Marufuzzaman, 2023. "Electric vehicles fast charger location-routing problem under ambient temperature," Annals of Operations Research, Springer, vol. 324(1), pages 721-759, May.
    18. Janjevic, Milena & Merchán, Daniel & Winkenbach, Matthias, 2021. "Designing multi-tier, multi-service-level, and multi-modal last-mile distribution networks for omni-channel operations," European Journal of Operational Research, Elsevier, vol. 294(3), pages 1059-1077.
    19. Michael Schneider & Maximilian Löffler, 2019. "Large Composite Neighborhoods for the Capacitated Location-Routing Problem," Service Science, INFORMS, vol. 53(1), pages 301-318, February.
    20. Karaoglan, Ismail & Altiparmak, Fulya & Kara, Imdat & Dengiz, Berna, 2012. "The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach," Omega, Elsevier, vol. 40(4), pages 465-477.

    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:inm:ortrsc:v:50:y:2016:i:2:p:541-558. 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.

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

    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.