scheduled service network design
Recently Published Documents


TOTAL DOCUMENTS

10
(FIVE YEARS 7)

H-INDEX

3
(FIVE YEARS 2)

Author(s):  
Mike Hewitt

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.


2021 ◽  
Vol 157 ◽  
pp. 107253
Author(s):  
Jian Li ◽  
Liyan Jia ◽  
Tingting Li ◽  
Xiucui Guan ◽  
Haoxiang Wang ◽  
...  

2021 ◽  
Vol 288 (1) ◽  
pp. 30-46 ◽  
Author(s):  
Giacomo Lanza ◽  
Teodor Gabriel Crainic ◽  
Walter Rei ◽  
Nicoletta Ricciardi

2017 ◽  
Vol 7 (3) ◽  
pp. 277-309 ◽  
Author(s):  
Teodor Gabriel Crainic ◽  
Mike Hewitt ◽  
Michel Toulouse ◽  
Duc Minh Vu

2014 ◽  
Vol 62 (2) ◽  
pp. 383-400 ◽  
Author(s):  
Endong Zhu ◽  
Teodor Gabriel Crainic ◽  
Michel Gendreau

Sign in / Sign up

Export Citation Format

Share Document