Railway Timetabling Using Lagrangian Relaxation

1998 ◽  
Vol 32 (4) ◽  
pp. 358-369 ◽  
Author(s):  
U. Brännlund ◽  
P. O. Lindberg ◽  
A. Nõu ◽  
J.-E. Nilsson
Keyword(s):  
Lagrangian Relaxation ◽  
Railway Timetabling

Lagrangian Relaxation Based Inter-Layer Signal Via Assignment for 3-D ICs

2009 ◽  
Vol E92-A (4) ◽  
pp. 1080-1087 ◽  
Author(s):  
Song CHEN ◽  
Liangwei GE ◽  
Mei-Fang CHIANG ◽  
Takeshi YOSHIMURA
Keyword(s):  
Lagrangian Relaxation

Opportunistic Lagrangian Relaxation for Joint Replacement Policy

2014 ◽  
Vol 39 (3) ◽  
pp. 263-271
Author(s):  
Guo-Yu TU ◽  
Peter B LUH ◽  
Qian-Chuan ZHAO
Keyword(s):  
Lagrangian Relaxation ◽  
Joint Replacement ◽  
Replacement Policy

scholarly journals Railway timetabling: a maximum bottleneck path algorithm for finding an additional train path

2020 ◽  
Author(s):  
Fredrik Ljunggren ◽  
Kristian Persson ◽  
Anders Peterson ◽  
Christiane Schmidt
Keyword(s):  
Experimental Evaluation ◽  
Temporal Distance ◽  
Dijkstra’S Algorithm ◽  
Passenger Traffic ◽  
Dijkstra's Algorithm ◽  
Railway Timetabling

Abstract We present an algorithm to insert a train path in an existing railway timetable close to operation, when we want to affect the existing (passenger) traffic as little as possible. Thus, we consider all other trains as fixed, and aim for a resulting train path that maximizes the bottleneck robustness, that is, a train path that maximizes the temporal distance to neighboring trains in the timetable. Our algorithm is based on a graph formulation of the problem and uses a variant of Dijkstra’s algorithm. We present an extensive experimental evaluation of our algorithm for the Swedish railway stretch from Malmö to Hallsberg. Moreover, we analyze the size of our constructed graph.

Sign in / Sign up

Export Citation Format

Share Document