2007
DOI: 10.1016/j.trb.2006.05.003
|View full text |Cite
|
Sign up to set email alerts
|

Single-track train timetabling with guaranteed optimality: Branch-and-bound algorithms with enhanced lower bounds

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
181
0
3

Year Published

2011
2011
2023
2023

Publication Types

Select...
6
3

Relationship

1
8

Authors

Journals

citations
Cited by 264 publications
(184 citation statements)
references
References 26 publications
0
181
0
3
Order By: Relevance
“…A branch and bound (B&B) algorithm was proven to be technically feasible for solving nonlinear integer programming (NIP) problems characterized by large-scale calculations [2,8,14]. A B&B algorithm was reasonably applied to railway rescheduling problems to speed up the computation to ensure the efficiency of real-time control.…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…A branch and bound (B&B) algorithm was proven to be technically feasible for solving nonlinear integer programming (NIP) problems characterized by large-scale calculations [2,8,14]. A B&B algorithm was reasonably applied to railway rescheduling problems to speed up the computation to ensure the efficiency of real-time control.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Second, an exact lower bound rule was used to estimate the smallest train delay for resolving the remaining crossing conflicts in a partial schedule. Third, a beam search heuristic method established the tight upper bound [14]. A B&B algorithm, along with a new heuristic beam search algorithm, is presented to solve robust train timetabling problems.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The manual lecture time-tabling system requires considerable time and effort with a lot of paperwork. The process involves assigning courses, lecturers and resources such as lecture halls to timeslots subject to constraints [4]. The committee saddled with the responsibility of manual time-tabling generation are usually faced with numerous challenges ranging from erroneous computation, clashes in lecture halls, omission of courses just to mention a few.…”
Section: Literature Review 21 Manual Time-tabling Generationmentioning
confidence: 99%
“…Researchers have devoted themselves to optimize the train schedule to assist help dispatchers make better decisions meeting passengers and operators expectations. The objective functions are most concentrated on enhancing passengers satisfaction in terms of degree of crowdedness [1][2][3], passengers waiting time [2,4,5] and passengers travel time [6,7] or reducing operation costs in terms of energy consumption [6,[8][9][10], trains [11,12], train travel time [13], etc. Not only does the urban rail transit systems expand fast, but also the passenger demand rises significantly.…”
Section: Introductionmentioning
confidence: 99%