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

Service Network Design for Same-Day Delivery with Hub Capacity Constraints

Author

Listed:
  • Haotian Wu

    (H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332)

  • Ian Herszterg

    (H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332)

  • Martin Savelsbergh

    (H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332)

  • Yixiao Huang

    (SF Express (Group) Co., Ltd., Shenzhen 518048, China)

Abstract

We study a new service network design problem for an urban same-day delivery system in which the number of vehicles that can simultaneously load or unload at a hub is limited. Due to the presence of both time constraints for the commodities and capacity constraints at the hubs, it is no longer guaranteed that a feasible solution exists. The problem can be modeled on a time-expanded network and formulated as an integer program. To be able to solve real-world instances, we design and implement three heuristics: (1) an integer programming–based heuristic, (2) a metaheuristic, and (3) a hybrid matheuristic. An extensive computational study using real-world instances (with different geographies, market sizes, and service offerings) from one of China’s leading comprehensive express logistics service providers demonstrates the efficacy of the three heuristics.

Suggested Citation

  • Haotian Wu & Ian Herszterg & Martin Savelsbergh & Yixiao Huang, 2023. "Service Network Design for Same-Day Delivery with Hub Capacity Constraints," Transportation Science, INFORMS, vol. 57(1), pages 273-287, January.
  • Handle: RePEc:inm:ortrsc:v:57:y:2023:i:1:p:273-287
    DOI: 10.1287/trsc.2022.1155
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2022.1155
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.2022.1155?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
    ---><---

    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:57:y:2023:i:1:p:273-287. 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: 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.