IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v316y2024i3p942-957.html
   My bibliography  Save this article

Recourse strategy for the routing problem of mobile parcel lockers with time windows under uncertain demands

Author

Listed:
  • Wang, Yang
  • Bi, Mengyu
  • Lai, Jianhui
  • Wang, Chenxi
  • Chen, Yanyan
  • Holguín-Veras, José

Abstract

It is expected that mobile parcel lockers (MPLs) will provide more responsive and flexible service to the increasing variation of demand than fixed parcel lockers. However, the service provided by MPLs following planned routes can be degraded and even fail due to the demand uncertainty, such as demand volume and pickup time. In this study, we propose an optimization approach integrated with the recourse strategies to overcome this barrier. Three types of uncertain demands and two types of service failures are addressed in this study, with consideration of uncertain demands and time window constraint. To optimally determine the a priori routes for a set of MPLs, we propose a tailored tabu search algorithm by taking into account the recourse cost. A series of numerical experiments were conducted to examine the effectiveness of the proposed approach in enhancing route reliability with a comparison to ordinary express vehicles. The results reveal that the service reliability can be significantly improved with only a marginal increase in the operational cost by the proposed approach.

Suggested Citation

  • Wang, Yang & Bi, Mengyu & Lai, Jianhui & Wang, Chenxi & Chen, Yanyan & Holguín-Veras, José, 2024. "Recourse strategy for the routing problem of mobile parcel lockers with time windows under uncertain demands," European Journal of Operational Research, Elsevier, vol. 316(3), pages 942-957.
    • Handle: RePEc:eee:ejores:v:316:y:2024:i:3:p:942-957
    DOI: 10.1016/j.ejor.2024.02.034
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221724001656
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2024.02.034?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
    ---><---

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

    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:eee:ejores:v:316:y:2024:i:3:p:942-957. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.