New formulations for the Scheduled Service Network Design Problem

Mike Hewitt and Fabien Lehuédé

Transportation Research Part B: Methodological, 2023, vol. 172, issue C, 117-133

Abstract: We propose a new approach to formulating the Scheduled Service Network Design Problem (SSNDP) that involves modeling with enumerated consolidations of shipments routed on the physical network. This is in contrast to the classical approach of capturing the synchronization of vehicles and shipments needed for consolidation with a time-expanded network. The proposed formulation has both a stronger linear relaxation and is less symmetric. We present multiple speed-up techniques and with an extensive computational study illustrate that the consolidation-based formulation is much easier to solve with an off-the-shelf solver than the classical formulation based on a time-expanded network.

Keywords: Freight transportation; Scheduled Service Network Design Problem; Integer programming (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0191261523000668
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:transb:v:172:y:2023:i:c:p:117-133

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.trb.2023.04.002

Access Statistics for this article

Transportation Research Part B: Methodological is currently edited by Fred Mannering

More articles in Transportation Research Part B: Methodological from Elsevier
Bibliographic data for series maintained by Catherine Liu ().