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
Design of an effective algorithm for fast response to the re-scheduling of railway traffic during disturbances
Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
Responsible organisation
2012 (English)In: Transportation Research Part C: Emerging Technologies, ISSN 0968-090X, E-ISSN 1879-2359, Vol. 20, no 1, 62-78 p.Article in journal (Refereed) Published
Abstract [en]

An attractive and sustainable railway traffic system is characterized by having a high security, high accessibility, high energy performance and offering reliable services with sufficient punctuality. At the same time, the network is to be utilized to a large extent in a cost-effective way. This requires a continuous balance between maintaining a high utilization and sufficiently high robustness to minimize the sensitivity to disturbances. The occurrence of some disturbances can be prevented to some extent but the occurrence of unpredictable events are unavoidable and their consequences then need to be analyzed, minimized and communicated to the affected users. Valuable information necessary to perform a complete consequence analysis of a disturbance and the re-scheduling is however not always available for the traffic managers. With current conditions, it is also not always possible for the traffic managers to take this information into account since he or she needs to act fast without any decision-support assisting in computing an effective re-scheduling solution. In previous research we have designed an optimization-based approach for re-scheduling which seems promising. However, for certain scenarios it is difficult to find good solutions within seconds. Therefore, we have developed a greedy algorithm which effectively delivers good solutions within the permitted time as a complement to the previous approach. 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.

Place, publisher, year, edition, pages
Elsevier , 2012. Vol. 20, no 1, 62-78 p.
Keyword [en]
Disturbance management, Optimization, Railway traffic, Scheduling, Slot allocation, Timetabling
National Category
Computer Science
Identifiers
URN: urn:nbn:se:bth-7191DOI: 10.1016/j.trc.2010.12.004ISI: 000297485300007Local ID: oai:bth.se:forskinfo590290BAA8E94EF2C12578BE0029D513OAI: oai:DiVA.org:bth-7191DiVA: diva2:834773
Available from: 2012-11-27 Created: 2011-06-29 Last updated: 2016-09-02Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Krasemann, Johanna Törnquist
By organisation
Department of Computer Science and Engineering
In the same journal
Transportation Research Part C: Emerging Technologies
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 66 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