Journal of Heuristics

, Volume 19, Issue 2, pp 399–422

GRASP algorithms for the robust railway network design problem

  • Bosco García-Archilla
  • Antonio J. Lozano
  • Juan A. Mesa
  • Federico Perea
Article

Abstract

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.

Keywords

Transportation Robustness Heuristics 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  • Bosco García-Archilla
    • 1
  • Antonio J. Lozano
    • 2
  • Juan A. Mesa
    • 1
  • Federico Perea
    • 3
  1. 1.Department of Applied Mathematics II, Engineering Higher Technical SchoolUniversidad de SevillaSevilleSpain
  2. 2.Department of Mathematics, Faculty of Experimental SciencesUniversidad de HuelvaHuelvaSpain
  3. 3.Department of Statistics and Operations ResearchUniversitat Politècnica de ValènciaValenciaSpain

Personalised recommendations