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
Tidtabellsläggning för extrainsatta godståg: En approximationsalgoritm på räls
KTH, School of Computer Science and Communication (CSC).
2014 (Swedish)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [sv]

I detta arbete prövas olika metoder för tidtabellsläggning av extratåg längs redan trafikerat enkel- eller dubbelspår. Förutsättningarna är att befintlig tidtabell inte skall behöva läggas om och att extratåget (om möjligt) inte skall behöva stanna längs vägen för bästa möjliga energi effektivitet. Först tas en exakt algoritm fram, för ett extra tåg. Denbaseras på att mellanrummet mellan ett par befintliga tåg kan betraktas som en “korridor”, i vilket ett extra tåg kanläggas. Undersökningar görs också under vilka premisser denna metod kan användas för flera extra tåg. Därefter beskrivs två inom tågtrafiken redan använda heuristiker med heltalsprogrammering som lagrangerelaxeras, vilka utvecklas till en heuristik för flera energioptimala extratåg.

Abstract [en]

Timetabling extra freight trains. In this master thesis, different methods are presented for solving the problem of scheduling extra trains along single or double tracks, that are already used in regular traffic.The conditions are that the current timetable must not be modified and that the extra train (if possible) should not have to stop during the trip to maintain maximum energy efficiency. First, an exact algorithm to schedule one extra train is presented, based on using the interval between two already scheduled trains as a possible “corridor” for an extra train. Investigations are performed concerning when this method could be used to schedule more than one extra train. Two methods already in use, both based on a Lagrangian relaxed integer linear programming problem, are described and developed to an heuristic for several extra trains with maximum energy efficiency.

Place, publisher, year, edition, pages
2014.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-153918OAI: oai:DiVA.org:kth-153918DiVA: diva2:753939
Examiners
Available from: 2014-11-21 Created: 2014-10-09 Last updated: 2014-11-21Bibliographically approved

Open Access in DiVA

fulltext(808 kB)198 downloads
File information
File name FULLTEXT01.pdfFile size 808 kBChecksum SHA-512
ba10f96a659b1df4f5050f08dc9733df5972751b46ddb06157bfbf890b08882ccd38fe135c24b2276b1f31a2c538b012fcbd7d615d3ab81763a71f4239d068d9
Type fulltextMimetype application/pdf

By organisation
School of Computer Science and Communication (CSC)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 198 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

urn-nbn

Altmetric score

urn-nbn
Total: 85 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