|
|
||||||||
Division of Economics and Business, Colorado School of Mines, Golden, Colorado 80401
The focus of our research is on rail transportation of intermodal containers. We address the problem of determining day-of-week schedules for both direct and indirect (via a hub) trains and allocating containers to these trains for the rail (linehaul) portion of the intermodal trip. The goal is to minimize operating costs, including a fixed charge for each train, variable transportation and handling costs for each container and yard storage costs, while meeting on-time delivery requirements. We formulate the problem as an integer program and develop a novel decomposition procedure to find near-optimal solutions. We also develop a method to provide relatively tight bounds on the objective function values. Finally, we compare our solutions to those obtained with heuristics designed to mimic current operations, and show that a savings of between 5 and 20% can be gained from using our solution procedure.
Department of Industrial Engineering and Operations Research, University of California, Berkeley, California 94720
This article has been cited by other articles:
![]() |
A. Cohn, S. Root, A. Wang, and D. Mohr Integration of the Load-Matching and Routing Problem with Equipment Balancing for Small Package Carriers Transportation Science, May 1, 2007; 41(2): 238 - 252. [Abstract] [PDF] |
||||
![]() |
L. Li and S. Tayur Medium-Term Pricing and Operations Planning in Intermodal Transportation Transportation Science, February 1, 2005; 39(1): 73 - 86. [Abstract] [PDF] |
||||
![]() |
O. Alp, N. K. Erkip, and R. Gullu Outsourcing Logistics: Designing Transportation Contracts Between a Manufacturer and a Transporter Transportation Science, February 1, 2003; 37(1): 23 - 39. [Abstract] [PDF] |
||||
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |