2020
DOI: 10.1016/j.trc.2020.102681
|View full text |Cite
|
Sign up to set email alerts
|

Integrated optimization of train stop planning and timetabling for commuter railways with an extended adaptive large neighborhood search metaheuristic approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
9
1

Relationship

1
9

Authors

Journals

citations
Cited by 81 publications
(17 citation statements)
references
References 34 publications
0
16
0
Order By: Relevance
“…Moreover, some researchers have studied the stop planning with given train frequency, e.g., Jong et al [15], Chen et al [16], and Qi et al [17]. Some integrated optimizations of stop planning and other scheduling processes have been presented as well, e.g., Yue et al [18], Qi et al [19,20], and Dong et al [21]. In a study of timetable planning, Roberto et al [22] proposed a mixed-integer nonlinear model in order to solve the problem of variable demand cyclic railway timetable.…”
Section: Literature Review 21 Railway Train Operation Planmentioning
confidence: 99%
“…Moreover, some researchers have studied the stop planning with given train frequency, e.g., Jong et al [15], Chen et al [16], and Qi et al [17]. Some integrated optimizations of stop planning and other scheduling processes have been presented as well, e.g., Yue et al [18], Qi et al [19,20], and Dong et al [21]. In a study of timetable planning, Roberto et al [22] proposed a mixed-integer nonlinear model in order to solve the problem of variable demand cyclic railway timetable.…”
Section: Literature Review 21 Railway Train Operation Planmentioning
confidence: 99%
“…Kitjacharoenchai et al [41] developed an ADAR method that employs three destroy operators and three repair operators to solve a VRP. Dong et al [42] optimized stop plans and timetables for commuter railways with an ADAR method by employing multiple destroy and repair operators. It was found that the local search-based strategy is easy to integrate with other algorithms to effectively find the optimal solution [43][44][45].…”
Section: Solution Algorithmmentioning
confidence: 99%
“…Shang et al [42] took the advantage of the stop-skipping operation mode in an oversaturated urban rail system, in order to eliminate the possible inequity that passengers waiting at different station may receive varying shares of train capacity under all-stop mode. An integrated combination optimization model was developed in [43] to optimize train stop plans and timetables under time-dependent passenger demand with the aim of improving travel efficiency mainly consisting of the total waiting time, the delay time due to a stop, and the total train running time. To deal with demand uncertainty in planning train stop serval months before operation, Cacchiani et al [44] proposed mixed integer linear programming models which can deliver robust solutions by inserting a desired protection level in a number of ways, so as to reduce the passenger inconvenience that may occur due to increased travel demand.…”
Section: Literature Reviewmentioning
confidence: 99%