Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Greedy algorithm for railway traffic re-scheduling during disturbances: a Swedish case
Responsible organisation
2010 (English)In: IET Intelligent Transport Systems, ISSN 1751-956X, E-ISSN 1751-9578, Vol. 4, no 4Article in journal (Refereed) PublishedAlternative title
En girighetsalgoritm för omplanering av tågtrafik vid trafikstörningar (Swedish)
Abstract [en]

The positive trend of increased use of railway transportation in Europe has resulted in an increased sensitivity to and occurrence of traffic disturbances. In addition to the need for extensions of the infrastructure, the need to effectively limit and predict the effects of disturbances becomes apparent. The kernel of the disturbance management problem is to revise the original timetable in line with the new conditions and decide where, when and how trains should overtake or meet to minimise the negative effect of the disturbance. In previous research, the author has designed optimisation-based approach for rescheduling, which seems promising, but for some scenarios it is difficult to find good solutions within seconds. Also, more detailed constraints will have to be included, which makes the problem even more complex and difficult to solve. Therefore the author developed a greedy algorithm that effectively delivers good solutions within the permitted time. To quickly retrieve a feasible solution, the algorithm performs a depth-first search using an evaluation function to prioritise when conflicts arise and then branches according to a set of criteria. A performance analysis of the algorithm was carried out using simulated experiments showing its strengths and weaknesses.

Place, publisher, year, edition, pages
The Institution of Engineering and Technology , 2010. Vol. 4, no 4
Keyword [en]
Railway traffic, Scheduling, Timetabling, Slot allocation, Disturbance management, Optimisation
National Category
Mathematical Analysis Computer Science
Identifiers
URN: urn:nbn:se:bth-7647DOI: 10.1049/iet-its.2009.0122ISI: 000284307500017Local ID: oai:bth.se:forskinfo45E8E3587B00EB7CC125780D00429E83OAI: oai:DiVA.org:bth-7647DiVA: diva2:835291
Available from: 2012-09-18 Created: 2011-01-03 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

fulltext(541 kB)108 downloads
File information
File name FULLTEXT01.pdfFile size 541 kBChecksum SHA-512
03c363963061b8ec600ae0effe9267a665321dccf89dbf88b6e198b804dbcd0b5a6f939ad72804f071908ba6120940369d6fe1e11360a936c1cb22241f02bd13
Type fulltextMimetype application/pdf

Other links

Publisher's full text
In the same journal
IET Intelligent Transport Systems
Mathematical AnalysisComputer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 108 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 42 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf