{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T12:06:13Z","timestamp":1773662773238,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005,1]]},"DOI":"10.1007\/s10732-005-7000-4","type":"journal-article","created":{"date-parts":[[2005,5,12]],"date-time":"2005-05-12T12:20:01Z","timestamp":1115900401000},"page":"89-108","source":"Crossref","is-referenced-by-count":30,"title":["A GRASP and Path Relinking Heuristic for Rural Road Network Development"],"prefix":"10.1007","volume":"11","author":[{"given":"Maria P.","family":"Scaparra","sequence":"first","affiliation":[]},{"given":"Richard L.","family":"Church","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"13B","key":"7000_CR1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0191-2615(79)90004-3","volume":"B","author":"M. Abdulaal","year":"1979","unstructured":"Abdulaal, M. and L.J. LeBlanc. (1979). \u201cContinuous equilibrium network design models.\u201d Transportation Research B 13B, 19\u201332.","journal-title":"Transportation Research"},{"key":"7000_CR2","unstructured":"Aiex, R.M., M.G.C. Resende, P.M. Pardalos, and G. Toraldo. (2003). \u201cGRASP with path relinking for the three-index assignment problem.\u201d INFORMS J. on Computing (to appear)."},{"key":"7000_CR3","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1111\/1467-8667.00312","volume":"18","author":"A. Antunes","year":"2003","unstructured":"Antunes, A., A. Seco, and N. Pinto. (2003). \u201cAn accessibility-maximization approach to road network planning.\u201d Computer-Aided Civil and Infrastructure Engineering 18, 224\u2013240.","journal-title":"Computer-Aided Civil and Infrastructure Engineering"},{"key":"7000_CR4","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1068\/a050519","volume":"5","author":"D.E. Boyce","year":"1973","unstructured":"Boyce, D.E., A. Farhi, and R. Weischedel. (1973). \u201cOptimal network problem: A branch-and-bound algorithm.\u201d Environmental and Planning 5, 519\u2013533.","journal-title":"Environmental and Planning"},{"key":"7000_CR5","unstructured":"Church, R.L. and M.P. Scaparra. (2003). A mixed integer programming formulation for a bi-objective rural road development problem. Working paper."},{"key":"7000_CR6","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0377-2217(86)90180-3","volume":"26","author":"J. Current","year":"1986","unstructured":"Current, J. and H. Min. (1986). \u201cMultiobjective design of transportation networks: Taxonomy and annotation.\u201d European Journal of Operational Research 26, 187\u2013201.","journal-title":"European Journal of Operational Research"},{"key":"7000_CR7","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/net.3230090104","volume":"9","author":"R. Dionne","year":"1979","unstructured":"Dionne, R. and M. Florian. (1979). \u201cExact and approximate algorithms for optimal network design.\u201d Networks 9, 37\u201359.","journal-title":"Networks"},{"key":"7000_CR8","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"S.E. Dreyfus","year":"1969","unstructured":"Dreyfus, S.E. (1969). \u201cAn appraisal of some shortest path algorithms.\u201d Operations Research 17, 395\u2013412.","journal-title":"Operations Research"},{"issue":"3","key":"7000_CR9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1061\/(ASCE)0733-9488(2003)129:3(161)","volume":"129","author":"C. Feng","year":"2003","unstructured":"Feng, C. and J.Y. Wu. (2003). \u201cHighway investment planning model for equity issues.\u201d Journal of Urban Planning and Development 129(3), 161\u2013176.","journal-title":"Journal of Urban Planning and Development"},{"key":"7000_CR10","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T.A. Feo","year":"1989","unstructured":"Feo, T.A. and M.G.C. Resende. (1989). \u201cA probabilistic heuristic for a computationally difficult set covering problem.\u201d Operations Research Letters 8, 67\u201371.","journal-title":"Operations Research Letters"},{"key":"7000_CR11","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"Feo, T.A. and M.G.C. Resende. (1995). \u201cGreedy randomized adaptive search procedures.\u201d Journal of Global Optimization 6, 109\u2013133.","journal-title":"Journal of Global Optimization"},{"key":"7000_CR12","unstructured":"Festa, P. and M.G.C. Resende. (2001). \u201cGRASP: An annotated bibliography.\u201d In C.C. Ribeiro and P. Hansen (eds.), Essays and Surveys in Metaheuristics, Kluwer Academic Publishers, pp. 325\u2013367."},{"key":"7000_CR13","first-page":"3","volume":"3","author":"G. Gallo","year":"1980","unstructured":"Gallo, G. (1980). \u201cReoptimization procedures in shortest paths problems.\u201d Riv. Mat. Sci. Econom. Social. 3, 3\u201313.","journal-title":"Riv. Mat. Sci. Econom. Social."},{"key":"7000_CR14","first-page":"1","volume-title":"Interfaces in Computer Science and Operations Research","author":"F. Glover","year":"1996","unstructured":"Glover, F. (1996). \u201cTabu search and adaptive memory programming\u2014Advances, applications and challenges.\u201d In R.S. Barr, R.V. Helgason, and J.L. Kennington (eds.), Interfaces in Computer Science and Operations Research, Boston: Kluwer, pp. 1\u201324."},{"key":"7000_CR15","unstructured":"Glover, F. (1999). \u201cScatter search and path relinking.\u201d In D. Corne, M. Dorigo, and F. Glover (eds.), New Ideas in Optimisation. Wiley."},{"key":"7000_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F. and M. Laguna. (1997). Tabu Search. Boston: Kluwer Academic Publishers."},{"key":"7000_CR17","first-page":"653","volume":"39","author":"F. Glover","year":"2000","unstructured":"Glover, F., M. Laguna, and R. Mart\u00ec. (2000). \u201cFundamentals of scatter search and path relinking\u201d. Control and Cybernetics 39, 653\u2013684.","journal-title":"Control and Cybernetics"},{"key":"7000_CR18","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1002\/net.3230080402","volume":"8","author":"D.S. Johnson","year":"1978","unstructured":"Johnson, D.S., J.K. Lenstra, and A.H.G. Rinnooy Kan. (1978). \u201cThe complexity of the network design problem.\u201d Networks 8, 279\u2013285.","journal-title":"Networks"},{"key":"7000_CR19","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1002\/cnm.1630010613","volume":"1","author":"J. Koski","year":"1985","unstructured":"Koski, J. (1985). \u201cDefectiveness of weighting method in multicriteria optimization of structures.\u201d Communications in Applied Numerical Methods 1, 333\u2013337.","journal-title":"Communications in Applied Numerical Methods"},{"key":"7000_CR20","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1287\/ijoc.11.1.44","volume":"11","author":"M. Laguna","year":"1999","unstructured":"Laguna, M. and R. Mart\u00ec. (1999). \u201cGRASP and path relinking for the 2-layer straight line crossing minimization.\u201d INFORMS Journal on Computing 11, 44\u201352.","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"7000_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"T.L. Magnanti","year":"1984","unstructured":"Magnanti, T.L. and R.T. Wong. (1984). \u201cNetwork design and transportation planning: Models and algorithms.\u201d Transportation Science 18(1), 1\u201355.","journal-title":"Transportation Science"},{"key":"7000_CR22","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/S0191-2615(00)00036-9","volume":"36","author":"Q. Meng","year":"2002","unstructured":"Meng, Q. and H. Yang. (2002). \u201cBenefit distribution and equity in road network design.\u201d Transportation Research Part B 36, 19\u201335.","journal-title":"Transportation Research Part B"},{"key":"7000_CR23","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/(SICI)1097-0037(199703)29:2<125::AID-NET7>3.0.CO;2-L","volume":"29","author":"S. Pallottino","year":"1997","unstructured":"Pallottino, S. and M.G. Scutell\u00e0. (1997). \u201cDual algorithms for the shortest path tree problem.\u201d Networks 29, 125\u2013133.","journal-title":"Networks"},{"key":"7000_CR24","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0167-6377(02)00192-X","volume":"31","author":"S. Pallottino","year":"2003","unstructured":"Pallottino, S. and M.G. Scutell\u00e0. (2003). \u201cA new algorithm for reoptimizing shortest paths when the arc costs change.\u201d Operations Research Letters 31, 149\u2013160.","journal-title":"Operations Research Letters"},{"issue":"3","key":"7000_CR25","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/ijoc.12.3.164.12639","volume":"12","author":"M. Prais","year":"2000","unstructured":"Prais, M. and C.C. Ribeiro. (2000). \u201cReactive GRASP: An application to a Matrix Decomposition Problem in TDMA traffic assignment.\u201d INFORMS Journal on Computing 12(3), 164\u2013176.","journal-title":"INFORMS Journal on Computing"},{"key":"7000_CR26","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1023\/A:1009677613792","volume":"4","author":"M.G.C. Resende","year":"1998","unstructured":"Resende, M.G.C. (1998). \u201cComputing approximate solutions of the maximum covering problem using GRASP.\u201d Journal of Heuristics 4, 161\u2013171.","journal-title":"Journal of Heuristics"},{"key":"7000_CR27","unstructured":"Resende, M.G.C. and C.C. Ribeiro. (2002). \u201cGreedy randomized adaptive search procedures.\u201d In F. Glover and G. Kochenberger (eds.), State-of-the-Art Handbook of Metaheuristics, Kluwer Academic Publishers, pp. 219\u2013249."},{"key":"7000_CR28","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1002\/net.10065","volume":"41","author":"M.G.C. Resende","year":"2003","unstructured":"Resende, M.G.C. and C.C. Ribeiro. (2003). \u201cGRASP with path-relinking for private virtual circuit routing.\u201d Networks 41, 104\u2013114.","journal-title":"Networks"},{"key":"7000_CR29","volume-title":"A GRASP with path-relinking for the p-median problem","author":"M.G.C. Resende","year":"2002","unstructured":"Resende, M.G.C. and R.F. Werneck. (2002). \u201cA GRASP with path-relinking for the p-median problem.\u201d Technical Report, AT&T Labs Research, Florham Park, NJ."},{"key":"7000_CR30","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1287\/ijoc.14.3.228.116","volume":"14","author":"C.C. Ribeiro","year":"2002","unstructured":"Ribeiro, C.C., E. Uchoa, and R.F. Werneck. (2002). \u201cA hybrid GRASP with perturbations for the Steiner problem in graphs.\u201d INFORMS Journal on Computing 14, 228\u2013246.","journal-title":"INFORMS Journal on Computing"},{"key":"7000_CR31","volume-title":"Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods","author":"Y. Sheffi","year":"1985","unstructured":"Sheffi, Y. (1985). Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods, Englewood Cliffs, NJ: Prentice-Hall."},{"issue":"3","key":"7000_CR32","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1080\/01441649808717016","volume":"18","author":"H. Yang","year":"1998","unstructured":"Yang, H. and M.G.H. Bell. (1998). \u201cModels and algorithms for road network design: A review and some new development.\u201d Transportation Reviews 18(3), 257\u2013258.","journal-title":"Transportation Reviews"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-005-7000-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-005-7000-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-005-7000-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:54:27Z","timestamp":1559256867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-005-7000-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,1]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,1]]}},"alternative-id":["7000"],"URL":"https:\/\/doi.org\/10.1007\/s10732-005-7000-4","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,1]]}}}