Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Disaggregation in Bundle Methods: Application to the Train Timetabling Problem
KTH, School of Architecture and the Built Environment (ABE), Transport Science, Transport Planning, Economics and Engineering. (Railway Group)ORCID iD: 0000-0001-9535-0617
KTH.
Show others and affiliations
2017 (English)Conference paper, Published paper (Refereed)
Abstract [en]

Bundle methods are often used to solve dual problems that arise from Lagrangian relaxations of large scale optimization problems. An example of such problems is the train timetabling problem. This paper focuses on solving a dual problem that arises from Lagrangian relaxation of a train timetabling optimization program. The dual problem is solved using bundle methods. We formulate and compare the performances of two different bundle methods: the aggregate method, which is a standard method, and a new, disaggregate, method which is proposed here. The two methods were tested on realistic train timetabling scenarios from the Iron Ore railway line. The numerical results show that the new disaggregate approach generally yields faster convergence than the standard aggregate approach.

Place, publisher, year, edition, pages
2017.
National Category
Transport Systems and Logistics Computational Mathematics
Research subject
Järnvägsgruppen - Kapacitet; Applied and Computational Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-202554OAI: oai:DiVA.org:kth-202554DiVA, id: diva2:1077421
Conference
Rail Lille 2017
Funder
Swedish Transport Administration, 6675
Note

QC 20170306

Available from: 2017-02-27 Created: 2017-02-27 Last updated: 2017-03-06Bibliographically approved

Open Access in DiVA

disaggregation in BM(763 kB)54 downloads
File information
File name FULLTEXT01.pdfFile size 763 kBChecksum SHA-512
be93e4278e6f8f068798b7111086b8e75a39efdc9e5990882de849199ed8419b91b9c5498ba247fe25c1c4e15f274b82945f5b4cf7572303c0f4ff06dbbda671
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Ait Ali, AbderrahmanLindberg, Per Olov
By organisation
Transport Planning, Economics and EngineeringKTH
Transport Systems and LogisticsComputational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 54 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: 217 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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