Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 1
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

GRASP algorithms for the robust railway network design problem

  • García-Archilla, Bosco
  • Lozano, Antonio J.
  • Mesa, Juan A.
  • Perea Rojas Marcos, Federico
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. © 2011 Springer Science+Business Media, LLC., We would like to thank the Spanish Ministerio de Fomento under grant PT-2007-003, Ministerio de Ciencia y Educacion under grant MTM2009-14243, the Junta de Andalucia under grant P09-TEP-5022 for supporting this research, the FEDER funds of the European Union and TUSSAM (Seville, Spain). Special thanks are due to two anonymous referees for their valuable comments.