Optimizing transportation by inventory routing and workload balancing: Optimizing daily dray operations across an intermodal freight network

Interfaces

Volumn 44, Issue 6, 2014, Pages 579-590

  Sun, Xiaoqing ^a   Garg, Manish ^a   Balaporia, Zahir ^a   Bailey, Kendall ^a   Gifford, Ted ^a  

^a Schneider National Inc   (United States)

Author keywords

Algorithms; Benders decomposition; Column generation; Computer science; Deterministic sequencing; Integer programming; Networks graphs; Production scheduling; Transportation shipping; Tree algorithms

Indexed keywords

EID: 84915806314     PISSN: 00922102     EISSN: 1526551X     Source Type: Journal    
DOI: 10.1287/inte.2014.0746     Document Type: Review

References (8)

1. Baldacci R, Bartolini E, Mingozzi A (2011) An exact algorithm for the pickup and delivery problem with time windows. Oper. Res. 59(2):414-426.
2. Caris AN, Macharis C, Janssens GK (2008) Planning problems in intermodal freight transport: Accomplishments and prospects. Transportation Planning Tech. 31(3):277-302.
3. Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40(2):342-354.
4. Erera AL, Smilowitz KR (2008) Intermodal drayage routing and scheduling. Ioannou PA, ed. Intelligent Freight Transportation (CRC Press, Boca Raton, FL), 171-188.
5. Erera AL, Morales JC, Savelsbergh M (2009) Robust optimization for empty repositioning problems. Oper. Res. 57(2):468-483.
6. Ileri Y, Bazaraa M, Gifford T, Nemhauser G, Sokol J, Wikum E (2006) An optimization approach for planning daily drayage operations. Central Eur. J. Oper. Res. 14(2):141-156.
7. Namboothiri R, Erera AL (2008) Planning local container drayage operations given a port access appointment system. Transportation Res. Part E 44(2):185-202.
8. Savelsbergh M, Sol M (1998) Drive: Dynamic routing of independent vehicles. Oper. Res. 46(4):474-490.