IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0237014.html
   My bibliography  Save this article

A unified model framework for the multi-attribute consistent periodic vehicle routing problem

Author

Listed:
  • Maria Gulnara Baldoquin
  • Jairo A Martinez
  • Jenny Díaz-Ramírez

Abstract

Modeling real-life transportation problems usually require the simultaneous incorporation of different variants of the classical vehicle routing problem (VRP). The periodic VRP (PVRP) is a classical extension in which routes are determined for a planning period of several days and each customer has an associated set of allowable visit schedules. This work proposes a unified model framework for PVRP that consists of multiple attributes or variants not previously addressed simultaneously, such as time-windows, time-dependence, and consistency -which guarantees the visits to customer by the same vehicle-, together with three objective functions that respond to the needs of practical problems. The numerical experimentation is focused on the effects of three factors: frequency, depot centrality, and the objective function on the performance of a general–purpose MILP solver, through the analysis of the achieved relative gaps. Results show higher sensitivity to the objective functions and to the problem sizes.

Suggested Citation

  • Maria Gulnara Baldoquin & Jairo A Martinez & Jenny Díaz-Ramírez, 2020. "A unified model framework for the multi-attribute consistent periodic vehicle routing problem," PLOS ONE, Public Library of Science, vol. 15(8), pages 1-27, August.
    • Handle: RePEc:plo:pone00:0237014
    DOI: 10.1371/journal.pone.0237014
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0237014
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0237014&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0237014?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. Aderemi Oluyinka Adewumi & Olawale Joshua Adeleke, 2018. "A survey of recent advances in vehicle routing problems," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(1), pages 155-172, February.
    Full references (including those not matched with items on IDEAS)

    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. Yuxin Liu & Zihang Qin & Jin Liu, 2023. "An Improved Genetic Algorithm for the Granularity-Based Split Vehicle Routing Problem with Simultaneous Delivery and Pickup," Mathematics, MDPI, vol. 11(15), pages 1-15, July.
    2. Malika Sadou & Louiza Bouallouche-Medjkoune, 2022. "Routing protocol based ant colony optimization system for hybrid sensor and vehicular networks," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(6), pages 2855-2864, December.
    3. Bombelli, Alessandro & Fazi, Stefano, 2022. "The ground handler dock capacitated pickup and delivery problem with time windows: A collaborative framework for air cargo operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).
    4. Nadia Giuffrida & Jenny Fajardo-Calderin & Antonio D. Masegosa & Frank Werner & Margarete Steudter & Francesco Pilla, 2022. "Optimization and Machine Learning Applied to Last-Mile Logistics: A Review," Sustainability, MDPI, vol. 14(9), pages 1-16, April.
    5. Ines Sbai & Saoussen Krichen & Olfa Limam, 2022. "Two meta-heuristics for solving the capacitated vehicle routing problem: the case of the Tunisian Post Office," Operational Research, Springer, vol. 22(1), pages 507-549, March.
    6. Osicka, Ondrej & Guajardo, Mario & van Oost, Thibault, 2018. "Cooperative game-theoretic features of cost sharing in location-routing," Discussion Papers 2018/11, Norwegian School of Economics, Department of Business and Management Science.

    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:plo:pone00:0237014. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.