1996
DOI: 10.1016/0191-2615(95)00022-4
|View full text |Cite
|
Sign up to set email alerts
|

Optimal scheduling of trains on a single line track

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
146
0
8

Year Published

2003
2003
2016
2016

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 298 publications
(169 citation statements)
references
References 8 publications
0
146
0
8
Order By: Relevance
“…They have been formulated using operation research (OR)-based techniques including mixed integer programming 6 and network optimization models 7 . Among the solution techniques developed to solve the problems were branch and bound 8 , heuristics 9 , and lagrangian relaxation 10 . In addition, researchers have proposed some methods to solve scheduling problems as the Job-Shop problem 11 , program evaluation and review technique or PERT 12 , and satisfaction constraint 13 .…”
Section: Related Workmentioning
confidence: 99%
“…They have been formulated using operation research (OR)-based techniques including mixed integer programming 6 and network optimization models 7 . Among the solution techniques developed to solve the problems were branch and bound 8 , heuristics 9 , and lagrangian relaxation 10 . In addition, researchers have proposed some methods to solve scheduling problems as the Job-Shop problem 11 , program evaluation and review technique or PERT 12 , and satisfaction constraint 13 .…”
Section: Related Workmentioning
confidence: 99%
“…One of them is the "Alternate Double-Single Track (ADST) solution" (see Castillo et al (2009Castillo et al ( , 2011Castillo et al ( , 2015aCastillo et al ( , 2016b. However, these new solutions require on the one side the capacity and timetable optimization of planned or existing railway lines, which are very difficult and complex problems (see Carey (1994), Higgins et al (1996), Caprara et al (2002)), and on the other side a probabilistic safety analysis (see Castillo et al (2016a,c)) to guarantee the adequate safety level.…”
Section: Introductionmentioning
confidence: 99%
“…This means that travel times must be minimized and all possible conflicts among running trains must be resolved. These problems have been dealt with in the literature by many authors (see, for example, Jia and Zhang (1993), Kraay and Harker (1995), Higgins et al (1996), Sahin (1999), D'Ariano andPranzo (2004);D'Ariano et al (2007a), Carey and Lockwood (1995); Carey and Crawford (2007) or Burdett and Kozan (2010)) For a detailed and complete analysis of the timetable design principles see Pachl (2014). This paper presents the application of the ADST methodology to several lines and aims to demonstrate that alternatives to the usual double track solution exist and that they are competitive.…”
Section: Introductionmentioning
confidence: 99%
“…Several attempts have been made to use complex search procedures including look-ahead search [9], backtracking search and meta-heuristics algorithms [10,11], mixed-integer linear programming, branch and bound, tabu search (TS) [12], an enhanced local search heuristic (LSH), GA, TS, and two hybrid algorithms [13] and GA [14][15][16][17]. However, these studies have not optimized train traffic flow considering stops for track maintenance and praying.…”
Section: Introductionmentioning
confidence: 99%