{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T14:13:26Z","timestamp":1762352006752},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642010194"},{"type":"electronic","value":"9783642010200"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01020-0_38","type":"book-chapter","created":{"date-parts":[[2009,4,20]],"date-time":"2009-04-20T00:01:38Z","timestamp":1240185698000},"page":"481-494","source":"Crossref","is-referenced-by-count":24,"title":["An Elitist GRASP Metaheuristic for the Multi-objective Quadratic Assignment Problem"],"prefix":"10.1007","author":[{"given":"Hui","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dario","family":"Landa-Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","series-title":"Series of Books in the Mathematical Sciences","volume-title":"Computers and Intractability : A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences. W. H. Freeman, New York (1979)"},{"key":"38_CR2","unstructured":"Knowles, J.D., Corne, D.W.: Towards landscape analyses to inform the design of hybrid local search for the multiobjective quadratic assignment problem. In: Soft Computing Systems - Design, Management and Applications (HIS 2002), pp. 271\u2013279 (2002)"},{"issue":"3","key":"38_CR3","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1016\/j.ejor.2004.08.024","volume":"169","author":"L. Paquete","year":"2006","unstructured":"Paquete, L., St\u00fctzle, T.: A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices. European Journal of Operational Research\u00a0169(3), 943\u2013959 (2006)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"38_CR4","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K. Deb","year":"2002","unstructured":"Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: \n                    \n                      \n                    \n                    $\\mbox{NSGA-II}$\n                  . IEEE Trans. on Evolutionary Computation\u00a06(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. on Evolutionary Computation"},{"key":"38_CR5","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the strength pareto evolutionary algorithm for multiobjective optimization. In: EUROGEN 2001 - Evolutionary Methods for Design, Optimisation and Control with Applications to Industrial Problems, Athens, Greece, pp. 95\u2013100 (2001)"},{"issue":"6","key":"38_CR6","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q. Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans. on Evolutionary Computation\u00a011(6), 712\u2013731 (2007)","journal-title":"IEEE Trans. on Evolutionary Computation"},{"key":"38_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0303-9_33","volume-title":"Tabu Search","author":"F. Glover","year":"1998","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Sun, J.: Iterated local search with guided mutation. In: The 2006 IEEE Congress on Evolutionary Computation (CEC 2006), Vancouver (2006)","DOI":"10.1109\/CEC.2006.1688410"},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T.A. Feo","year":"1989","unstructured":"Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters\u00a08, 67\u201371 (1989)","journal-title":"Operations Research Letters"},{"key":"38_CR10","volume-title":"The First International Conference on Quantitative Evaluation of Systems","author":"D.S. Vianna","year":"2004","unstructured":"Vianna, D.S., Arroyo, J.E.C.: A GRASP algorithm for the multi-objective knapsack problem. In: The First International Conference on Quantitative Evaluation of Systems. IEEE Computer Society, Los Alamitos (2004)"},{"key":"38_CR11","first-page":"3310","volume-title":"The 2008 IEEE Congress on Evolutionary Computation (CEC 2008)","author":"H. Li","year":"2008","unstructured":"Li, H., Landa-Silva, J.D.: Evolutionary multi-objective simulated annealing with adaptive and competitive search direction. In: The 2008 IEEE Congress on Evolutionary Computation (CEC 2008), Hong Kong, pp. 3310\u20133317. IEEE Press, Los Alamitos (2008)"},{"issue":"4-5","key":"38_CR12","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"\u00c9.D. Taillard","year":"1991","unstructured":"Taillard, \u00c9.D.: Robust taboo search for the quadratic assignment problem. Parallel Computing\u00a017(4-5), 443\u2013455 (1991)","journal-title":"Parallel Computing"},{"key":"38_CR13","unstructured":"Resende, M.G.C.: Metaheuristic hybridization with GRASP. In: Chen, Z.L., Raghavan, S. (eds.) Tutorials in Operations Research, INFORMS (2008)"},{"issue":"1","key":"38_CR14","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1002\/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6","volume":"7","author":"P. Czyzak","year":"1998","unstructured":"Czyzak, P., Jaszkiewicz, A.: Pareto-simulated annealinga metaheuristic technique for multi-objective combinatorial optimization. J. Multi-Criteria Decis. Anal.\u00a07(1), 34\u201347 (1998)","journal-title":"J. Multi-Criteria Decis. Anal."},{"key":"38_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/3-540-36970-8_21","volume-title":"Evolutionary Multi-Criterion Optimization","author":"J.D. Knowles","year":"2003","unstructured":"Knowles, J.D., Corne, D.W.: Instance generators and test suites for the multiobjective quadratic assignment problem. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Deb, K., Thiele, L. (eds.) EMO 2003. LNCS, vol.\u00a02632, pp. 295\u2013310. Springer, Heidelberg (2003)"},{"key":"38_CR16","first-page":"224","volume-title":"Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application","author":"I.M. Oliver","year":"1987","unstructured":"Oliver, I.M., Smith, D.J., Holland, J.R.C.: A study of permutation crossover operators on the traveling salesman problem. In: Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application, Hillsdale, NJ, USA, pp. 224\u2013230. L. Erlbaum Associates Inc., Mahwah (1987)"},{"issue":"3","key":"38_CR17","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.ejor.2004.08.028","volume":"169","author":"E.K. Burke","year":"2006","unstructured":"Burke, E.K., Landa-Silva, J.D.: The influence of the fitness evaluation method on the performance of multiobjective search algorithms. European Journal of Operational Research\u00a0169(3), 875\u2013897 (2006)","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"38_CR18","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1287\/ijoc.1060.0200","volume":"19","author":"J.D. Landa-Silva","year":"2007","unstructured":"Landa-Silva, J.D., Burke, E.K.: Asynchronous cooperative local search for the office space allocation problem. INFORMS Journal on Computing\u00a019(4), 575\u2013587 (2007)","journal-title":"INFORMS Journal on Computing"},{"key":"38_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-540-24838-5_27","volume-title":"Experimental and Efficient Algorithms","author":"C.A.S. Oliveira","year":"2004","unstructured":"Oliveira, C.A.S., Pardalos, P.M., Resende, M.G.C.: GRASP with path-relinking for the quadratic assignment problem. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol.\u00a03059, pp. 356\u2013368. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Multi-Criterion Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01020-0_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T16:42:52Z","timestamp":1551976972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01020-0_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642010194","9783642010200"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01020-0_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}