IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v66y2015i8p1312-1323.html
   My bibliography  Save this article

A customer-centric routing problem with multiple trips of a single vehicle

Author

Listed:
  • Iris Martínez-Salazar

    (Universidad Autónoma de Nuevo León, Nuevo León, México)

  • Francisco Angel-Bello

    (Tecnológico de Monterrey, Nuevo León, México)

  • Ada Alvarez

    (Universidad Autónoma de Nuevo León, Nuevo León, México)

Abstract

In this study, we introduce a routing problem with multiple uses of a single vehicle and service time in demand points, minimizing the sum of clients’ waiting time to receive service. This problem is relevant in the distribution of aid in disaster-stricken communities, in the recollection and/or delivery of perishable goods and personnel transportation, among other situations, where reaching clients to perform service, fast and fair, is a priority. We consider vehicle capacity and travel distance constraints, forcing multiple use of the vehicle during the planning horizon. This paper presents two mixed integer formulations for this problem, based on a multi-level network, as well as a metaheuristic algorithm. The proposed models can solve to optimality instances with up to 30 clients. The proposed metaheuristic algorithm obtains high-quality solutions in short computational times.

Suggested Citation

  • Iris Martínez-Salazar & Francisco Angel-Bello & Ada Alvarez, 2015. "A customer-centric routing problem with multiple trips of a single vehicle," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(8), pages 1312-1323, August.
    • Handle: RePEc:pal:jorsoc:v:66:y:2015:i:8:p:1312-1323
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v66/n8/pdf/jors201492a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v66/n8/full/jors201492a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Maliheh Khorsi & Seyed Kamal Chaharsooghi & Ali Husseinzadeh Kashan & Ali Bozorgi-Amiri, 2022. "Solving the humanitarian multi-trip cumulative capacitated routing problem via a grouping metaheuristic algorithm," Annals of Operations Research, Springer, vol. 319(1), pages 173-210, December.
    2. Biswajit Sarkar & Muhammad Tayyab & Seok-Beom Choi, 2018. "Product Channeling in an O2O Supply Chain Management as Power Transmission in Electric Power Distribution Systems," Mathematics, MDPI, vol. 7(1), pages 1-12, December.
    3. J. Molina & A. D. López-Sánchez & A. G. Hernández-Díaz & I. Martínez-Salazar, 2018. "A Multi-start Algorithm with Intelligent Neighborhood Selection for solving multi-objective humanitarian vehicle routing problems," Journal of Heuristics, Springer, vol. 24(2), pages 111-133, April.
    4. Xiaxia Ma & Wenliang Bian & Wenchao Wei & Fei Wei, 2022. "Customer-Centric, Two-Product Split Delivery Vehicle Routing Problem under Consideration of Weighted Customer Waiting Time in Power Industry," Energies, MDPI, vol. 15(10), pages 1-23, May.
    5. Sze, Jeeu Fong & Salhi, Said & Wassan, Niaz, 2017. "The cumulative capacitated vehicle routing problem with min-sum and min-max objectives: An effective hybridisation of adaptive variable neighbourhood search and large neighbourhood search," Transportation Research Part B: Methodological, Elsevier, vol. 101(C), pages 162-184.

    More about this item

    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:pal:jorsoc:v:66:y:2015:i:8:p:1312-1323. 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.palgrave-journals.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.