{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T20:55:28Z","timestamp":1761252928047},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2014,8,20]],"date-time":"2014-08-20T00:00:00Z","timestamp":1408492800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s10479-014-1682-7","type":"journal-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T06:02:59Z","timestamp":1408428179000},"page":"101-126","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Lagrangian relaxation approach for expansion of a highway network"],"prefix":"10.1007","volume":"246","author":[{"given":"Eusebio","family":"Angulo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Garc\u00eda-R\u00f3denas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 Luis","family":"Espinosa-Aranda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,20]]},"reference":[{"issue":"5","key":"1682_CR1","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1061\/(ASCE)TE.1943-5436.0000361","volume":"138","author":"E Angulo","year":"2012","unstructured":"Angulo, E., Castillo, E., Garc\u00eda-R\u00f3denas, R., & S\u00e1nchez-Vizca\u00edno, J. (2012). Determining highway corridors. Journal of Transportation Engineering, 138(5), 557\u2013570.","journal-title":"Journal of Transportation Engineering"},{"issue":"2014","key":"1682_CR2","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/j.cor.2013.02.022","volume":"41","author":"E Angulo","year":"2014","unstructured":"Angulo, E., Castillo, E., Garc\u00eda-R\u00f3denas, R., & S\u00e1nchez-Vizca\u00edno, J. (2014). A continuous bi-level model for the expansion of highway networks. Computers & Operations Research, 41(2014), 262\u2013276.","journal-title":"Computers & Operations Research"},{"key":"1682_CR3","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1023\/A:1018923022243","volume":"82","author":"B Boffey","year":"1998","unstructured":"Boffey, B., & Narula, S. C. (1998). Models for multi-path covering-routing problems. Annals of Operations Research, 82, 331\u2013342.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"1682_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0305-0548(00)00051-4","volume":"29","author":"G Bruno","year":"2002","unstructured":"Bruno, G., Gendreau, M., & Laporte, G. (2002). A heuristic for the location of a rapid transit line. Computers & Operations Research, 29(1), 1\u201312.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"1682_CR5","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/S0377-2217(97)00187-2","volume":"104","author":"G Bruno","year":"1998","unstructured":"Bruno, G., Ghiani, G., & Improta, G. (1998). A multi-modal approach to the location of a rapid transit line. European Journal of Operational Research, 104(2), 321\u2013332.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"1682_CR6","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s00291-008-0159-y","volume":"31","author":"I Contreras","year":"2009","unstructured":"Contreras, I., D\u00edaz, J. A., & Fern\u00e1ndez, E. (2009). Lagrangean relaxation for the capacitated hub location problem with single assignment. OR Spectrum, 31(3), 483\u2013505.","journal-title":"OR Spectrum"},{"issue":"3","key":"1682_CR7","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1016\/j.ejor.2011.11.009","volume":"219","author":"I Contreras","year":"2012","unstructured":"Contreras, I., & Fern\u00e1ndez, E. (2012). General network design: A unified view of combined location and network design problems. European Journal of Operational Research, 219(3), 680\u2013697.","journal-title":"European Journal of Operational Research"},{"issue":"1\u20133","key":"1682_CR8","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0166-218X(00)00310-3","volume":"112","author":"TG Crainic","year":"2001","unstructured":"Crainic, T. G., Frangioni, A., & Gendron, B. (2001). Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discrete Applied Mathematics, 112(1\u20133), 73\u201399.","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"1682_CR9","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1287\/ijoc.12.3.223.12638","volume":"12","author":"TG Crainic","year":"2000","unstructured":"Crainic, T. G., Gendreu, M., & Farvolden, J. M. (2000). A simplex-based tabu search method for capacitated network design. INFORMS Journal on Computing, 12(3), 223\u2013236.","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"1682_CR10","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/0377-2217(93)90140-I","volume":"65","author":"J Current","year":"1993","unstructured":"Current, J., & Marsh, M. (1993). Multiobjective transportation network design and routing problems: Taxonomy and annotation. European Journal of Operational Research, 65(1), 4\u201319.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"1682_CR11","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1287\/trsc.28.4.317","volume":"28","author":"J Current","year":"1994","unstructured":"Current, J., Pirkul, H., & Rolland, E. (1994). Efficient algorithms for solving the shortest covering path problem. Transportation Science, 28(4), 317\u2013327.","journal-title":"Transportation Science"},{"issue":"2","key":"1682_CR12","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1111\/j.1467-9787.1984.tb01030.x","volume":"24","author":"JR Current","year":"1984","unstructured":"Current, J. R., ReVelle, C. S., & Cohon, J. L. (1984). The shortest covering path problem: An application of locational constraints to network design. Journal of Regional Science, 24(2), 161\u2013183.","journal-title":"Journal of Regional Science"},{"issue":"2","key":"1682_CR13","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0377-2217(85)90030-X","volume":"21","author":"JR Current","year":"1985","unstructured":"Current, J. R., ReVelle, C. S., & Cohon, J. L. (1985). The maximum covering\/shortest path problem: A multiobjective network design and routing formulation. European Journal of Operational Research, 21(2), 189\u2013199.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"1682_CR14","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0377-2217(86)80007-8","volume":"27","author":"JR Current","year":"1986","unstructured":"Current, J. R., ReVelle, C. S., & Cohon, J. L. (1986). The hierarchical network design problem. European Journal of Operational Research, 27(1), 57\u201366.","journal-title":"European Journal of Operational Research"},{"key":"1682_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0966-8349(96)00008-3","volume":"4","author":"H Dufourd","year":"1996","unstructured":"Dufourd, H., Gendreau, M., & Laporte, G. (1996). Locating a transit line using tabu search. Location Science, 4, 1\u201319.","journal-title":"Location Science"},{"issue":"3","key":"1682_CR16","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/0377-2217(89)90170-7","volume":"39","author":"C Duin","year":"1989","unstructured":"Duin, C., & Volgenant, A. (1989). Reducing the hierarchical network design problem. European Journal of Operational Research, 39(3), 332\u2013344.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"1682_CR17","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1016\/j.ejor.2007.07.004","volume":"190","author":"ET Erdemir","year":"2008","unstructured":"Erdemir, E. T., Batta, R., Spielman, S., Rogerson, P. A., Blatt, A., & Flanigan, M. (2008). Location coverage models with demand originating from nodes and paths: Application to cellular network design. European Journal of Operational Research, 190(3), 610\u2013632.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"1682_CR18","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/s11750-008-0060-5","volume":"17","author":"LF Escudero","year":"2009","unstructured":"Escudero, L. F., & Mu\u00f1oz, S. (2009). An approach for solving a modification of the extended rapid transit network design problem. Top, 17(2), 320\u2013334.","journal-title":"Top"},{"issue":"2","key":"1682_CR19","first-page":"165","volume":"41","author":"P Fern\u00e1ndez","year":"2003","unstructured":"Fern\u00e1ndez, P., & Mar\u00edn, A. (2003). A heuristic procedure for path location with multisource demand. INFOR: Information Systems and Operational Research, 41(2), 165\u2013178.","journal-title":"INFOR: Information Systems and Operational Research"},{"key":"1682_CR20","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/j.cie.2009.11.010","volume":"58","author":"G Gut\u00ederrez-Jarpa","year":"2010","unstructured":"Gut\u00ederrez-Jarpa, G., Donoso, M., Obreque, C., & Marianov, V. (2010). Minimum cost path location for maximum traffic capture. Computers & Industrial Engineering, 58, 332\u2013341.","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"1682_CR21","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1287\/opre.48.3.461.12439","volume":"48","author":"K Holmberg","year":"2000","unstructured":"Holmberg, K., & Yuan, D. (2000). A lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Operations Research, 48(3), 461\u2013481.","journal-title":"Operations Research"},{"key":"1682_CR22","doi-asserted-by":"crossref","first-page":"260","DOI":"10.3141\/1768-30","volume":"1768","author":"MK Jha","year":"2001","unstructured":"Jha, M. K. (2001). Using a GIS for automated decision-making in highway cost analysis. Transportation Research Record, 1768, 260\u2013267.","journal-title":"Transportation Research Record"},{"issue":"6","key":"1682_CR23","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1111\/0885-9507.00242","volume":"16","author":"MK Jha","year":"2001","unstructured":"Jha, M. K., McCall, C., & Schonfeld, P. (2001). Using GIS, genetic algorithms, and visualization in highway development. Computer-Aided Civil and Infrastructure Engineering, 16(6), 399\u2013414.","journal-title":"Computer-Aided Civil and Infrastructure Engineering"},{"key":"1682_CR24","doi-asserted-by":"crossref","first-page":"233","DOI":"10.3141\/1719-31","volume":"1719","author":"MK Jha","year":"2000","unstructured":"Jha, M. K., & Schonfeld, P. (2000). Integrating genetic algorithsms and geographic information system to optimize highway alignments. Transportation Research Record, 1719, 233\u2013240.","journal-title":"Transportation Research Record"},{"key":"1682_CR25","unstructured":"Jong, J. C. (1998). Optimizing highway alignments with genetic algorithms. Ph.D. thesis, College Park, University of Maryland"},{"key":"1682_CR26","unstructured":"Kang, M. W. (2008). An alignment optimization model for a simple highway network. Ph.D. thesis, College Park, University of Maryland."},{"issue":"3","key":"1682_CR27","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1016\/j.ejor.2011.11.046","volume":"218","author":"A Konak","year":"2012","unstructured":"Konak, A. (2012). Network design problem with relays: A genetic algorithm with a path-based crossover and a set covering formulation. European Journal of Operational Research, 218(3), 829\u2013837.","journal-title":"European Journal of Operational Research"},{"key":"1682_CR28","doi-asserted-by":"crossref","unstructured":"Laporte, G., Mar\u00edn, A., Mesa, J. A., & Ortega, F. A. (2007). An integrated mehodology for the rapid transit network design problem. Lectures notes in computer science (Vol. 4359, pp. 187\u2013199).","DOI":"10.1007\/978-3-540-74247-0_9"},{"issue":"1","key":"1682_CR29","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. A., & Perea, F. (2011). Designing robust rapid transit networks with alternative routes. Journal of Advanced Transportation, 45(1), 54\u201365.","journal-title":"Journal of Advanced Transportation"},{"issue":"1","key":"1682_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(99)00016-8","volume":"122","author":"G Laporte","year":"2000","unstructured":"Laporte, G., Mesa, J. A., & Ortega, F. A. (2000). Optimization methods for the planning of rapid transit systems. European Journal of Operations Research, 122(1), 1\u201310.","journal-title":"European Journal of Operations Research"},{"issue":"6","key":"1682_CR31","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1016\/S0305-0548(00)00013-7","volume":"29","author":"G Laporte","year":"2002","unstructured":"Laporte, G., Mesa, J. A., & Ortega, F. A. (2002). Locating stations on rapid transit lines. Computers & Operations Research, 29(6), 741\u2013759.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"1682_CR32","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.seps.2011.02.001","volume":"45","author":"G Laporte","year":"2011","unstructured":"Laporte, G., Mesa, J. A., Ortega, F. A., & Perea, F. (2011). Planning rapid transit networks. Socio-Economic Planning Sciences, 45(3), 95\u2013104.","journal-title":"Socio-Economic Planning Sciences"},{"issue":"1","key":"1682_CR33","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10479-005-2038-0","volume":"136","author":"G Laporte","year":"2005","unstructured":"Laporte, G., Mesa, J. A., Ortega, F. A., & Sevillano, I. (2005). Maximizing trip coverage in the location of a single rapid transit alignment. Annals of Operations Research, 136(1), 49\u201363.","journal-title":"Annals of Operations Research"},{"key":"1682_CR34","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s11750-007-0017-0","volume":"15","author":"A Mar\u00edn","year":"2007","unstructured":"Mar\u00edn, A. (2007). An extension to rapid transit network design problem. Top, 15, 231\u2013241.","journal-title":"Top"},{"issue":"5","key":"1682_CR35","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. (2009). Location of infrastructure in urban railway networks. Computers & Operations Research, 36(5), 1461\u20131477.","journal-title":"Computers & Operations Research"},{"key":"1682_CR36","doi-asserted-by":"crossref","unstructured":"Mar\u00edn, A., Mesa, J. A., Perea, F. (2009). Integrating robust railway network design and line planning under failures. In R. K. Ahuja et al. (Ed.), Robust and online large-scale optimization LNCS (Vol. 5868, pp. 273\u2013292).","DOI":"10.1007\/978-3-642-05465-5_11"},{"key":"1682_CR37","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1023\/A:1018998500803","volume":"86","author":"A Mar\u00edn","year":"1999","unstructured":"Mar\u00edn, A., & Pelegr\u00edn, B. (1999). Applying Lagrangian relaxation to the resolution of two-stage location problems. Annals of Operations Research, 86, 179\u2013198.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"1682_CR38","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/0377-2217(95)00321-5","volume":"95","author":"JA Mesa","year":"1996","unstructured":"Mesa, J. A., & Boffey, T. B. (1996). A review of extensive facility location in networks. European Journal of Operational Research, 95(3), 592\u2013603.","journal-title":"European Journal of Operational Research"},{"key":"1682_CR39","volume-title":"Modelling transport","author":"Jd D Ort\u00fazar","year":"1994","unstructured":"Ort\u00fazar, Jd D., & Willumsen, L. G. (1994). Modelling transport. Chichester: Wiley."},{"issue":"3","key":"1682_CR40","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1287\/trsc.25.3.175","volume":"25","author":"H Pirkul","year":"1991","unstructured":"Pirkul, H., Current, J., & Nagarajan, V. (1991). The hierarchical network design problem: A new formulation and solution procedures. Transportation Science, 25(3), 175\u2013182.","journal-title":"Transportation Science"},{"issue":"3","key":"1682_CR41","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0041-5553(69)90061-5","volume":"9","author":"BT Polyak","year":"1969","unstructured":"Polyak, B. T. (1969). Minimization of unsmooth functionals. USSR Computational Mathematics and Mathematical Physics, 9(3), 14\u201329.","journal-title":"USSR Computational Mathematics and Mathematical Physics"},{"issue":"2","key":"1682_CR42","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0377-2217(95)00333-9","volume":"96","author":"NGF Sancho","year":"1997","unstructured":"Sancho, N. G. F. (1997). The hierarchical network design problem with multiple primary paths. European Journal of Operational Research, 96(2), 323\u2013328.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"1682_CR43","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0191-2615(97)00020-9","volume":"32","author":"RS Solanki","year":"1998","unstructured":"Solanki, R. S., Gorti, J. K., & Southworth, F. (1998). Using decomposition in large-scale highway network design with a quasi-optimization heuristic. Transportation Research Part B: Methodological, 32(2), 127\u2013140.","journal-title":"Transportation Research Part B: Methodological"},{"key":"1682_CR44","unstructured":"Timothy, J. (2013). The maximal covering\/shortest path problem revisited: An examination and reformulation of the problem to allow the elimination or attachment of sub-tours. Ph.D. thesis, M. A. University of California, Santa Barbara"},{"issue":"3","key":"1682_CR45","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1080\/01441649808717016","volume":"18","author":"H Yang","year":"1998","unstructured":"Yang, H., & Bell, M. G. H. (1998). Models and algorithms for road network design: A review and some new developments. Transport Reviews: A Transnational Transdisciplinary Journal, 18(3), 257\u2013278.","journal-title":"Transport Reviews: A Transnational Transdisciplinary Journal"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1682-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-014-1682-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1682-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1682-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:09:52Z","timestamp":1559138992000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-014-1682-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,20]]},"references-count":45,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["1682"],"URL":"https:\/\/doi.org\/10.1007\/s10479-014-1682-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,20]]}}}