{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:53:42Z","timestamp":1774421622979,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,3,9]],"date-time":"2010-03-09T00:00:00Z","timestamp":1268092800000},"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":[[2011,4]]},"DOI":"10.1007\/s10732-010-9129-z","type":"journal-article","created":{"date-parts":[[2010,3,8]],"date-time":"2010-03-08T11:52:48Z","timestamp":1268049168000},"page":"119-152","source":"Crossref","is-referenced-by-count":51,"title":["A reactive GRASP with path relinking for capacitated clustering"],"prefix":"10.1007","volume":"17","author":[{"given":"Yumin","family":"Deng","sequence":"first","affiliation":[]},{"given":"Jonathan F.","family":"Bard","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,3,9]]},"reference":[{"key":"9129_CR1","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0167-8655(95)00122-0","volume":"173","author":"K.S. Al-Sultan","year":"1996","unstructured":"Al-Sultan, K.S., Khan, M.M.: Computational experience on four algorithms for the hard clustering problem. Pattern Recogn. Lett. 173, 295\u2013308 (1996)","journal-title":"Pattern Recogn. Lett."},{"issue":"1","key":"9129_CR2","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.ejor.2003.08.066","volume":"162","author":"S. Ahmadi","year":"2005","unstructured":"Ahmadi, S., Osman, I.H.: Greedy random adaptive memory programming search for the capacitated clustering problem. Eur. J. Oper. Res. 162(1), 30\u201344 (2005)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"9129_CR3","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1016\/j.trb.2008.10.003","volume":"43","author":"J.F. Bard","year":"2009","unstructured":"Bard, J.F., Jarrah, A.I.: Large-scale constrained clustering for rationalizing pickup and delivery operations. Transp. Res. Part B: Methodol. 43(5), 542\u2013561 (2009)","journal-title":"Transp. Res. Part B: Methodol."},{"key":"9129_CR4","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1016\/j.ejor.2005.06.074","volume":"179","author":"S. Barreto","year":"2006","unstructured":"Barreto, S., Ferreira, C., Paixao, J., Santos, B.S.: Using clustering analysis in a capacitated location-routing problem. Eur. J. Oper. Res. 179, 968\u2013977 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"9129_CR5","doi-asserted-by":"crossref","first-page":"3402","DOI":"10.1016\/j.cor.2006.02.005","volume":"34","author":"M. Boudia","year":"2006","unstructured":"Boudia, M., Louly, M.A.O., Prins, C.: A reactive GRASP and path relinking for a combined production-distribution problem. Comput. Oper. Res. 34(11), 3402\u20133419 (2006)","journal-title":"Comput. Oper. Res."},{"key":"9129_CR6","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/978-3-642-95322-4_5","volume-title":"On the Complexity of Clustering Problem","author":"J. Brucker","year":"1978","unstructured":"Brucker, J.: On the Complexity of Clustering Problem. Lecture Notes in Economics and Mathematical Systems, vol.\u00a0157, pp. 45\u201354. Springer, Berlin\/Heidelberg (1978)"},{"key":"9129_CR7","first-page":"235","volume":"12","author":"J.R. Cano","year":"2002","unstructured":"Cano, J.R., Cardon, O., Herrera, F., Sanchez, L.: A greedy randomized adaptive search procedure applied to the clustering problem as an initialization process using k-means as a local search procedure. J.\u00a0Intell. Fuzzy Syst. 12, 235\u2013242 (2002)","journal-title":"J.\u00a0Intell. Fuzzy Syst."},{"issue":"2","key":"9129_CR8","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/S0377-2217(00)00320-9","volume":"135","author":"Y.-C. Chiou","year":"2001","unstructured":"Chiou, Y.-C., Lan, L.W.: Genetic clustering algorithms. Eur. J. Oper. Res. 135(2), 413\u2013427 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"9129_CR9","volume-title":"Logistics System Analysis","author":"C.F. Daganzo","year":"2005","unstructured":"Daganzo, C.F.: Logistics System Analysis, 4th edn. Springer, Berlin (2005)","edition":"4"},{"key":"9129_CR10","unstructured":"Deng, Y.: Combining mathematical programming and metaheuristics: an application to semiconductor manufacturing. Ph.D. dissertation, Graduate Program in Operations Research & Industrial Engineering, University of Texas, Austin (2009)"},{"key":"9129_CR11","first-page":"1","volume":"2","author":"T.A. Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedure. J. Glob. Optim. 2, 1\u201327 (1995)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"9129_CR12","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01581107","volume":"81","author":"C.E. Ferreira","year":"1998","unstructured":"Ferreira, C.E., Martin, A., de Souza, C.C., Weismantel, R., Wolsey, L.A.: The node capacitated graph partitioning problem: a computational study. Math. Program. 81(2), 229\u2013256 (1998)","journal-title":"Math. Program."},{"key":"9129_CR13","unstructured":"Frank, A.: On the edge-connectivity algorithm of Nagamochi and Ibaraki. Working paper, ARTEMIS-IMAG, Universit\u00e9 de Grenoble, Grenoble, France (1994)"},{"issue":"3","key":"9129_CR14","first-page":"653","volume":"29","author":"F. Glover","year":"2000","unstructured":"Glover, F., Laguna, M., Marti, R.: Fundamentals of scatter search and path relinking. Control Cybern. 29(3), 653\u2013684 (2000)","journal-title":"Control Cybern."},{"issue":"1","key":"9129_CR15","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01585164","volume":"62","author":"E.L. Johnson","year":"1993","unstructured":"Johnson, E.L., Mehrotra, A., Nemhauser, G.L.: Min-cut clustering. Math. Program. 62(1), 133\u2013151 (1993)","journal-title":"Math. Program."},{"issue":"2","key":"9129_CR16","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/S0031-3203(99)00216-2","volume":"34","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., Mladenovic, N.: J-means: a new local search heuristic for minimum sum of squares clustering. Pattern Recogn. 34(2), 405\u2013413 (2001)","journal-title":"Pattern Recogn."},{"issue":"5","key":"9129_CR17","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s10732-007-9047-x","volume":"14","author":"B. Hu","year":"2008","unstructured":"Hu, B., Leitner, M., Raidl, G.R.: Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. J. Heuristics 14(5), 473\u2013499 (2008)","journal-title":"J. Heuristics"},{"key":"9129_CR18","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316801","volume-title":"Finding Groups in Data: An Introductory to Cluster Analysis","author":"L. Kaufman","year":"1990","unstructured":"Kaufman, L., Roussweuw, P.: Finding Groups in Data: An Introductory to Cluster Analysis. Wiley, New York (1990)"},{"issue":"4","key":"9129_CR19","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1145\/234533.234534","volume":"43","author":"D.R. Karger","year":"1996","unstructured":"Karger, D.R., Stein, C.: A new approach to the minimum cut problem. J. ACM 43(4), 601\u2013640 (1996)","journal-title":"J. ACM"},{"issue":"1","key":"9129_CR20","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/ijoc.7.1.10","volume":"7","author":"G. Kontoravdis","year":"1995","unstructured":"Kontoravdis, G., Bard, J.F.: A GRASP for the vehicle routing problem with time windows. ORSA J. Comput. 7(1), 10\u201323 (1995)","journal-title":"ORSA J. Comput."},{"issue":"4","key":"9129_CR21","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0191-2615(89)90029-5","volume":"23","author":"S. Laporte","year":"1989","unstructured":"Laporte, S., Chapleau, S., Landry, P.-E., Mercure, H.: An algorithm for the design of mailbox collection routes in urban areas. Transp. Res. Part B: Methodol. 23(4), 271\u2013280 (1989)","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"6","key":"9129_CR22","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1016\/S0305-0548(03)00039-X","volume":"31","author":"L.A.N. Lorena","year":"2004","unstructured":"Lorena, L.A.N., Senne, E.L.F.: A column generation approach to capacitated p-median problems. Comput. Oper. Res. 31(6), 863\u2013876 (2004)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9129_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(98)00006-6","volume":"22","author":"A. Mehrotra","year":"1998","unstructured":"Mehrotra, A., Trick, M.A.: Cliques and clustering: a combinatorial approach. Oper. Res. Lett. 22(1), 1\u201312 (1998)","journal-title":"Oper. Res. Lett."},{"issue":"11","key":"9129_CR24","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovic","year":"1997","unstructured":"Mladenovic, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9129_CR25","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0377-2217(84)90155-3","volume":"18","author":"J.M. Mulvey","year":"1984","unstructured":"Mulvey, J.M., Beck, M.P.: Solving capacitated clustering problems. Eur. J. Oper. Res. 18(3), 339\u201348 (1984)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9129_CR26","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1137\/0405004","volume":"5","author":"H. Nagmochi","year":"1992","unstructured":"Nagmochi, H., Ibaraki, T.: Computing edge-connectivity in multigraphs and capaciated graphs. SIAM J. Discrete Math. 5(1), 54\u201366 (1992)","journal-title":"SIAM J. Discrete Math."},{"issue":"6","key":"9129_CR27","doi-asserted-by":"crossref","first-page":"1639","DOI":"10.1016\/j.cor.2004.11.011","volume":"33","author":"M. Negreiros","year":"2005","unstructured":"Negreiros, M., Palhano, A.: The capacitated centered clustering problem. Comput. Oper. Res. 33(6), 1639\u20131663 (2005)","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"9129_CR28","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0191-2615(86)90008-1","volume":"20B","author":"G.F. Newell","year":"1986","unstructured":"Newell, G.F., Daganzo, C.F.: Design of multiple-vehicle delivery tours\u2014I: a ring-radial network. Transp. Res. Part B: Methodol. 20B(5), 345\u2013363 (1986)","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"1","key":"9129_CR29","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1057\/palgrave.jors.2602135","volume":"58","author":"I.H. Osman","year":"2007","unstructured":"Osman, I.H., Ahmadi, S.: Guided construction search metaheuristics for the capacitated p-median problem with single source constraint. J. Oper. Res. Soc. 58(1), 100\u2013114 (2007)","journal-title":"J. Oper. Res. Soc."},{"issue":"10","key":"9129_CR30","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1016\/j.trb.2007.04.010","volume":"41","author":"Y. Ouyang","year":"2007","unstructured":"Ouyang, Y.: Design of vehicle routing zones for large-scale distribution systems. Transp. Res. Part B: Methodol. 41(10), 1079\u20131093 (2007)","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"3","key":"9129_CR31","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/ijoc.12.3.164.12639","volume":"12","author":"M. Prais","year":"1999","unstructured":"Prais, M., Ribeiro, C.C.: Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment. INFORMS J. Comput. 12(3), 164\u2013176 (1999)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"9129_CR32","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1287\/ijoc.1030.0048","volume":"17","author":"S. Rojanasoonthon","year":"2005","unstructured":"Rojanasoonthon, S., Bard, J.F.: A GRASP for parallel machine scheduling with time windows. INFORMS J. Comput. 17(1), 32\u201351 (2005)","journal-title":"INFORMS J. Comput."},{"issue":"10","key":"9129_CR33","doi-asserted-by":"crossref","first-page":"1396","DOI":"10.1287\/mnsc.47.10.1396.10265","volume":"47","author":"H.D. Sherali","year":"2001","unstructured":"Sherali, H.D., Smith, J.C.: Improving discrete model representations via symmetry considerations. Manag. Sci. 47(10), 1396\u20131407 (2001)","journal-title":"Manag. Sci."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9129-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-010-9129-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9129-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:54:31Z","timestamp":1559242471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-010-9129-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,9]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["9129"],"URL":"https:\/\/doi.org\/10.1007\/s10732-010-9129-z","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,9]]}}}