Optimizing Train Network Routing Using Deterministic Search

In this paper, we use walk search strategy to solve the optimization problem of train routing on railway network. The proposed approach is a local search algorithm which explores the railway network by walker’s navigating through the network. Using some selection rules, walker can dynamically determine the optimal route of trains. In order to analyze and evaluate the proposed approach, we present two computational studies in which the search algorithm is tested on a part of railway network. The results demonstrate that the proposed approach is an effective tool for optimizing the train routing problem on railway network. Moreover, it can be executed with shorter computation time.

[1]  A. J. Taylor,et al.  An introduction to computer‐assisted train dispatch , 1986 .

[2]  Azim Eskandarian,et al.  ENHANCING INTELLIGENT AGENT COLLABORATION FOR FLOW OPTIMIZATION OF RAILROAD TRAFFIC , 2002 .

[3]  Michael R. Bussieck,et al.  Discrete optimization in public rail transport , 1997, Math. Program..

[4]  Rob M.P. Goverde,et al.  Non-Discriminatory Automatic Registration of Knock-On Train Delays , 2009 .

[5]  Jon M. Kleinberg,et al.  Navigation in a small world , 2000, Nature.

[6]  William H. K. Lam,et al.  A capacity restraint transit assignment with elastic line frequency , 2002 .

[7]  Patrick T. Harker,et al.  Tactical Scheduling of Rail Operations: The SCAN I System , 1991, Transp. Sci..

[8]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[9]  Michael Francis Gorman,et al.  An application of genetic and tabu searches to the freight railroad operating plan problem , 1998, Ann. Oper. Res..

[10]  David R. Martinelli,et al.  Optimization of railway operations using neural networks , 1996 .

[11]  Michael F. Gorman.  Santa Fe Railway Uses an Operating-Plan Model to Improve Its Service Design , 1998, Interfaces.

[12]  Luis M. Laita,et al.  A computer algebra approach to the design of routes and the study of their compatibility in a railway interlocking , 2002, Math. Comput. Simul..

[13]  Alexandre Arenas,et al.  Optimal network topologies for local search with congestion , 2002, Physical review letters.

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

[15]  Leo G. Kroon,et al.  Routing Trains Through Railway Stations: Model Formulation and Algorithms , 1996, Transp. Sci..

[16]  David Eppstein,et al.  Finding the k Shortest Paths , 1999, SIAM J. Comput..

[17]  Joaquin Rodriguez,et al.  A constraint programming model for real-time train scheduling at junctions , 2007 .

[18]  Lada A. Adamic,et al.  Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Ferenc Szidarovszky,et al.  A multi-objective train scheduling model and solution , 2004 .

[20]  Malachy Carey,et al.  Scheduling and Platforming Trains at Busy Complex Stations , 2003 .

[21]  Malachy Carey,et al.  A Model, Algorithms and Strategy for Train Pathing , 1995 .

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

[23]  PENGCHENG ZHANG,et al.  Dynamic Game Theoretic Model of Multi-Layer Infrastructure Networks , 2005 .

[24]  Sokolov,et al.  Relaxation properties of small-world networks , 2000, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[25]  Dennis V. Lindley,et al.  Principles of Random Walk. , 1965 .

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

[27]  Morton E. O’Kelly,et al.  Routing Traffic at Hub Facilities , 2010 .

[28]  M E J Newman,et al.  Identity and Search in Social Networks , 2002, Science.