lunes, 27 de marzo de 2017

Ficha del recurso:

Fuente:

Vínculo original en SOA
Bosco García-Archilla, Antonio J. Lozano, Juan A. Mesa and Federico Perea

Última actualización:

viernes, 26 de octubre de 2012

Entrada en el observatorio:

domingo, 29 de julio de 2012

Idioma:

Inglés

Archivado en:


GRASP algorithms for the robust railway network design problem

This paper analyzes the solvability of a railway network design problem and its robust version. These problems are modeled as integer linear programming problems with binary variables, and their solutions provide topological railway networks maximizing the trip coverage in the presence of a competing mode, both assuming that the network works fine and that links can fail, respectively. Since these problems are computationally intractable for realistic sizes, GRASP heuristics are proposed for finding good feasible solutions. The results obtained in a computational experience indicate that our GRASP algorithms are suitable for railway network design problems.