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

The Flexible Scheduled Service Network Design Problem

Author

Listed:
  • Mike Hewitt

    (Department of Information Systems and Supply Chain Management, Quinlan School of Business, Loyola University, Chicago, Illinois 60611)

Abstract

The scheduled service network design problem (SSNDP) can support planning the transportation operations of consolidation carriers given shipment-level service commitments regarding available and due times. These available and due times impact transportation costs by constraining potential consolidation opportunities. However, such available and due times may be changed, either because of negotiations with customers or redesigned internal operations to increase shipment consolidation and reduce transportation costs. As changing these times can lead to customer service and operational issues, we presume a carrier seeks to do so for a limited number of shipments. We propose a new variant of the SSNDP, the flexible scheduled service network design problem, that identifies the shipments for which these times should be changed to minimize total transportation and handling costs. We present a solution approach for this problem that outperforms a commercial optimization solver on instances derived from the operations of a U.S. less-than-truckload freight transportation carrier. With an extensive computational study, we study the savings potential of leveraging flexibility and the operational settings that are fertile ground for doing so.

Suggested Citation

  • Mike Hewitt, 2022. "The Flexible Scheduled Service Network Design Problem," Transportation Science, INFORMS, vol. 56(4), pages 1000-1021, July.
    • Handle: RePEc:inm:ortrsc:v:56:y:2022:i:4:p:1000-1021
    DOI: 10.1287/trsc.2021.1114
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2021.1114
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2021.1114?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:56:y:2022:i:4:p:1000-1021. 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.