2021
DOI: 10.1007/s00500-021-05708-2
|View full text |Cite
|
Sign up to set email alerts
|

An efficient method of disturbance analysis and train rescheduling using MWDLNN and BMW-SSO algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
3
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(7 citation statements)
references
References 17 publications
0
3
0
Order By: Relevance
“…[27] used a random forest algorithm to predict train delays. In order to solve the train rescheduling problem, Kumar [28] used the Brownian motion weighted-based salp swarm optimization (BMW-SSO) algorithm and the modified weight-based deep learning neural network (MWDLNN) algorithm and obtained good results. These algorithms can be applied to a wide range of problem types and domains.…”
Section: Literature Reviewmentioning
confidence: 99%
See 2 more Smart Citations
“…[27] used a random forest algorithm to predict train delays. In order to solve the train rescheduling problem, Kumar [28] used the Brownian motion weighted-based salp swarm optimization (BMW-SSO) algorithm and the modified weight-based deep learning neural network (MWDLNN) algorithm and obtained good results. These algorithms can be applied to a wide range of problem types and domains.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The number of passengers in each section of the train set or standby train set cannot be more than the seating capacity after serving affected passengers, as Constraint (28) shows.…”
Section: Constraints Of Passenger Demandmentioning
confidence: 99%
See 1 more Smart Citation
“…Meng et al [19] proposed an integrated model that encompasses train rescheduling and track assignment to furnish a comprehensive plan for trains to traverse railway sections and go-through stations. Neeraj et al [20] employed a methodical approach that involves analyzing the likelihood of conflicts and disturbances and taking appropriate measures to reschedule trains during disruptions. Wang et al [21] formulated a mixed-integer programming node-arc model to solve the train routing problem for a multistation railway hub.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The quadratic differences in buffer times and in track utilization times are decreased by 30.55% and 77.82%, respectively. In the optimized track allocation plan, most of the trains' buffer times are within [20,60] (min). The more balanced buffer time between track occupations indicates that the plan has a higher ability to absorb primary delays and perturbations.…”
Section: Occupation Time Analysismentioning
confidence: 99%