Research and Development in Intelligent Systems XXVI 2009
DOI: 10.1007/978-1-84882-983-1_33
|View full text |Cite
|
Sign up to set email alerts
|

Allocating Railway Platforms Using A Genetic Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 24 publications
0
3
0
Order By: Relevance
“…Unfortunately, the work was limited by the fact that they used a very simplified railway model. Clarke et al [4] used a genetic algorithm (GA) to reallocate trains to platforms at Glasgow Central station. They found that their system could successfully allocate around 1000 trains in approximately 30 seconds, with minimal clashes between scheduled trains.…”
Section: Related Workmentioning
confidence: 99%
“…Unfortunately, the work was limited by the fact that they used a very simplified railway model. Clarke et al [4] used a genetic algorithm (GA) to reallocate trains to platforms at Glasgow Central station. They found that their system could successfully allocate around 1000 trains in approximately 30 seconds, with minimal clashes between scheduled trains.…”
Section: Related Workmentioning
confidence: 99%
“…[31] In 2011 Cleark proposed genetic algorithm with six others for Railway platform allocation. [57] In 2012 Bayhan with one other proposed simulation model approach for a feasible timetable generator framework for railway scheduling problem. [30] In 2013 Corman with other three proposed iterative optimization framework for railway schedule using alternative graph method.…”
Section: Related Workmentioning
confidence: 99%
“…Early work on our timetabling problem tackled platform allocation in a major station using real arrival times and a specified platform resource (Clarke et al, 2009). Glasgow Central has nearly 1000 trains a day and the system resolved the allocation problem in under 30 seconds on a fairly modest PC.…”
Section: Subproblemsmentioning
confidence: 99%