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

Capacitated hub location routing problem with time windows and stochastic demands for the design of intra-city express systems

Author

Listed:
  • Wu, Yuehui
  • Fang, Hui
  • Qureshi, Ali Gul
  • Yamada, Tadashi

Abstract

This work focuses on planning an intra-city express system in a practical environment. Various operation characteristics, such as vehicle capacity, hub capacity, time windows, and stochastic demands, have been considered. Therefore, we introduce a capacitated hub location routing problem with time windows and stochastic demand and formulate it using a multi-stage recourse model. In this model, long-term decisions (hub location and client-to-hub allocation) are made first, and short-term decisions (vehicle routing) are determined after revealing stochastic variables. To solve the problem, we propose a hybrid stochastic variable neighbourhood search (HSVNS) algorithm, which integrates an adaptive large neighbourhood search (ALNS) algorithm within a stochastic variable neighbourhood search (SVNS) framework. Numerical experiments and case studies indicate that the HSVNS algorithm can provide high-quality solutions within a reasonable computation time for instances with up to 70 clients and that considering stochastic factors can efficiently reduce operation costs, especially for instances with tight vehicle capacity and loose time windows.

Suggested Citation

  • Wu, Yuehui & Fang, Hui & Qureshi, Ali Gul & Yamada, Tadashi, 2025. "Capacitated hub location routing problem with time windows and stochastic demands for the design of intra-city express systems," European Journal of Operational Research, Elsevier, vol. 326(2), pages 255-269.
  • Handle: RePEc:eee:ejores:v:326:y:2025:i:2:p:255-269
    DOI: 10.1016/j.ejor.2025.05.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221725003625
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2025.05.006?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:eee:ejores:v:326:y:2025:i:2:p:255-269. 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.