Transportation Science
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


TRANSPORTATION SCIENCE
Vol. 34, No. 3, August 2000, pp. 256-270
DOI: 10.1287/trsc.34.3.256.12297
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Newman, A. M.
Right arrow Articles by Yano, C. A.
Right arrow Search for Related Content

Scheduling Direct and Indirect Trains and Containers in an Intermodal Setting

Alexandra M. Newman, Candace Arai Yano

Division of Economics and Business, Colorado School of Mines, Golden, Colorado 80401
Department of Industrial Engineering and Operations Research, University of California, Berkeley, California 94720

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.

History: Received: October 1998; revised: June 1999; revised: October 1999; accepted: October 1999.




This article has been cited by other articles:


Home page
Transportation ScienceHome page
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]


Home page
Transportation ScienceHome page
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]


Home page
Transportation ScienceHome page
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
Copyright © 2000 by INFORMS.