{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:32:12Z","timestamp":1740547932592,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642158438"},{"type":"electronic","value":"9783642158445"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15844-5_55","type":"book-chapter","created":{"date-parts":[[2010,9,13]],"date-time":"2010-09-13T08:01:09Z","timestamp":1284364869000},"page":"546-555","source":"Crossref","is-referenced-by-count":4,"title":["Ant Based Hyper Heuristics with Space Reduction: A Case Study of the p-Median Problem"],"prefix":"10.1007","author":[{"given":"Zhilei","family":"Ren","sequence":"first","affiliation":[]},{"given":"He","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Jifeng","family":"Xuan","sequence":"additional","affiliation":[]},{"given":"Zhongxuan","family":"Luo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"55_CR1","volume-title":"Handbook of Metaheuristics, International Series in Operations Research & Management Science","author":"E.K. Burke","year":"2009","unstructured":"Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., Ozcan, E., Woodward, J.R.: A Classification of Hyper-heuristics Approaches. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics, International Series in Operations Research & Management Science. Springer, Heidelberg (2009) (in press)"},{"issue":"1","key":"55_CR2","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ejor.2005.08.012","volume":"176","author":"E.K. Burke","year":"2007","unstructured":"Burke, E.K., McCollum, B., Meisels, A., Petrovic, S., Qu, R.: A Graph-based Hyper-heuristic for Educational Timetabling Problems. European Journal of Operational Research\u00a0176(1), 177\u2013192 (2007)","journal-title":"European Journal of Operational Research"},{"key":"55_CR3","doi-asserted-by":"crossref","unstructured":"Privosnik, M.: The Scalability of Evolved On Line Bin Packing Heuristics. In: IEEE Congress on Evolutionary Computation, CEC 2007, pp. 2530\u20132537 (2007)","DOI":"10.1109\/CEC.2007.4424789"},{"key":"55_CR4","doi-asserted-by":"crossref","unstructured":"Burke, E.K., Kendall, G., Silva, D.L., O\u2019Brien, R., Soubeiga, E.: An Ant Algorithm Hyperheuristic for the Project Presentation Scheduling Problem. In: The 2005 IEEE Congress on Evolutionary Computation, vol.\u00a03, pp. 2263\u20132270 (2005)","DOI":"10.1109\/CEC.2005.1554976"},{"key":"55_CR5","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/11554028_91","volume-title":"Knowledge-Based Intelligent Information and Engineering Systems","author":"A. Cuesta-Ca\u00f1ada","year":"2005","unstructured":"Cuesta-Ca\u00f1ada, A., Garrido, L., Terashima-Mar\u00edn, H.: Building Hyper-heuristics Through Ant Colony Optimization for the 2D Bin Packing Problem. In: Knowledge-Based Intelligent Information and Engineering Systems, pp. 654\u2013660. Springer, Heidelberg (2005)"},{"key":"55_CR6","doi-asserted-by":"crossref","unstructured":"Chen, P.C., Kendall, G., Berghe, G.: An Ant Based Hyper-heuristic for the Travelling Tournament Problem. In: IEEE Symposium on Computational Intelligence in Scheduling, SCIS 2007, pp. 19\u201326 (2007)","DOI":"10.1109\/SCIS.2007.367665"},{"key":"55_CR7","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1090.001.0001","volume-title":"Adaptation in Natural and Artificial Systems","author":"J.H. Holland","year":"1992","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems. MIT Press, Cambridge (1992)"},{"issue":"1","key":"55_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man, and Cybernetics, Part B\u00a026(1), 29\u201341 (1996)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B"},{"key":"55_CR9","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F.: Tabu search \u2013 Part I. ORSA J. on Computing\u00a01, 190\u2013206 (1989)","journal-title":"ORSA J. on Computing"},{"key":"55_CR10","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover, F.: Tabu search \u2013 Part II. ORSA J. on Computing\u00a02, 4\u201332 (1990)","journal-title":"ORSA J. on Computing"},{"issue":"3","key":"55_CR11","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable Neighborhood Search: Principles and Applications. European Journal of Operational Research\u00a0130(3), 449\u2013467 (2001)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"55_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy Randomized Adaptive Search Procedures. Journal of Global Optimization\u00a06(2), 109\u2013133 (1995)","journal-title":"Journal of Global Optimization"},{"issue":"1","key":"55_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(00)00268-X","volume":"135","author":"\u00c9.D. Taillard","year":"2001","unstructured":"Taillard, \u00c9.D., Gambardella, L.M., Gendreau, M., Potvin, J.Y.: Adaptive Memory Programming: A Unified View of Metaheuristics. European Journal of Operational Research\u00a0135(1), 1\u201316 (2001)","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"55_CR14","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/BF02125421","volume":"63","author":"I.H. Osman","year":"1996","unstructured":"Osman, I.H., Laporte, G.: Metaheuristics: A Bibliography. Annals of Operations Research\u00a063(5), 511\u2013623 (1996)","journal-title":"Annals of Operations Research"},{"key":"55_CR15","first-page":"130","volume-title":"Handbook of Applied Optimization","author":"\u00c9.D. Taillard","year":"2002","unstructured":"Taillard, \u00c9.D.: Ant Systems. In: Pardalos, P., Resende, M.G.C. (eds.) Handbook of Applied Optimization, pp. 130\u2013137. Oxford Univ. Press, Oxford (2002)"},{"issue":"4","key":"55_CR16","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0966-8349(98)00030-8","volume":"5","author":"P. Hansen","year":"1997","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable Neighborhood Search for the p-Median. Location Science\u00a05(4), 207\u2013226 (1997)","journal-title":"Location Science"},{"issue":"1","key":"55_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2298\/YJOR0501053K","volume":"15","author":"Y. Kochetov","year":"2005","unstructured":"Kochetov, Y., Levanova, T., Alekseeva, E., Loresh, M.: Large Neighborhood Local Search for the p-Median Problem. Yugoslav Journal of Operations Research\u00a015(1), 53\u201363 (2005)","journal-title":"Yugoslav Journal of Operations Research"},{"key":"55_CR18","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/A:1026130003508","volume":"122","author":"O. Alp","year":"2003","unstructured":"Alp, O., Erkut, E., Drezner, Z.: An Efficient Genetic Algorithm for the p-Median Problem. Annals of Operations Research\u00a0122, 21\u201342 (2003)","journal-title":"Annals of Operations Research"},{"issue":"5","key":"55_CR19","doi-asserted-by":"publisher","first-page":"955","DOI":"10.1287\/opre.16.5.955","volume":"16","author":"M.B. Teitz","year":"1968","unstructured":"Teitz, M.B., Bart, P.: Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph. Operations Research\u00a016(5), 955\u2013961 (1968)","journal-title":"Operations Research"},{"issue":"1","key":"55_CR20","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/B:HEUR.0000019986.96257.50","volume":"10","author":"M.G.C. Resende","year":"2004","unstructured":"Resende, M.G.C., Werneck, R.F.: A Hybrid Heuristic for the p-Median Problem. Journal of Heuristics\u00a010(1), 59\u201388 (2004)","journal-title":"Journal of Heuristics"},{"key":"55_CR21","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0377-2217(85)90040-2","volume":"21","author":"J.E. Beasley","year":"1985","unstructured":"Beasley, J.E.: A Note on Solving Large p-Median Problems. European Journal of Operational Research\u00a021, 270\u2013273 (1985)","journal-title":"European Journal of Operational Research"},{"key":"55_CR22","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB\u2013A Traveling Salesman Problem Library. ORSA Journal on Computing\u00a03, 376\u2013384 (1991)","journal-title":"ORSA Journal on Computing"}],"container-title":["Parallel Problem Solving from Nature, PPSN XI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15844-5_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T18:47:09Z","timestamp":1740509229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15844-5_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642158438","9783642158445"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15844-5_55","relation":{},"subject":[],"published":{"date-parts":[[2010]]}}}