This is a summary of the author’s PhD thesis supervised by Alberto Caprara and Paolo Toth and defended on 29 May 2007 at the Università di Bologna. The thesis is written in English and is available from the author upon request. This work deals with Railway Optimization, and in particular it focuses on the Train Timetabling Problem (in the basic version on a corridor and in the extension to a railway network), and on the Train Unit Assignment Problem. Integer Linear Programming (ILP) formulations are proposed for both problems, and their continuous and Lagrangian relaxations are used to obtain optimal and heuristic solutions to real-world instances.
Models and Algorithms for Combinatorial Optimization Problems arising in Railway Applications / V. Cacchiani. - In: 4OR. - ISSN 1619-4500. - STAMPA. - 7:(2009), pp. 109-112. [10.1007/s10288-008-0075-7]
Models and Algorithms for Combinatorial Optimization Problems arising in Railway Applications
CACCHIANI, VALENTINA
2009
Abstract
This is a summary of the author’s PhD thesis supervised by Alberto Caprara and Paolo Toth and defended on 29 May 2007 at the Università di Bologna. The thesis is written in English and is available from the author upon request. This work deals with Railway Optimization, and in particular it focuses on the Train Timetabling Problem (in the basic version on a corridor and in the extension to a railway network), and on the Train Unit Assignment Problem. Integer Linear Programming (ILP) formulations are proposed for both problems, and their continuous and Lagrangian relaxations are used to obtain optimal and heuristic solutions to real-world instances.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
