- -

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 sencillo del ítem

Ficheros en el ítem

Thumbnail
Nombre: garlomepe2011_jh.pdf
Tamaño: 271.4Kb
Formato: PDF
Descripción: Versión del Autor.
Abrir
[Cerrado]
Nombre: Perea;ANTONIO J. ...
Tamaño: 1.309Mb
Formato: PDF
Descripción: Versión editorial
Solicitar una copia al autor
dc.contributor.author García-Archilla, Bosco es_ES
dc.contributor.author Lozano, Antonio J. es_ES
dc.contributor.author Mesa, Juan A.
dc.contributor.author Perea Rojas Marcos, Federico
dc.date.accessioned 2015-12-15T16:26:55Z
dc.date.available 2015-12-15T16:26:55Z
dc.date.issued 2011-04
dc.identifier.issn 1381-1231
dc.identifier.uri http://hdl.handle.net/10251/58853
dc.description.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. © 2011 Springer Science+Business Media, LLC. es_ES
dc.description.sponsorship 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. en_EN
dc.language Inglés es_ES
dc.publisher Springer Verlag es_ES
dc.relation.ispartof Journal of Heuristics es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject Heuristics es_ES
dc.subject Robustness es_ES
dc.subject Transportation es_ES
dc.subject Integer programming es_ES
dc.subject Mass transportation es_ES
dc.subject Robustness (control systems) es_ES
dc.subject Binary variables es_ES
dc.subject Feasible solution es_ES
dc.subject Grasp algorithms es_ES
dc.subject Integer Linear Programming es_ES
dc.subject Railway network es_ES
dc.subject Railroads es_ES
dc.subject.classification ESTADISTICA E INVESTIGACION OPERATIVA es_ES
dc.title GRASP algorithms for the robust railway network design problem es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1007/s10732-011-9185-z
dc.relation.projectID 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/ es_ES
dc.relation.projectID info:eu-repo/grantAgreement/MICINN//MTM2009-14243/ES/Optimizacion De La Robustez En Analisis De Localizaciones Y Diseño De Redes/ es_ES
dc.relation.projectID 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/ es_ES
dc.rights.accessRights Abierto es_ES
dc.contributor.affiliation 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 es_ES
dc.description.bibliographicCitation 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 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion http://dx.doi.org/10.1007/s10732-011-9185-z es_ES
dc.description.upvformatpinicio 399 es_ES
dc.description.upvformatpfin 422 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 19 es_ES
dc.description.issue 2 es_ES
dc.relation.senia 208891 es_ES
dc.contributor.funder Junta de Andalucía es_ES
dc.contributor.funder Ministerio de Ciencia e Innovación es_ES
dc.contributor.funder Ministerio de Fomento es_ES
dc.description.references Baaj, M., Mahmassani, H.: An AI-based approach for transit route system planning and design. J. Adv. Transp. 25(2), 187–210 (1991) es_ES
dc.description.references 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) es_ES
dc.description.references 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 es_ES
dc.description.references Feo, T., Resende, M.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8, 67–71 (1989) es_ES
dc.description.references Goossens, J., van Hoesel, C., Kroon, L.: A branch-and-cut approach for solving railway line-planning problems. Transp. Sci. 38, 379–393 (2004) es_ES
dc.description.references Institute of Electrical and Electronics Engineers: IEEE Standard Computer Dictionary: A Compilation of IEEE Standard Computer Glossaries (1990) es_ES
dc.description.references 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) es_ES
dc.description.references Laporte, G., Marín, A., Mesa, J., Perea, F.: Designing robust rapid transit networks with alternative routes. J. Adv. Transp. 45, 54–65 (2011) es_ES
dc.description.references Marín, A., García-Ródenas, R.: Location of infrastructure in urban railway networks. Comput. Oper. Res. 36, 1461–1477 (2009) es_ES
dc.description.references Marín, A., Jaramillo, P.: Urban rapid transit network design: accelerated Benders decomposition. Ann. Oper. Res. 169(1), 35–53 (2009) es_ES
dc.description.references 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) es_ES
dc.description.references Mauttone, A., Urquhart, M.E.: A route set construction algorithm for the transit network design problem. Comput. Oper. Res. 36, 2440–2449 (2009) es_ES
dc.description.references 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) es_ES
dc.description.references Nesmachnow, S., Cancela, H., Alba, E.: Evolutionary algorithms applied to reliable communication network design. Eng. Optim. 39(7), 831–855 (2007) es_ES
dc.description.references 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) es_ES


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

Mostrar el registro sencillo del ítem