- -

GRASP algorithms for the robust railway network design problem

RiuNet: Repositorio Institucional de la Universidad Politécnica de Valencia

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

GRASP algorithms for the robust railway network design problem

Mostrar el registro completo del ítem

García-Archilla, B.; Lozano, AJ.; Mesa, JA.; Perea Rojas Marcos, F. (2011). GRASP algorithms for the robust railway network design problem. Journal of Heuristics. 19(2):399-422. https://doi.org/10.1007/s10732-011-9185-z

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/58853

Ficheros en el ítem

Thumbnail
Nombre: garlomepe2011_jh.pdf
Tamaño: 271.4Kb
Formato: PDF
Descripción: Versión del Autor.
Abrir/Preview
[Cerrado]
Nombre: Perea;ANTONIO J. ...
Tamaño: 1.309Mb
Formato: PDF
Descripción: Versión editorial
Solicitar una copia al autor

Metadatos del ítem

Título: GRASP algorithms for the robust railway network design problem
Autor: García-Archilla, Bosco Lozano, Antonio J. Mesa, Juan A. Perea Rojas Marcos, Federico
Entidad UPV: Universitat Politècnica de València. Departamento de Estadística e Investigación Operativa Aplicadas y Calidad - Departament d'Estadística i Investigació Operativa Aplicades i Qualitat
Fecha difusión:
Resumen:
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 ...[+]
Palabras clave: Heuristics , Robustness , Transportation , Integer programming , Mass transportation , Robustness (control systems) , Binary variables , Feasible solution , Grasp algorithms , Integer Linear Programming , Railway network , Railroads
Derechos de uso: Reserva de todos los derechos
Fuente:
Journal of Heuristics. (issn: 1381-1231 )
DOI: 10.1007/s10732-011-9185-z
Editorial:
Springer Verlag
Versión del editor: http://dx.doi.org/10.1007/s10732-011-9185-z
Código del Proyecto:
info:eu-repo/grantAgreement/MFOM//PT-2007-003-08CCPP/ES/Modelos de optimización aplicados a la planificación robusta y la gestión de los servicios metropolitanos de transporte público en caso de emergencia/
info:eu-repo/grantAgreement/MICINN//MTM2009-14243/ES/Optimizacion De La Robustez En Analisis De Localizaciones Y Diseño De Redes/
info:eu-repo/grantAgreement/Junta de Andalucía//P09-TEP-5022/ES/Metodologías Para El Diseño, La Planificación Robusta De Redes Y La Operación Mixta Del Transporte Por Ferrocarril. Aspectos Intermodales Y Convergencia Con Las Políticas De La Ue/
Agradecimientos:
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, ...[+]
Tipo: Artículo

References

Baaj, M., Mahmassani, H.: An AI-based approach for transit route system planning and design. J. Adv. Transp. 25(2), 187–210 (1991)

Cancela, H., Robledo, F., Rubino, G.: A grasp algorithm with tree based local search for designing a survivable wide area network backbone. J. Comput. Sci. Technol. 4(1), 52–58 (2004)

Díaz, J.A., Luna, D., Luna, R.: A grasp heuristic for the manufacturing cell formation problem. TOP (2011). doi: 10.1007/s11750-010-0159-3 [+]
Baaj, M., Mahmassani, H.: An AI-based approach for transit route system planning and design. J. Adv. Transp. 25(2), 187–210 (1991)

Cancela, H., Robledo, F., Rubino, G.: A grasp algorithm with tree based local search for designing a survivable wide area network backbone. J. Comput. Sci. Technol. 4(1), 52–58 (2004)

Díaz, J.A., Luna, D., Luna, R.: A grasp heuristic for the manufacturing cell formation problem. TOP (2011). doi: 10.1007/s11750-010-0159-3

Feo, T., Resende, M.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8, 67–71 (1989)

Goossens, J., van Hoesel, C., Kroon, L.: A branch-and-cut approach for solving railway line-planning problems. Transp. Sci. 38, 379–393 (2004)

Institute of Electrical and Electronics Engineers: IEEE Standard Computer Dictionary: A Compilation of IEEE Standard Computer Glossaries (1990)

Laporte, G., Mesa, J., Perea, F.: A game theoretic framework for the robust railway transit network design problem. Transp. Res., Part B, Methodol. 44, 447–459 (2010)

Laporte, G., Marín, A., Mesa, J., Perea, F.: Designing robust rapid transit networks with alternative routes. J. Adv. Transp. 45, 54–65 (2011)

Marín, A., García-Ródenas, R.: Location of infrastructure in urban railway networks. Comput. Oper. Res. 36, 1461–1477 (2009)

Marín, A., Jaramillo, P.: Urban rapid transit network design: accelerated Benders decomposition. Ann. Oper. Res. 169(1), 35–53 (2009)

Marín, A., Mesa, J.A., Perea, F.: Integrating robust railway network design and line planning under failures. Lect. Notes Comput. Sci. 5868, 273–292 (2009)

Mauttone, A., Urquhart, M.E.: A route set construction algorithm for the transit network design problem. Comput. Oper. Res. 36, 2440–2449 (2009)

Murphey, R., Pardalos, P., Pitsoulis, L.: A GRASP for the multitarget multisensor tracking problem. In: Networks. Discrete Mathematics and Theoretical Computer Science Series, vol. 40, pp. 277–302. American Mathematical Society, Providence (1998)

Nesmachnow, S., Cancela, H., Alba, E.: Evolutionary algorithms applied to reliable communication network design. Eng. Optim. 39(7), 831–855 (2007)

Schöbel, A., Scholl, S.: Line planning with minimal transfers. In: 5th Workshop on Algorithmic Methods and Models for Optimization of Railways, Number 06901 in Dagstuhl Seminar Proceedings (2006)

[-]

recommendations

 

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro completo del ítem