{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T07:31:12Z","timestamp":1774423872839,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,9,3]],"date-time":"2011-09-03T00:00:00Z","timestamp":1315008000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s10732-011-9185-z","type":"journal-article","created":{"date-parts":[[2011,9,6]],"date-time":"2011-09-06T13:54:32Z","timestamp":1315317272000},"page":"399-422","source":"Crossref","is-referenced-by-count":22,"title":["GRASP algorithms for the robust railway network design problem"],"prefix":"10.1007","volume":"19","author":[{"given":"Bosco","family":"Garc\u00eda-Archilla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio J.","family":"Lozano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan A.","family":"Mesa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Federico","family":"Perea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,9,3]]},"reference":[{"issue":"2","key":"9185_CR1","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/atr.5670250205","volume":"25","author":"M. Baaj","year":"1991","unstructured":"Baaj, M., Mahmassani, H.: An AI-based approach for transit route system planning and design. J. Adv. Transp. 25(2), 187\u2013210 (1991)","journal-title":"J. Adv. Transp."},{"issue":"1","key":"9185_CR2","first-page":"52","volume":"4","author":"H. Cancela","year":"2004","unstructured":"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\u201358 (2004)","journal-title":"J. Comput. Sci. Technol."},{"key":"9185_CR3","author":"J.A. D\u00edaz","year":"2011","unstructured":"D\u00edaz, J.A., Luna, D., Luna, R.: A grasp heuristic for the manufacturing cell formation problem. TOP (2011). doi: 10.1007\/s11750-010-0159-3","journal-title":"TOP"},{"key":"9185_CR4","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T. Feo","year":"1989","unstructured":"Feo, T., Resende, M.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8, 67\u201371 (1989)","journal-title":"Oper. Res. Lett."},{"key":"9185_CR5","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1287\/trsc.1030.0051","volume":"38","author":"J. Goossens","year":"2004","unstructured":"Goossens, J., van Hoesel, C., Kroon, L.: A branch-and-cut approach for solving railway line-planning problems. Transp. Sci. 38, 379\u2013393 (2004)","journal-title":"Transp. Sci."},{"key":"9185_CR6","unstructured":"Institute of Electrical and Electronics Engineers: IEEE Standard Computer Dictionary: A Compilation of IEEE Standard Computer Glossaries (1990)"},{"key":"9185_CR7","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/j.trb.2009.08.004","volume":"44","author":"G. Laporte","year":"2010","unstructured":"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\u2013459 (2010)","journal-title":"Transp. Res., Part B, Methodol."},{"key":"9185_CR8","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1002\/atr.132","volume":"45","author":"G. Laporte","year":"2011","unstructured":"Laporte, G., Mar\u00edn, A., Mesa, J., Perea, F.: Designing robust rapid transit networks with alternative routes. J. Adv. Transp. 45, 54\u201365 (2011)","journal-title":"J. Adv. Transp."},{"key":"9185_CR9","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.1016\/j.cor.2008.02.008","volume":"36","author":"A. Mar\u00edn","year":"2009","unstructured":"Mar\u00edn, A., Garc\u00eda-R\u00f3denas, R.: Location of infrastructure in urban railway networks. Comput. Oper. Res. 36, 1461\u20131477 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9185_CR10","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s10479-008-0388-0","volume":"169","author":"A. Mar\u00edn","year":"2009","unstructured":"Mar\u00edn, A., Jaramillo, P.: Urban rapid transit network design: accelerated Benders decomposition. Ann. Oper. Res. 169(1), 35\u201353 (2009)","journal-title":"Ann. Oper. Res."},{"key":"9185_CR11","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/978-3-642-05465-5_11","volume":"5868","author":"A. Mar\u00edn","year":"2009","unstructured":"Mar\u00edn, A., Mesa, J.A., Perea, F.: Integrating robust railway network design and line planning under failures. Lect. Notes Comput. Sci. 5868, 273\u2013292 (2009)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9185_CR12","doi-asserted-by":"crossref","first-page":"2440","DOI":"10.1016\/j.cor.2008.09.014","volume":"36","author":"A. Mauttone","year":"2009","unstructured":"Mauttone, A., Urquhart, M.E.: A route set construction algorithm for the transit network design problem. Comput. Oper. Res. 36, 2440\u20132449 (2009)","journal-title":"Comput. Oper. Res."},{"key":"9185_CR13","series-title":"Discrete Mathematics and Theoretical Computer Science Series","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1090\/dimacs\/040\/17","volume-title":"Networks","author":"R. Murphey","year":"1998","unstructured":"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\u2013302. American Mathematical Society, Providence (1998)"},{"issue":"7","key":"9185_CR14","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1080\/03052150701503553","volume":"39","author":"S. Nesmachnow","year":"2007","unstructured":"Nesmachnow, S., Cancela, H., Alba, E.: Evolutionary algorithms applied to reliable communication network design. Eng. Optim. 39(7), 831\u2013855 (2007)","journal-title":"Eng. Optim."},{"key":"9185_CR15","volume-title":"5th Workshop on Algorithmic Methods and Models for Optimization of Railways, Number 06901 in Dagstuhl Seminar Proceedings","author":"A. Sch\u00f6bel","year":"2006","unstructured":"Sch\u00f6bel, 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)"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9185-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-011-9185-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9185-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:54:32Z","timestamp":1559242472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-011-9185-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,3]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["9185"],"URL":"https:\/\/doi.org\/10.1007\/s10732-011-9185-z","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,3]]}}}