{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T15:46:13Z","timestamp":1762443973514},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T00:00:00Z","timestamp":1114905600000},"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,5]]},"DOI":"10.1007\/s10732-005-1509-4","type":"journal-article","created":{"date-parts":[[2005,8,31]],"date-time":"2005-08-31T06:00:37Z","timestamp":1125468037000},"page":"233-257","source":"Crossref","is-referenced-by-count":14,"title":["Grasp Embedded Scatter Search for the Multicommodity Capacitated Network Design Problem"],"prefix":"10.1007","volume":"11","author":[{"given":"Ada M.","family":"Alvarez","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 Luis","family":"Gonz\u00e1lez-Velarde","sequence":"additional","affiliation":[]},{"given":"Karim","family":"De-Alba","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1509_CR1","unstructured":"Alvarez, A., J.L. Gonz\u00e1lez-Velarde, and K. De Alba. (2001). \u201cScatter Search for the Multicommodity Capacited Network Design Problem.\u201d In Proceeding of 6th Annual International Conference on Industrial Engineering\u2013Theory, Aplications and Practice, San Francisco, CA, USA."},{"issue":"3","key":"1509_CR2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1009772208981","volume":"1","author":"M.F. Arg\u00fcello","year":"1997","unstructured":"Arg\u00fcello, M.F., J.F. Bard, and G. Yu. (1997). \u201cA Grasp for Aircraft Routing in Response to Groundings and Delays.\u201d Journal of Combinatorial Optimization 1(3), 211\u2013228.","journal-title":"Journal of Combinatorial Optimization"},{"key":"1509_CR3","unstructured":"Arr\u00e1iz, E., A. Mart\u00ednez, O. Meza, and M. Ortega. (2001). \u201cGRASP and Tabu Search Algorithms for Computing the Forwarding Index in a Graph.\u201d In Proceedings of MIC 2001, Porto, Portugal, July, pp. 367\u2013370."},{"issue":"5","key":"1509_CR4","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1287\/opre.37.5.716","volume":"37","author":"A. Balakrishnan","year":"1989","unstructured":"Balakrishnan, A. and T.L. Magnanti. (1989). \u201cA Dual Ascent Procedure for Large-Scale Uncapacitated Network Design.\u201d Operations Research 37(5), 716\u2013740.","journal-title":"Operations Research"},{"key":"1509_CR5","first-page":"58","volume-title":"Essays and Surveys on Metaheuristics","author":"S. Binato","year":"2002","unstructured":"Binato, S., W.J. Hery, D. Loewenstern, and M.G.C. Resende. (2002). \u201cA Greedy Randomized Adaptive Search Procedure for Job Shop Scheduling.\u201d In Ribeiro, C. and Hansen, P. (eds.), Essays and Surveys on Metaheuristics, Kluwer, Boston, USA, pp. 58\u201379."},{"key":"1509_CR6","first-page":"331","volume-title":"New Ideas in Optimization","author":"V. Campos","year":"1999","unstructured":"Campos, V., M. Laguna, and R. Mart\u00ed. (1999). \u201cScatter Search for the Linear Ordering Problem.\u201d In D. Corne, M. Dorigo, and F. Glover (eds.), New Ideas in Optimization, McGraw-Hill: New York, USA, pp. 331\u2013339."},{"key":"1509_CR7","first-page":"30","volume-title":"Applications of Evolutionary Computing, Lecture Notes in Computer Science, Vol. 2037","author":"P. Chardaire","year":"2001","unstructured":"Chardaire, P., G.P. McKeown, and J.A. Maki. (2001). \u201cApplication of GRASP to the Multiconstraint Knapsack Problem.\u201d In E.J.W. Boers, J. Gottlieb, P.L. Lanzi, R.E. Smith, S. Cagnoni, E. Hart, G.R. Raidl, and H. Tijink, (eds.), Applications of Evolutionary Computing, Lecture Notes in Computer Science, Vol. 2037, Springer, Heidelberg: Germany, pp. 30\u201339."},{"key":"1509_CR8","volume-title":"ILOG CPLEX 7.1 Reference Manual","author":"CPLEX Optimization, Inc","year":"1999","unstructured":"CPLEX Optimization, Inc. (1999). ILOG CPLEX 7.1 Reference Manual. Incline Village, NV: USA."},{"issue":"1\u20133","key":"1509_CR9","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0166-218X(00)00310-3","volume":"112","author":"T.G. Crainic","year":"2001","unstructured":"Crainic, T.G., A. Frangioni, and B. Gendron. (2001). \u201cBundle-Based Relaxation Methods for Multicommodity Capacitated Fixed Charge Network Design.\u201d Discrete Applied Mathematics 112(1\u20133), 73\u201379.","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"1509_CR10","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1287\/ijoc.12.3.223.12638","volume":"12","author":"T.G. Crainic","year":"2000","unstructured":"Crainic, T.G., M. Gendreau, and J. Farvolden. (2000). \u201cA Simplex-Based Tabu Search Method for Capacitated Network Design.\u201d INFORMS Journal on Computing 12(3), 223\u2013236.","journal-title":"INFORMS Journal on Computing"},{"key":"1509_CR11","unstructured":"Delgado, C., M. Laguna, and J. Pacheco. (2004). \u201cMinimizing Labor Requirements in a Periodic Vehicle Loading Problem.\u201d To appear in Computational Optimization and Applications."},{"issue":"2","key":"1509_CR12","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(2), 67\u201371.","journal-title":"Operations Research Letters"},{"issue":"2","key":"1509_CR13","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 Aaptive Search Procedures.\u201d Journal of Global Optimization 6(2), 109\u2013133.","journal-title":"Journal of Global Optimization"},{"issue":"1","key":"1509_CR14","first-page":"81","volume":"5","author":"E. Fern\u00e1ndez","year":"1999","unstructured":"Fern\u00e1ndez, E. and R. Mart\u00ed. (1999). \u201cGRASP for Seam Drawing in Mosaicking of Aerial Photographic Maps.\u201d Journal of Heuristics 5(1), 81\u2013197.","journal-title":"Journal of Heuristics"},{"issue":"2","key":"1509_CR15","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1287\/ijoc.11.2.198","volume":"11","author":"C. Fleurent","year":"1999","unstructured":"Fleurent, C. and F. Glover. (1999) \u201cImproved Constructive Multistart Strategies for the Quadratic Assignment Problem using Adaptive Memory.\u201d INFORMS Journal on Computing 11(2), 198\u2013204.","journal-title":"INFORMS Journal on Computing"},{"key":"1509_CR16","unstructured":"Gendron, B. and T.G. Crainic. (1996). \u201cBounding Procedures for Multicommodity Capacitated Fixed Charge Network Design Problems.\u201d Publication CRT-96-06. Centre de Recherche sur le Transport, Universit\u00e9 de Montr\u00e9al, Montreal, Canada, January."},{"key":"1509_CR17","unstructured":"Gendron, B. and T.G. Crainic. (1994a). \u201cParallel Implementations of Bounding Procedures for Multicommodity Capacitated Network Design Problems.\u201d Publication CRT-94-45. Centre de Recherche sur le Transport, Universit\u00e9 de Montr\u00e9al, Montreal, Canada, September."},{"key":"1509_CR18","unstructured":"Gendron, B. and T.G. Crainic. (1994b). \u201cRelaxations for Multicommodity Capacitated Network Design Problems.\u201d Publication CRT-965. Centre de Recherche sur le Transport, Universit\u00e9 de Montr\u00e9al, Montreal, Canada, February."},{"key":"1509_CR19","doi-asserted-by":"crossref","unstructured":"Glover, F. (1998). \u201cA Template for Scatter search and path relinking.\u201d In J.K. Hao, E. Lutton, E. Ronald, M. Schoenauer, and D. Snyers, (eds.), Artificial Evolution: Third European Conference, Lecture Notes in Computer Science, Vol. 1363, Springer, Heidelberg, Germany, pp. 13\u201354.","DOI":"10.1007\/BFb0026589"},{"issue":"4","key":"1509_CR20","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1016\/0377-2217(95)00305-3","volume":"95","author":"J.W. Herrmann","year":"1996","unstructured":"Herrmann, J.W., G. Ioannou, I. Minis, J.M. y Proth. (1996). \u201cA Dual Ascent Approach to the Fixed-Charge Capacitated Network Design Problem.\u201d European Journal of Operational Research 95(4), 476\u2013490.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"1509_CR21","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/net.3230190304","volume":"19","author":"D.S. Hochbaum","year":"1989","unstructured":"Hochbaum, D.S. and y Segev A. (1989). \u201cAnalysis of a Flow Problem with Fixed Charges.\u201d Networks, 19(3), 291\u2013312.","journal-title":"Networks"},{"issue":"2","key":"1509_CR22","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1287\/opre.46.2.247","volume":"46","author":"K. Holmberg","year":"1998","unstructured":"Holmberg, K. and J. Hellstrand. (1998). \u201cSolving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound.\u201d Operations Research 46(2), 247\u2013258.","journal-title":"Operations Research"},{"issue":"3","key":"1509_CR23","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. and D. Yuan. (2000). \u201cA Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem.\u201d Operations Research 48(3), 461\u2013481.","journal-title":"Operations Research"},{"issue":"4","key":"1509_CR24","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, H.G. y Rinnooy. (1978). \u201cThe Complexity of the Network Design Problem.\u201d Networks 8(4), 279\u2013285.","journal-title":"Networks"},{"key":"1509_CR25","unstructured":"Laguna M. (2002). \u201cScatter Search.\u201d In P.M. Pardalos, and M.G.C. Resende, (eds.), Handbook of Applied Optimization. pp. 183\u2013193."},{"key":"1509_CR26","unstructured":"Laguna, M. and V.A. Armentano. (2004). \u201cLessons from Applying and Experimenting with Scatter Search.\u201d In C. Rego and A. Bahram, (eds.), Adaptive Memory and Evolution: Tabu Search and Scatter Search. Kluwer, (in press)."},{"key":"1509_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0337-8","volume-title":"Scatter Search Methodology and Implementations in C","author":"M. Laguna","year":"2003","unstructured":"Laguna, M. and R. Mart\u00ed. (2003). Scatter Search Methodology and Implementations in C. Kluwer, Boston, USA."},{"key":"1509_CR28","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","volume":"18","author":"E.L. Lawler","year":"1972","unstructured":"Lawler, E.L. (1972). \u201cA Procedure for Computing the K Best Solutions to Discrete Optimization Problems and its Application to the Shortest Path Problem.\u201d Management Science 18, 401\u2013405.","journal-title":"Management Science"},{"key":"1509_CR29","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/BFb0121090","volume":"26","author":"T. Magnanti","year":"1986","unstructured":"Magnanti, T., P. Mireault, and R. Wong. (1986). \u201cTailoring Benders Decomposition for Uncapacitated Network Design.\u201d Mathematical Programming Study, 26 112\u2013154.","journal-title":"Mathematical Programming Study"},{"issue":"1","key":"1509_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"T. Magnanti","year":"1984","unstructured":"Magnanti, T. and R. Wong. (1984). \u201cNetwork Design and Transportation Planning: Models and Algorithms.\u201d Transportation Science 18(1) 1\u201355.","journal-title":"Transportation Science"},{"key":"1509_CR31","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/978-1-4615-4567-5_12","volume-title":"Computing Tools for Modeling Optimization and Simulation: Interphases in Computer Science and Operations Research","author":"R. Mart\u00ed","year":"2000","unstructured":"Mart\u00ed, R., H. Louren\u00e7o, and M. Laguna. (2000). \u201cAssigning Proctors to Exams with Scatter Search.\u201d In M. Laguna and J.L. Gonz\u00e1lez-Velarde, (eds.), Computing Tools for Modeling Optimization and Simulation: Interphases in Computer Science and Operations Research. Kluwer: Boston, USA. pp. 215-227."},{"key":"1509_CR32","volume-title":"Handbook of Applied Optimization","author":"P. Moscato","year":"2000","unstructured":"Moscato, P. (2000). Memetic Algorithms. In P.M. Pardalos and M.G.C. Resende, (eds.), Handbook of Applied Optimization. Oxford University Press, USA."},{"key":"1509_CR33","unstructured":"Pacheco, J.A. and S. Casado. (2004). \u201cSolving Two Location Models with Few Facilities by Using a Hybrid Heuristic.\u201d A real health resource case. (In Press) Computers and Operation Research No 113."},{"issue":"3","key":"1509_CR34","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1016\/S0377-2217(99)00272-6","volume":"125","author":"V. Sridhar","year":"2000","unstructured":"Sridhar, V. and J.S. Park. (2000). \u201cBenders-and-Cut Algorithm for Fixed-Charge Capacitated Network Design Problem.\u201d European Journal of Operational Research 125(3), 622\u2013632.","journal-title":"European Journal of Operational Research"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-005-1509-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-005-1509-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-1509-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:54:26Z","timestamp":1559242466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-005-1509-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,5]]}},"alternative-id":["1509"],"URL":"https:\/\/doi.org\/10.1007\/s10732-005-1509-4","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,5]]}}}