{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:29:07Z","timestamp":1725701347873},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642333071"},{"type":"electronic","value":"9783642333088"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33308-8_3","type":"book-chapter","created":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T21:33:52Z","timestamp":1346535232000},"page":"24-37","source":"Crossref","is-referenced-by-count":3,"title":["Computational Study of Four Genetic Algorithm Variants for Solving the Quadratic Assignment Problem"],"prefix":"10.1007","author":[{"given":"Alfonsas","family":"Misevicius","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evaldas","family":"Guogis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1016\/S0305-0548(99)00067-2","volume":"27","author":"R.K. Ahuja","year":"2000","unstructured":"Ahuja, R.K., Orlin, J.B., Tiwari, A.: A greedy genetic algorithm for the quadratic assignment problem. Comp. & Oper. Res.\u00a027, 917\u2013934 (2000)","journal-title":"Comp. & Oper. Res."},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1109\/TEVC.2002.800880","volume":"6","author":"E. Alba","year":"2002","unstructured":"Alba, E., Tomassini, M.: Parallelism and evolutionary algorithms. IEEE Trans. Evol. Comput.\u00a06, 443\u2013462 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.cor.2009.09.019","volume":"38","author":"A. Barrios","year":"2011","unstructured":"Barrios, A., Ballest\u00edn, F., Valls, V.: A double genetic algorithm for the MRCPSP\/max. Comp. & Oper. Res.\u00a038, 33\u201343 (2011)","journal-title":"Comp. & Oper. Res."},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"R.E. Burkard","year":"1997","unstructured":"Burkard, R.E., Karisch, S., Rendl, F.: QAPLIB \u2013 a quadratic assignment problem library. J. Glob. Optim.\u00a010, 391\u2013403 (1997), http:\/\/www.seas.upenn.edu\/qaplib (cited April 25, 2012)","journal-title":"J. Glob. Optim."},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1023\/A:1011375326814","volume":"7","author":"E. Cant\u00fa-Paz","year":"2001","unstructured":"Cant\u00fa-Paz, E.: Migration policies, selection pressure, and parallel evolutionary algorithms. J. Heurist.\u00a07, 311\u2013334 (2001)","journal-title":"J. Heurist."},{"key":"3_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2787-6","volume-title":"The Quadratic Assignment Problem: Theory and Algorithms","author":"E. \u00c7ela","year":"1998","unstructured":"\u00c7ela, E.: The Quadratic Assignment Problem: Theory and Algorithms. Kluwer, Dordrecht (1998)"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1016\/j.engappai.2010.01.021","volume":"23","author":"H. Cheng","year":"2010","unstructured":"Cheng, H., Yang, S.: Genetic algorithms with immigrants schemes for dynamic multicast problems in mobile ad hoc networks. Eng. Appl. Artif. Intel.\u00a023, 806\u2013819 (2010)","journal-title":"Eng. Appl. Artif. Intel."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1287\/ijoc.15.3.320.16076","volume":"15","author":"Z. Drezner","year":"2003","unstructured":"Drezner, Z.: A new genetic algorithm for the quadratic assignment problem. INFORMS J. Comput.\u00a015, 320\u2013330 (2003)","journal-title":"INFORMS J. Comput."},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.orl.2004.11.001","volume":"33","author":"Z. Drezner","year":"2005","unstructured":"Drezner, Z.: Compounded genetic algorithms for the quadratic assignment problem. Oper. Res. Lett.\u00a033, 475\u2013480 (2005)","journal-title":"Oper. Res. Lett."},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1016\/j.cor.2006.05.004","volume":"35","author":"Z. Drezner","year":"2008","unstructured":"Drezner, Z.: Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem. Comp. & Oper. Res.\u00a035, 717\u2013736 (2008)","journal-title":"Comp. & Oper. Res."},{"key":"3_CR11","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/978-1-4757-4137-7_12","volume-title":"Metaheuristics: Computer Decision-Making (Applied Optimization)","author":"Z. Drezner","year":"2003","unstructured":"Drezner, Z., Marcoulides, G.A.: A distance-based selection of parents in genetic algorithms. In: Resende, M.G.C., de Sousa, J.P. (eds.) Metaheuristics: Computer Decision-Making (Applied Optimization), pp. 257\u2013278. Kluwer, Norwell (2003)"},{"key":"3_CR12","first-page":"124","volume":"13","author":"T.A. El-Mihoub","year":"2006","unstructured":"El-Mihoub, T.A., Hopgood, A.A., Nolle, L., Battersby, A.: Hybrid genetic algorithms: a review. Eng. Lett.\u00a013, 124\u2013137 (2006)","journal-title":"Eng. Lett."},{"key":"3_CR13","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)"},{"key":"3_CR14","first-page":"493","volume":"3","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E., Deb, K., Korb, B.: Messy genetic algorithms: Motivation, analysis and first results. Compl. Syst.\u00a03, 493\u2013530 (1989)","journal-title":"Compl. Syst."},{"key":"3_CR15","volume-title":"Adaptation in Natural and Artificial Systems","author":"J.H. Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1109\/4235.930311","volume":"5","author":"S.A. Kazarlis","year":"2001","unstructured":"Kazarlis, S.A., Papadakis, S.E., Theocharis, J.B.: Microgenetic algorithms as generalized hill-climbing operators for GA optimization. IEEE Trans. Evol. Comput.\u00a05, 204\u2013217 (2001)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"T. Koopmans","year":"1957","unstructured":"Koopmans, T., Beckmann, M.: Assignment problems and the location of economic activities. Econometrica\u00a025, 53\u201376 (1957)","journal-title":"Econometrica"},{"key":"3_CR18","series-title":"STUDFUZZ","volume-title":"Recent Advances in Memetic Algorithms","year":"2004","unstructured":"Hart, W., Krasnogor, N., Smith, J. (eds.): Recent Advances in Memetic Algorithms. STUDFUZZ, vol.\u00a0166. Springer, Heidelberg (2004)"},{"key":"3_CR19","first-page":"2734","volume-title":"Proceedings of the IEEE World Congress on Computational Intelligence (CEC 2010)","author":"T.V. Luong","year":"2010","unstructured":"Luong, T.V., Melab, N., Talbi, E.-G.: Parallel hybrid evolutionary algorithms on GPU. In: Proceedings of the IEEE World Congress on Computational Intelligence (CEC 2010), pp. 2734\u20132741. IEEE Press, Barcelona (2010)"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/4235.887234","volume":"4","author":"P. Merz","year":"2000","unstructured":"Merz, P., Freisleben, B.: Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Trans. Evol. Comput.\u00a04, 337\u2013352 (2000)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.knosys.2004.03.001","volume":"17","author":"A. Misevicius","year":"2004","unstructured":"Misevicius, A.: An improved hybrid genetic algorithm: new results for the quadratic assignment problem. Knowl.-Based Syst.\u00a017, 65\u201373 (2004)","journal-title":"Knowl.-Based Syst."},{"key":"3_CR22","first-page":"91","volume-title":"Research and Development in Intelligent Systems, Proceedings of AI 2008, the Twenty-Eighth SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence","author":"A. Misevicius","year":"2008","unstructured":"Misevicius, A.: Restart-based genetic algorithm for the quadratic assignment problem. In: Bramer, M., Coenen, F., Petridis, M. (eds.) Research and Development in Intelligent Systems, Proceedings of AI 2008, the Twenty-Eighth SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence, pp. 91\u2013104. Springer, London (2008)"},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/s00291-011-0274-z","volume":"34","author":"A. Misevicius","year":"2012","unstructured":"Misevicius, A.: An implementation of the iterated tabu search algorithm for the quadratic assignment problem. OR Spectrum\u00a034, 665\u2013690 (2012), doi:10.1007\/s00291-011-0274-z","journal-title":"OR Spectrum"},{"key":"3_CR24","doi-asserted-by":"crossref","first-page":"255","DOI":"10.15388\/Informatica.2009.249","volume":"20","author":"A. Misevi\u010dius","year":"2009","unstructured":"Misevi\u010dius, A., Rubliauskas, D.: Testing of hybrid genetic algorithms for structured quadratic assignment problems. Informatica\u00a020, 255\u2013272 (2009)","journal-title":"Informatica"},{"key":"3_CR25","first-page":"157","volume-title":"Handbook of Applied Optimization","author":"P. Moscato","year":"2002","unstructured":"Moscato, P.: Memetic algorithms. In: Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Applied Optimization, pp. 157\u2013167. Oxford University Press, Oxford (2002)"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Reeves, C.R., Rowe, J.E.: Genetic Algorithms: Principles and Perspectives. Kluwer, Norwell (2001)","DOI":"10.1007\/b101880"},{"key":"3_CR27","doi-asserted-by":"publisher","first-page":"2655","DOI":"10.1016\/j.ins.2007.01.003","volume":"177","author":"L.M. San Jos\u00e9-Revuelta","year":"2007","unstructured":"San Jos\u00e9-Revuelta, L.M.: A new adaptive genetic algorithm for fixed channel assignment. Inform. Sci.\u00a0177, 2655\u20132678 (2007)","journal-title":"Inform. Sci."},{"key":"3_CR28","first-page":"51","volume-title":"Proceedings of the 3rd International Conference on Genetic Algorithms","author":"J.D. Schaffer","year":"1989","unstructured":"Schaffer, J.D., Caruana, R.A., Eshelman, L.J.: A study of control parameters affecting online performance of genetic algorithms. In: Schaffer, J.D. (ed.) Proceedings of the 3rd International Conference on Genetic Algorithms, pp. 51\u201360. Morgan Kaufmann, San Mateo (1989)"},{"key":"3_CR29","volume-title":"Introduction to Genetic Algorithms","author":"S.N. Sivanandam","year":"2008","unstructured":"Sivanandam, S.N., Deepa, S.N.: Introduction to Genetic Algorithms. Springer, Heidelberg (2008)"},{"key":"3_CR30","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E.D. Taillard","year":"1991","unstructured":"Taillard, E.D.: Robust taboo search for the QAP. Parallel Comput.\u00a017, 443\u2013455 (1991)","journal-title":"Parallel Comput."},{"key":"3_CR31","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0966-8349(95)00008-6","volume":"3","author":"E.D. Taillard","year":"1995","unstructured":"Taillard, E.D.: Comparison of iterative searches for the quadratic assignment problem. Locat. Sci.\u00a03, 87\u2013105 (1995)","journal-title":"Locat. Sci."},{"key":"3_CR32","first-page":"1399","volume":"2","author":"J. Tang","year":"2006","unstructured":"Tang, J., Lim, M.H., Ong, Y.S., Er, M.J.: Parallel memetic algorithms with selective local search for large scale quadratic assignment problems. Int. J. Innov. Comput., Inform. Control\u00a02, 1399\u20131415 (2006)","journal-title":"Int. J. Innov. Comput., Inform. Control"},{"key":"3_CR33","unstructured":"Wu, Y., Ji, P.: Solving the quadratic assignment problems by a genetic algorithm with a new replacement strategy. In: Proceedings of World Academy of Science, Engineering and Technology, WASET, vol.\u00a024, pp. 310\u2013314 (2007)"},{"key":"3_CR34","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1145\/1143997.1144103","volume-title":"Proceedings of Genetic and Evolutionary Computation Conference, GECCO 2006","author":"Y.-L. Xu","year":"2006","unstructured":"Xu, Y.-L., Lim, M.H., Ong, Y.S., Tang, J.: A GA-ACO-local search hybrid algorithm for solving quadratic assignment problem. In: Keijzer, M., et al. (eds.) Proceedings of Genetic and Evolutionary Computation Conference, GECCO 2006, vol.\u00a01, pp. 599\u2013605. ACM Press, New York (2006)"},{"key":"3_CR35","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10732-006-9005-z","volume":"13","author":"X. Zhao","year":"2007","unstructured":"Zhao, X., Gao, X.-S.: Affinity genetic algorithm. J. Heurist.\u00a013, 133\u2013150 (2007)","journal-title":"J. Heurist."}],"container-title":["Communications in Computer and Information Science","Information and Software Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33308-8_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:04:12Z","timestamp":1620129852000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33308-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642333071","9783642333088"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33308-8_3","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2012]]}}}