An application of genetic and tabu searches to the freight railroad operating plan problem

Michael Francis Gorman

Annals of Operations Research, 1998, vol. 78, issue 0, 69 pages

Abstract: This paper addresses the joint train-scheduling and demand-flow problem for a major US freight railroad. No efficient optimization techniques are known to solve the NP-hard combinatorial optimization problem. Genetic search is used to find acceptable solutions; however, its performance is found to deteriorate as the problem size grows. A "tabu-enhanced" genetic search algorithm is proposed to improve the genetic search performance. The searches are applied to test problems with known optima to gauge them for solution speed and nearness to optimality. The tabu-enhanced genetic search is found to take on average only 6% of the iterations required by genetic search, consistently achieves better approximations to the optimum and maintains its performance as the problem size grows. The tabu-enhanced search is then applied to the full-scale operating plan problem. Model results reveal a potential for 4% cost savings over the current railroad operating plan coupled with a 6% reduction in late service. Copyright Kluwer Academic Publishers 1998

Date: 1998
References: Add references at CitEc
Citations: View citations in EconPapers (33)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018906301828 (text/html)
Access to full text is restricted to subscribers.

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:spr:annopr:v:78:y:1998:i:0:p:51-69:10.1023/a:1018906301828

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018906301828

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().