Freight Routing and Scheduling at CSX Transportation

Christopher L. Huntley, Donald E. Brown, David E. Sappington and Bernard P. Markowicz
Additional contact information
David E. Sappington: The Institute for Parallel Computation and the Department of Systems Engineering, School of Engineering and Applied Science University of Virginia, Charlottesville, Virginia 22903-2442
Bernard P. Markowicz: Arthur D. Little, 955 L’Enfant Plaza, SW, Suite 4200, Washington, DC 20024-2119

Interfaces, 1995, vol. 25, issue 3, 58-71

Abstract: Two of a railroad’s fundamental tactical operations are routing shipments along its rails and scheduling trains necessary to service the routes. The computer-aided routing and scheduling system (CARS) bridges the gap between these day-to-day operations and strategic planning. By investigating low-cost routes and schedules in a controlled environment under various cost scenarios, CSX Transportation’s strategic planners can better account for these tactical operations in their long-range policies.

Keywords: programming: integer algorithms; heuristic; transportation: route selection (search for similar items in EconPapers)
Date: 1995
References: Add references at CitEc
Citations: View citations in EconPapers (14)

Downloads: (external link)
http://dx.doi.org/10.1287/inte.25.3.58 (application/pdf)

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:inm:orinte:v:25:y:1995:i:3:p:58-71

Access Statistics for this article

More articles in Interfaces from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().