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

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

[1]  Arjang A. Assad,et al.  MODELS FOR RAIL TRANSPORTATION , 1980 .

[2]  Anna Nagurney,et al.  The formulation and solution of large-scale multicommodity equilibrium problems over space and time , 1989 .

[3]  Bala Shetty.  Reoptimization procedures for networks with side constraints , 1991 .

[4]  Teodor Gabriel Crainic,et al.  Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem , 1986 .

[5]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[6]  Ali E. Haghani,et al.  Formulation and solution of a combined train routing and makeup, and empty car distribution model , 1989 .

[7]  Gunar E. Liepins,et al.  Genetic algorithms: Foundations and applications , 1990 .

[8]  Jean-Marc Rousseau,et al.  A Tactical Planning Model for Rail Freight Transportation , 1984, Transp. Sci..

[9]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[10]  Stephanie Forrest,et al.  Proceedings of the 5th International Conference on Genetic Algorithms , 1993 .

[11]  Bala Shetty,et al.  A relaxation/decomposition algorithm for the fixed charged network problem , 1990 .

[12]  M H Keaton.  THE IMPACT OF TRAIN TIMETABLES ON AVERAGE CAR TIME IN RAIL CLASSIFICATION YARDS , 1991 .

[13]  Bennett L. Fox,et al.  Integrating and accelerating tabu search, simulated annealing, and genetic algorithms , 1993, Ann. Oper. Res..

[14]  Teodor Gabriel Crainic.  RAIL TACTICAL PLANNING: ISSUES, MODELS AND TOOLS , 1988 .

[15]  Arjang A. Assad,et al.  Modelling of rail networks: Toward a routing/makeup model , 1980 .

[16]  Michel A. Thomet.  A User-Oriented Freight Railroad Operating Policy , 1971, IEEE Trans. Syst. Man Cybern..

[17]  Mark H. Keaton,et al.  Designing optimal railroad operating plans: Lagrangian relaxation and heuristic approaches , 1989 .

[18]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[19]  Arjang A. Assad,et al.  Multicommodity network flows - A survey , 1978, Networks.

[20]  Cynthia Barnhart,et al.  A Network-Based Primal-Dual Heuristic for the Solution of Multicommodity Network Flow Problems , 1993, Transp. Sci..

[21]  Kck Chih,et al.  THE INTERMODAL EQUIPMENT DISTRIBUTION MODEL , 1987 .

[22]  Fred Glover,et al.  Tabu Search: A Tutorial , 1990 .

[23]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[24]  B. R. Fox,et al.  Genetic Operators for Sequencing Problems , 1990, FOGA.

[25]  Lawrence Bodin,et al.  A model for the blocking of trains , 1980 .

[26]  Mark H. Keaton,et al.  Designing Railroad Operating Plans: A Dual Adjustment Method for Implementing Lagrangian Relaxation , 1992, Transp. Sci..

[27]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[28]  Mark H. Keaton.  Service-cost tradeoffs for carload freight traffic in the U.S. rail industry , 1991 .

[29]  Fred Glover,et al.  Artificial intelligence, heuristic frameworks and tabu search , 1990 .

[30]  Arjang A. Assad.  A Class of Train-Scheduling Problems , 1982 .

[31]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..