Disaggregation in Bundle Methods: Application to the Train Timetabling Problem

Projekt:

Samhällsekonomiskt effektiv fördelning av järnvägskapacitet

Sammanfattning:
Abstract
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.

Länk till publikation i fulltext (pdf-fil, 708,2 kB. Öppnas i nytt fönster)

Författare: Abderrahman Ait Ali a,1, Per Olov Lindberg a,2, Jan-Eric Nilsson 3, Jonas Eliasson a,4, Martin Aronsson 5
Utgivare: Abderrahman Ait Ali a,1, Per Olov Lindberg a,2, Jan-Eric Nilsson 3, Jonas Eliasson a,4, Martin Aronsson 5
Utgivningsdatum: 2018
Diarienummer: TRV 2014/41766
Antal sidor: 17
Språk: Engelska
Kontaktperson: Hans Dahlberg, TRpa och Hans Stenbacka, TRvss