{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T21:56:36Z","timestamp":1773266196008,"version":"3.50.1"},"reference-count":76,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,10,2]],"date-time":"2014-10-02T00:00:00Z","timestamp":1412208000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s12293-014-0141-y","type":"journal-article","created":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T14:34:48Z","timestamp":1412174088000},"page":"241-254","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Incorporating domain-specific heuristics in a particle swarm optimization approach to the quadratic assignment problem"],"prefix":"10.1007","volume":"6","author":[{"given":"Ayah M.","family":"Helal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashraf M.","family":"Abdelbar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,2]]},"reference":[{"key":"141_CR1","doi-asserted-by":"crossref","unstructured":"Abdelbar A, Abdelshahid S (2003) Swarm optimization with instinct-driven particles. In: Proceedings of the 2003 IEEE congress on evolutionary computation, (CEC \u201903), vol 2. pp 777\u2013782","DOI":"10.1109\/CEC.2003.1299746"},{"key":"141_CR2","doi-asserted-by":"crossref","unstructured":"Abdelbar A, Abdelshahid S (2004) Instinct-based PSO with local search applied to satisfiability. In: Proceedings of the 2004 IEEE international joint conference on neural networks, (IJCNN \u201904), vol 3. pp 2291\u20132295","DOI":"10.1109\/IJCNN.2004.1380982"},{"issue":"4","key":"141_CR3","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1287\/ijoc.1060.0201","volume":"19","author":"RK Ahuja","year":"2007","unstructured":"Ahuja RK, Jha KC, Orlin JB, Sharma D (2007) Very large-scale neighborhood search for the quadratic assignment problem. INFORMS J Comput 19(4):646\u2013657","journal-title":"INFORMS J Comput"},{"issue":"4","key":"141_CR4","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0167-6377(85)90025-2","volume":"4","author":"AA Assad","year":"1985","unstructured":"Assad AA, Xu W (1985) On lower bounds for a class of quadratic 0, 1 programs. Oper Res Lett 4(4):175\u2013180","journal-title":"Oper Res Lett"},{"issue":"1","key":"141_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/2251-712X-8-6","volume":"8","author":"M Bashiri","year":"2012","unstructured":"Bashiri M, Karimi H (2012) Effective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons. J Ind Eng Int 8(1):1\u20139","journal-title":"J Ind Eng Int"},{"key":"141_CR6","first-page":"261","volume-title":"New ideas in optimization","author":"R Berretta","year":"1999","unstructured":"Berretta R, Moscato P (1999) The number partitioning problem: An open challenge for evolutionary computation? In: Corne D, Dorigo M, Glover F, Dasgupta D, Moscato P, Poli R, Price KV (eds) New ideas in optimization. McGraw-Hill, Maidenhead, pp 261\u2013278"},{"key":"141_CR7","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1023\/B:HEUR.0000045321.59202.52","volume":"10","author":"L Buriol","year":"2004","unstructured":"Buriol L, Fran\u00e7a P, Moscato P (2004) A new memetic algorithm for the asymmetric traveling salesman problem. J Heur 10:483\u2013506","journal-title":"J Heur"},{"key":"141_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12293-013-0111-9","volume":"5","author":"P Chauhan","year":"2013","unstructured":"Chauhan P, Deep K, Pant M (2013) Novel inertia weight strategies for particle swarm optimization. Memet Comput 5:1\u201323","journal-title":"Memet Comput"},{"key":"141_CR9","doi-asserted-by":"crossref","unstructured":"Cheung G (2009) A discrete stereotyped particle swarm optimization algorithm for quadratic assignment problems. Master\u2019s thesis, the Graduate School of Binghamton State University of New York","DOI":"10.5772\/6754"},{"issue":"1","key":"141_CR10","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/4235.985692","volume":"6","author":"M Clerc","year":"2002","unstructured":"Clerc M, Kennedy J (2002) The particle swarm\u2014explosion, stability, and convergence in a multidimensional complex space. IEEE Trans Evol Comput 6(1):58\u201373","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"141_CR11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1287\/ijoc.8.2.125","volume":"8","author":"B Codenotti","year":"1993","unstructured":"Codenotti B, Manzini G, Margara L, Resta G (1993) Perturbation: An efficient technique for the solution of very large instances of the Euclidean TSP. INFORMS J Comput 8(2):125\u2013133","journal-title":"INFORMS J Comput"},{"key":"141_CR12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garc\u00eda S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1:3\u201318","journal-title":"Swarm Evol Comput"},{"key":"141_CR13","doi-asserted-by":"crossref","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) The ant system: Optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B Cybern 26(1):29\u201341","DOI":"10.1109\/3477.484436"},{"key":"141_CR14","doi-asserted-by":"crossref","unstructured":"Dorigo M, St\u00fctzle T (2004) Ant colony optimization. MIT Press, Cambridge","DOI":"10.1007\/b99492"},{"issue":"3","key":"141_CR15","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1287\/ijoc.15.3.320.16076","volume":"15","author":"Z Drezner","year":"2003","unstructured":"Drezner Z (2003) A new genetic algorithm for the quadratic assignment problem. INFORMS J Comput 15(3):320\u2013330","journal-title":"INFORMS J Comput"},{"issue":"2","key":"141_CR16","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1016\/S0377-2217(03)00438-7","volume":"160","author":"Z Drezner","year":"2005","unstructured":"Drezner Z (2005) The extended concentric tabu for the quadratic assignment problem. Eur J Oper Res 160(2):416\u2013422","journal-title":"Eur J Oper Res"},{"issue":"3","key":"141_CR17","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1016\/j.cor.2006.05.004","volume":"35","author":"Z Drezner","year":"2008","unstructured":"Drezner Z (2008) Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem. Comput Oper Res 35(3):717\u2013736","journal-title":"Comput Oper Res"},{"key":"141_CR18","doi-asserted-by":"crossref","unstructured":"Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In Proceedings of the 1995 international symposium on micro machine and human science, (MHS \u201995), pp 39\u201343","DOI":"10.1109\/MHS.1995.494215"},{"issue":"1","key":"141_CR19","doi-asserted-by":"crossref","first-page":"167","DOI":"10.2307\/3008789","volume":"28","author":"AN Elshafei","year":"1977","unstructured":"Elshafei AN (1977) Hospital layout as a quadratic assignment problem. Oper Res Q (1970\u20131977) 28(1):167\u2013179","journal-title":"Oper Res Q (1970\u20131977)"},{"key":"141_CR20","doi-asserted-by":"crossref","unstructured":"Engelbrecht AP (2007) Computational intelligence: An introduction. Wiley, New York","DOI":"10.1002\/9780470512517"},{"issue":"1","key":"141_CR21","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/S0377-2217(00)00140-5","volume":"132","author":"PM Fran\u00e7a","year":"2001","unstructured":"Fran\u00e7a PM, Mendes A, Moscato P (2001) A memetic algorithm for the total tardiness single machine scheduling problem. Eur J Oper Res 132(1):224\u2013242","journal-title":"Eur J Oper Res"},{"issue":"2","key":"141_CR22","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1057\/palgrave.jors.2600676","volume":"50","author":"LM Gambardella","year":"1999","unstructured":"Gambardella LM, Taillard E, Dorigo M (1999) Ant colonies for the quadratic assignment problem. J Oper Res Soc 50(2):167\u2013176","journal-title":"J Oper Res Soc"},{"key":"141_CR23","doi-asserted-by":"crossref","unstructured":"Geoffrion AM, Graves GW (1976) Scheduling parallel production lines with changeover costs: Practical application of a quadratic assignment\/LP approach. Oper Res 24(4):595\u2013610","DOI":"10.1287\/opre.24.4.595"},{"issue":"2","key":"141_CR24","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0110022","volume":"10","author":"PC Gilmore","year":"1962","unstructured":"Gilmore PC (1962) Optimal and suboptimal algorithms for the quadratic assignment problem. J Soc Ind Appl Math 10(2):305\u2013313","journal-title":"J Soc Ind Appl Math"},{"key":"141_CR25","doi-asserted-by":"crossref","unstructured":"Glover F (1989) Tabu search-Part I. ORSA J Comput 1(3):190\u2013206","DOI":"10.1287\/ijoc.1.3.190"},{"issue":"1","key":"141_CR26","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover F (1990) Tabu search-Part II. ORSA J Comput 2(1):4\u201332","journal-title":"ORSA J Comput"},{"key":"141_CR27","doi-asserted-by":"crossref","unstructured":"Glover F, Marti R (2006) Tabu search. In: Alba E, Marti R (eds) Metaheuristic procedures for training neural networks, volume 36 of operations research\/computer science interfaces series, Springer, pp 53\u201369","DOI":"10.1007\/0-387-33416-5_3"},{"key":"141_CR28","unstructured":"Gorges-Schleuter M (1977) Asparagos96 and the traveling salesman problem. In Proceedings IEEE international conference on evolutionary computation, pp 171\u2013174"},{"key":"141_CR29","first-page":"65","volume":"6","author":"S Holm","year":"1979","unstructured":"Holm S (1979) A simple sequentially rejective multiple test procedure. Scand J Stat 6:65\u201370","journal-title":"Scand J Stat"},{"key":"141_CR30","unstructured":"Hoos H, St\u00fctzle T (2004) Stochastic local search: Foundations and applications. Morgan Kaufmann, San Francisco"},{"issue":"3","key":"141_CR31","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0305-0548(91)90029-Q","volume":"18","author":"CL Huntley","year":"1991","unstructured":"Huntley CL, Brown DE (1991) A parallel heuristic for quadratic assignment problems. Comput Oper Res 18(3):275\u2013289","journal-title":"Comput Oper Res"},{"issue":"6","key":"141_CR32","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/0305-0548(95)00061-5","volume":"23","author":"CL Huntley","year":"1996","unstructured":"Huntley CL, Brown DE (1996) Parallel genetic algorithms with local search. Comput Oper Res 23(6):559\u2013571","journal-title":"Comput Oper Res"},{"issue":"4","key":"141_CR33","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/MIS.2005.74","volume":"20","author":"T James","year":"2005","unstructured":"James T, Rego C, Glover F (2005) Sequential and parallel path-relinking algorithms for the quadratic assignment problem. IEEE Intell Syst 20(4):58\u201365","journal-title":"IEEE Intell Syst"},{"issue":"3","key":"141_CR34","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1109\/TSMCA.2009.2014556","volume":"39","author":"T James","year":"2009","unstructured":"James T, Rego C, Glover F (2009) Multistart tabu search and diversification strategies for the quadratic assignment problem. IEEE Trans Syst Man Cybern Part A Syst Humans 39(3):579\u2013596","journal-title":"IEEE Trans Syst Man Cybern Part A Syst Humans"},{"key":"141_CR35","doi-asserted-by":"crossref","unstructured":"Janson S, Middendorf M (2003) A hierarchical particle swarm optimizer. In: Proceedings of the 2003 IEEE congress on evolutionary computation, (CEC \u201903), vol 2. pp 770\u2013776","DOI":"10.1109\/CEC.2003.1299745"},{"issue":"6","key":"141_CR36","doi-asserted-by":"crossref","first-page":"1272","DOI":"10.1109\/TSMCB.2005.850530","volume":"35","author":"S Janson","year":"2005","unstructured":"Janson S, Middendorf M (2005) A hierarchical particle swarm optimizer and its adaptive variant. IEEE Trans Syst Man Cybern Part B Cybern 35(6):1272\u20131282","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"issue":"11","key":"141_CR37","doi-asserted-by":"crossref","first-page":"3459","DOI":"10.1109\/TAP.2005.858842","volume":"53","author":"N Jin","year":"2005","unstructured":"Jin N, Rahmat-Samii Y (2005) Parallel particle swarm optimization and finite-difference time-domain (PSO\/FDTD) algorithm for multiband and wide-band patch antenna designs. IEEE Trans Antenna Propag 53(11):3459\u20133468","journal-title":"IEEE Trans Antenna Propag"},{"key":"141_CR38","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1997) A discrete binary version of the particle swarm algorithm. In: Proceedings of the 1997 IEEE international conference on systems, man, and cybernetics, vol 5. pp 4104\u20134108","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"141_CR39","volume-title":"Swarm intelligence","author":"J Kennedy","year":"2001","unstructured":"Kennedy J, Eberhart RC (2001) Swarm intelligence. Morgan Kaufmann, San Francisco"},{"issue":"3","key":"141_CR40","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1109\/TAP.2007.891564","volume":"55","author":"Y Kim","year":"2007","unstructured":"Kim Y, Keely S, Ghosh J, Ling H (2007) Application of artificial neural networks to broadband antenna design based on a parametric frequency model. IEEE Trans Antennas Propag 55(3):669\u2013674","journal-title":"IEEE Trans Antennas Propag"},{"issue":"4","key":"141_CR41","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","volume":"9","author":"EL Lawler","year":"1963","unstructured":"Lawler EL (1963) The quadratic assignment problem. Manag Sci 9(4):586\u2013599","journal-title":"Manag Sci"},{"issue":"1","key":"141_CR42","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/TSMCB.2006.883272","volume":"37","author":"B Liu","year":"2007","unstructured":"Liu B, Wang L, Jin Y-H (2007) An effective PSO-based memetic algorithm for flow shop scheduling. IEEE Trans Sys Man Cybern Part B Cybern 37(1):18\u201327","journal-title":"IEEE Trans Sys Man Cybern Part B Cybern"},{"key":"141_CR43","doi-asserted-by":"crossref","unstructured":"Liu H, Abraham A, Zhang J (2007) A particle swarm approach to quadratic assignment problems. In: Saad A, Dahal K, Sarfraz M, Roy R (eds) Soft computing inindustrial applications. Advances in soft computing, vol 39. Springer, Heidelberg, pp 213\u2013222","DOI":"10.1007\/978-3-540-70706-6_20"},{"issue":"2","key":"141_CR44","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"EM Loiola","year":"2007","unstructured":"Loiola EM, de Abreu NMM, Boaventura-Netto PO, Hahn P, Querido T (2007) A survey for the quadratic assignment problem. Eur J Oper Res 176(2):657\u2013690","journal-title":"Eur J Oper Res"},{"issue":"5","key":"141_CR45","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/69.806935","volume":"11","author":"V Maniezzo","year":"1999","unstructured":"Maniezzo V, Colorni A (1999) The ant system applied to the quadratic assignment problem. IEEE Trans Knowl Data Eng 11(5):769\u2013778","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"141_CR46","doi-asserted-by":"crossref","unstructured":"Marzetta A, Br\u00fcngger A (1999) A dynamic-programming bound for the quadratic assignment problem. In: Asano T, Imai H, Lee D, Nakano S-I, Tokuyama T (eds) Computing and combinatorics. Lecture notes in computer science, vol 1627. Springer, pp 339\u2013348","DOI":"10.1007\/3-540-48686-0_34"},{"key":"141_CR47","unstructured":"Merz P, Freisleben B (1997) A genetic local search approach to the quadratic assignment problem. In: Proceedings of the 7th international conference on genetic algorithms, pp 465\u2013472"},{"key":"141_CR48","doi-asserted-by":"crossref","unstructured":"Merz P, Freisleben B (1999) A comparison of memetic algorithms, tabu search, and ant colonies for the quadratic assignment problem. In: Proceedings of the 1999 congress on evolutionary computation, vol 3. pp 2063\u20132070","DOI":"10.1109\/CEC.1999.785529"},{"issue":"4","key":"141_CR49","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/4235.887234","volume":"4","author":"P Merz","year":"2000","unstructured":"Merz P, Freisleben B (2000) Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Trans Evol Comput 4(4):337\u2013352","journal-title":"IEEE Trans Evol Comput"},{"issue":"5\u20136","key":"141_CR50","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0950-7051(03)00027-3","volume":"16","author":"A Misevicius","year":"2003","unstructured":"Misevicius A (2003) Genetic algorithm hybridized with ruin and recreate procedure: Application to the quadratic assignment problem. Knowl Based Syst 16(5\u20136):261\u2013268","journal-title":"Knowl Based Syst"},{"issue":"2\u20134","key":"141_CR51","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.knosys.2004.03.001","volume":"17","author":"A Misevicius","year":"2004","unstructured":"Misevicius A (2004) An improved hybrid genetic algorithm: New results for the quadratic assignment problem. Knowl Based Syst 17(2\u20134):65\u201373","journal-title":"Knowl Based Syst"},{"issue":"1","key":"141_CR52","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10589-005-4562-x","volume":"30","author":"A Misevicius","year":"2005","unstructured":"Misevicius A (2005) A tabu search algorithm for the quadratic assignment problem. Comput Opt Appl 30(1):95\u2013111","journal-title":"Comput Opt Appl"},{"key":"141_CR53","unstructured":"Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Technical report 826, Caltech concurrent computation program"},{"key":"141_CR54","doi-asserted-by":"crossref","unstructured":"Moscato P (1993) An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search. Ann Oper Res 41(1\u20134):85\u2013121","DOI":"10.1007\/BF02022564"},{"key":"141_CR55","unstructured":"Moscato P (1999) Memetic algorithms: A short introduction. In: Corne D, Dorigo M, Glover F, Dasgupta D, Moscato P, Poli R, Price KV (eds) New ideas in optimization. McGraw-Hill, Maidenhead, pp 219\u2013234"},{"key":"141_CR56","unstructured":"Moscato P, Cotta C (2013) A gentle introduction to memetic algorithms. In: Handbook of metaheuristics. Kluwer Academic Publishers, pp 105\u2013144"},{"key":"141_CR57","doi-asserted-by":"crossref","unstructured":"Neri F, Cotta C (2012) Memetic algorithms and memetic computing optimization: A literature review. Swarm Evol Comput 2:1\u201314","DOI":"10.1016\/j.swevo.2011.11.003"},{"key":"141_CR58","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-23247-3","volume-title":"Handbook of memetic algorithms, volume 379 of studies in computational intelligence","author":"F Neri","year":"2012","unstructured":"Neri F, Cotta C, Moscato P (2012) Handbook of memetic algorithms, volume 379 of studies in computational intelligence. Springer, Berlin"},{"issue":"1","key":"141_CR59","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s12293-012-0087-x","volume":"5","author":"J Ni","year":"2013","unstructured":"Ni J, Li L, Qiao F, Wu Q (2013) A novel memetic algorithm and its application to data clustering. Memet Comput 5(1):65\u201378","journal-title":"Memet Comput"},{"issue":"1","key":"141_CR60","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/72.265961","volume":"5","author":"V Nissen","year":"1994","unstructured":"Nissen V (1994) Solving the quadratic assignment problem with clues from nature. IEEE Trans Neural Netw 5(1):66\u201372","journal-title":"IEEE Trans Neural Netw"},{"key":"141_CR61","volume-title":"Handbook of evolutionary computation","author":"V Nissen","year":"1997","unstructured":"Nissen V (1997) Quadratic assignment. In: B\u00e4ck T, Fogel DB, Michalewicz Z (eds) Handbook of evolutionary computation. IOP Publishing, Bristol"},{"key":"141_CR62","doi-asserted-by":"crossref","unstructured":"Ostrowski T, Ruoppila VT (1997) Genetic annealing search for index assignment in vector quantization. Pattern Recognit Lett 18(4):311\u2013318","DOI":"10.1016\/S0167-8655(97)00019-6"},{"key":"141_CR63","doi-asserted-by":"crossref","unstructured":"Pan I, Das S (2013) Design of hybrid regrouping PSO-GA based sub-optimal networked control system with random packet losses. Memet Comput 5(2):141\u2013153","DOI":"10.1007\/s12293-013-0107-5"},{"key":"141_CR64","unstructured":"Pardalos PM, Qian T, Resende MGC (1994) A greedy randomized adaptive search procedure for the quadratic assignment problem. In quadratic assignment and related problems, volume 16 of DIMACS series on discrete mathematics and theoretical computer science, pp 237\u2013261. American Mathematical Society, 1994"},{"key":"141_CR65","unstructured":"Burkard SKRE, Rendl F (1997) QAPLIB\u2014a quadratic assignment problem library. http:\/\/www.seas.upenn.edu\/qaplib\/"},{"issue":"3","key":"141_CR66","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1002\/net.20360","volume":"56","author":"C Rego","year":"2010","unstructured":"Rego C, James T, Glover F (2010) An ejection chain algorithm for the quadratic assignment problem. Networks 56(3):188\u2013206","journal-title":"Networks"},{"issue":"3","key":"141_CR67","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni S, Gonzalez T (1976) P-complete approximation problems. J ACM 23(3):555\u2013565","journal-title":"J ACM"},{"key":"141_CR68","doi-asserted-by":"crossref","unstructured":"Steinberg L (1961) The backboard wiring problem: A placement algorithm. SIAM Rev 3(1):37\u201350","DOI":"10.1137\/1003003"},{"issue":"3","key":"141_CR69","doi-asserted-by":"crossref","first-page":"1519","DOI":"10.1016\/j.ejor.2005.01.066","volume":"174","author":"T St\u00fctzle","year":"2006","unstructured":"St\u00fctzle T (2006) Iterated local search for the quadratic assignment problem. Eur J Oper Res 174(3):1519\u20131539","journal-title":"Eur J Oper Res"},{"key":"141_CR70","first-page":"33","volume-title":"New ideas in optimization","author":"T St\u00fctzle","year":"1999","unstructured":"St\u00fctzle T, Dorigo M (1999) ACO algorithms for the quadratic assignment problem. In: Corne D, Dorigo M, Glover F, Dasgupta D, Moscato P, Poli R, Price KV (eds) New ideas in optimization. McGraw-Hill, Maidenhead, pp 33\u201350"},{"issue":"9","key":"141_CR71","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle T, Hoos HH (2000) MAX-MIN ant system. Futur Gener Comput Syst 16(9):889\u2013914","journal-title":"Futur Gener Comput Syst"},{"issue":"4\u20135","key":"141_CR72","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E Taillard","year":"1991","unstructured":"Taillard E (1991) Robust taboo search for the quadratic assignment problem. Parallel Comput 17(4\u20135):443\u2013455","journal-title":"Parallel Comput"},{"key":"141_CR73","unstructured":"Taillard E (2012) Homepage of Eric Taillard, 2012. http:\/\/mistic.heig-vd.ch\/taillard\/"},{"issue":"1","key":"141_CR74","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10589-005-3069-9","volume":"34","author":"L-Y Tseng","year":"2006","unstructured":"Tseng L-Y, Liang S-C (2006) A hybrid metaheuristic for the quadratic assignment problem. Comput Opt Appl 34(1):85\u2013113","journal-title":"Comput Opt Appl"},{"issue":"3","key":"141_CR75","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1109\/TEVC.2004.826068","volume":"8","author":"M Wachowiak","year":"2004","unstructured":"Wachowiak M, Smolikova R, Zheng Y, Zurada J, Elmaghraby A (2004) An approach to multimodal biomedical image registration utilizing particle swarm optimization. IEEE Trans Evol Comput 8(3):289\u2013301","journal-title":"IEEE Trans Evol Comput"},{"key":"141_CR76","doi-asserted-by":"crossref","unstructured":"Zhao M, Abraham A, Grosan C, Liu H (2008) A fuzzy particle swarm approach to multiobjective quadratic assignment problems. In: Proceedings of the second Asia international conference on modeling simulation, pp 516\u2013521","DOI":"10.1109\/AMS.2008.169"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-014-0141-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-014-0141-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-014-0141-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T14:52:07Z","timestamp":1565880727000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-014-0141-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,2]]},"references-count":76,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["141"],"URL":"https:\/\/doi.org\/10.1007\/s12293-014-0141-y","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,2]]}}}