{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:11:23Z","timestamp":1742911883839,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030008970"},{"type":"electronic","value":"9783030008987"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00898-7_30","type":"book-chapter","created":{"date-parts":[[2018,9,19]],"date-time":"2018-09-19T16:27:11Z","timestamp":1537374431000},"page":"446-460","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An Effective Structural Iterative Refinement Technique for Solving the Quadratic Assignment Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8466-1380","authenticated-orcid":false,"given":"Mehrdad","family":"Amirghasemi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7948-5500","authenticated-orcid":false,"given":"Reza","family":"Zamani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,20]]},"reference":[{"issue":"4","key":"30_CR1","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1287\/ijoc.1060.0201","volume":"19","author":"R Ahuja","year":"2007","unstructured":"Ahuja, R., Jha, K., Orlin, J., Sharma, D.: Very large-scale neighborhood search for the quadratic assignment problem. INFORMS J. Comput. 19(4), 646\u2013657 (2007)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"30_CR2","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s101070100255","volume":"91","author":"K Anstreicher","year":"2002","unstructured":"Anstreicher, K., Brixius, N., Goux, J., Linderoth, J.: Solving large quadratic assignment problems on computational grids. Math. Program. 91(3), 563\u2013588 (2002)","journal-title":"Math. Program."},{"issue":"6","key":"30_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0898-1221(94)00147-2","volume":"28","author":"R Battiti","year":"1994","unstructured":"Battiti, R., Tecchiolli, G.: Simulated annealing and tabu search in the long run: a comparison on QAP tasks. Comput. Math. Appl. 28(6), 1\u20138 (1994)","journal-title":"Comput. Math. Appl."},{"issue":"6","key":"30_CR4","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1023\/B:JIMS.0000042661.56171.bb","volume":"15","author":"A Baykasoglu","year":"2004","unstructured":"Baykasoglu, A.: A meta-heuristic algorithm to solve quadratic assignment formulations of cell formation problems without presetting number of cells. J. Intell. Manuf. 15(6), 753\u2013759 (2004)","journal-title":"J. Intell. Manuf."},{"issue":"4","key":"30_CR5","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"RE Burkard","year":"1997","unstructured":"Burkard, R.E., Karisch, S.E., Rendl, F.: QAPLIB - a quadratic assignment problem library. J. Glob. Optim. 10(4), 391\u2013403 (1997)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"30_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.1475-3995.1996.tb00032.x","volume":"3","author":"A Colorni","year":"1996","unstructured":"Colorni, A., Dorigo, M., Maffioli, F., Maniezzo, V., Righini, G., Trubian, M.: Heuristics from nature for hard combinatorial optimization problems. Int. Trans. Oper. Res. 3(1), 1\u201321 (1996)","journal-title":"Int. Trans. Oper. Res."},{"issue":"1","key":"30_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0377-2217(90)90301-Q","volume":"46","author":"DT Connolly","year":"1990","unstructured":"Connolly, D.T.: An improved annealing scheme for the QAP. Eur. J. Oper. Res. 46(1), 93\u2013100 (1990)","journal-title":"Eur. J. Oper. Res."},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/9780470053928.ch1","volume-title":"Parallel Combinatorial Optimization Chap. 1","author":"TG Crainic","year":"2006","unstructured":"Crainic, T.G., Cun, B.L., Roucairol, C.: Parallel branch-and-bound algorithms. In: Zomaya, A.Y., Talbi, E. (eds.) Parallel Combinatorial Optimization Chap. 1, pp. 1\u201328. Wiley, Hoboken (2006). https:\/\/doi.org\/10.1002\/9780470053928.ch1"},{"issue":"1","key":"30_CR9","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.amc.2006.05.073","volume":"183","author":"N Demirel","year":"2006","unstructured":"Demirel, N., Toksar, M.: Optimization of the quadratic assignment problem using an ant colony algorithm. Appl. Math. Comput. 183(1), 427\u2013435 (2006)","journal-title":"Appl. Math. Comput."},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1155\/S1173912602000093","volume":"6","author":"Z Drezner","year":"2002","unstructured":"Drezner, Z.: Heuristic algorithms for the solution of the quadratic assignment problem. J. Appl. Math. Decis. Sci. 6, 163\u2013173 (2002)","journal-title":"J. Appl. Math. Decis. Sci."},{"issue":"5","key":"30_CR11","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. 33(5), 475\u2013480 (2005)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"30_CR12","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. 15(3), 320\u2013330 (2003)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"30_CR13","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. Comput. Oper. Res. 35(3), 717\u2013736 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"30_CR14","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1057\/palgrave.jors.2600676","volume":"50","author":"L Gambardella","year":"1999","unstructured":"Gambardella, L., Taillard, E., Dorigo, M.: Ant colonies for the quadratic assignment problem. J. Oper. Res. Soc. 50(2), 167\u2013176 (1999)","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"30_CR15","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1109\/TSMCA.2009.2014556","volume":"39","author":"T James","year":"2009","unstructured":"James, T., Rego, C., Glover, F.: Multistart Tabu search and diversification strategies for the quadratic assignment problem. IEEE Trans. Syst. Man Cybern. Part A: Syst. Hum. 39(3), 579\u2013596 (2009)","journal-title":"IEEE Trans. Syst. Man Cybern. Part A: Syst. Hum."},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Kelley, C.T.: Solving Nonlinear Equations with Newton\u2019s Method. SIAM (2003)","DOI":"10.1137\/1.9780898718898"},{"issue":"1","key":"30_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: J. Econometr. Soc. 25(1), 53\u201376 (1957)","journal-title":"Econometrica: J. Econometr. Soc."},{"key":"30_CR18","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H Kuhn","year":"1952","unstructured":"Kuhn, H.: The Hungarian method for the assignment problem. Naval Res. Logist. 2, 83\u201397 (1952)","journal-title":"Naval Res. Logist."},{"key":"30_CR19","unstructured":"Lee, Y., Orlin, J.: Quickmatch: a very fast algorithm for the assignment problem. Report, Sloan School of Management, Massachusetts Institute of Technology (Report number: WP# 3547\u201393) (1993)"},{"issue":"2","key":"30_CR20","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"EM Loiola","year":"2007","unstructured":"Loiola, E.M., De Abreu, N.M.M., Boaventura-Netto, P.O., Hahn, P., Querido, T.: A survey for the quadratic assignment problem. Eur. J. Oper. Res. 176(2), 657\u2013690 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"30_CR21","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/69.806935","volume":"11","author":"V Maniezzo","year":"1999","unstructured":"Maniezzo, V., Colorni, A.: The ant system applied to the quadratic assignment problem. IEEE Trans. Knowl. Data Eng. 11(5), 769\u2013778 (1999)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"30_CR22","doi-asserted-by":"publisher","first-page":"1665","DOI":"10.1007\/s00170-013-4965-2","volume":"68","author":"R Matai","year":"2013","unstructured":"Matai, R., Singh, S., Mittal, M.: A non-greedy systematic neighbourhood search heuristic for solving facility layout problem. Int. J. Adv. Manuf. Technol. 68, 1665\u20131675 (2013)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"1","key":"30_CR23","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1023\/A:1008623913524","volume":"7","author":"T Mavridou","year":"1997","unstructured":"Mavridou, T., Pardalos, P.: Simulated annealing and genetic algorithms for the facility layout problem: a survey. Comput. Optim. Appl. 7(1), 111\u2013126 (1997)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"30_CR24","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10589-005-4562-x","volume":"30","author":"A Misevicius","year":"2005","unstructured":"Misevicius, A.: A tabu search algorithm for the quadratic assignment problem. Comput. Optim. Appl. 30(1), 95\u2013111 (2005)","journal-title":"Comput. Optim. Appl."},{"key":"30_CR25","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":"CAS 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. 3059, pp. 356\u2013368. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24838-5_27"},{"issue":"3","key":"30_CR26","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1002\/net.20360","volume":"56","author":"C Rego","year":"2010","unstructured":"Rego, C., James, T., Glover, F.: An ejection chain algorithm for the quadratic assignment problem. Networks 56(3), 188\u2013206 (2010)","journal-title":"Networks"},{"issue":"3","key":"30_CR27","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni, S., Gonzalez, T.: P-complete approximation problems. J. ACM (JACM) 23(3), 555\u2013565 (1976)","journal-title":"J. ACM (JACM)"},{"key":"30_CR28","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-1-4614-8588-9_11","volume-title":"Models, Algorithms, and Technologies for Network Analysis","author":"R Silva","year":"2013","unstructured":"Silva, R., Resende, M., Pardalos, P., Mateus, G., De Tomi, G.: Grasp with path-relinking for facility layout. In: Goldengorin, B., Kalyagin, V., Pardalos, P. (eds.) Models, Algorithms, and Technologies for Network Analysis, vol. 59, pp. 175\u2013190. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-8588-9_11"},{"issue":"3","key":"30_CR29","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1016\/S0377-2217(03)00248-0","volume":"157","author":"M Solimanpur","year":"2004","unstructured":"Solimanpur, M., Vrat, P., Shankar, R.: Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing. Eur. J. Oper. Res. 157(3), 592\u2013606 (2004)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"30_CR30","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E Taillard","year":"1991","unstructured":"Taillard, E.: Robust taboo search for the quadratic assignment problem. Parallel Comput. 17(4), 443\u2013455 (1991)","journal-title":"Parallel Comput."},{"key":"30_CR31","unstructured":"Taillard, E.: FANT: fast ant system. Technical report, Istituto Dalle Molle Di Studi Sull Intelligenza Artificiale (1998)"},{"issue":"4","key":"30_CR32","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/S0167-739X(99)00124-7","volume":"17","author":"E Talbi","year":"2001","unstructured":"Talbi, E., Roux, O., Fonlupt, C., Robillard, D.: Parallel ant colonies for the quadratic assignment problem. Future Gener. Comput. Syst. 17(4), 441\u2013449 (2001)","journal-title":"Future Gener. Comput. Syst."},{"key":"30_CR33","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-1-4615-2223-2_14","volume-title":"The Impact of Emerging Technologies on Computer Science and Operations Research","author":"S Vo\u00df","year":"1995","unstructured":"Vo\u00df, S.: Solving quadratic assignment problems using the reverse elimination method. In: Nash, S.G., Sofer, A., Stewart, W.R., Wasil, E.A. (eds.) The Impact of Emerging Technologies on Computer Science and Operations Research, pp. 281\u2013296. Kluwer, Dordrecht (1995). https:\/\/doi.org\/10.1007\/978-1-4615-2223-2_14"},{"key":"30_CR34","unstructured":"Votaw, D.F., Orden, A.: The personnel assignment problem. In: Symposium on Linear Inequalities and Programming, pp. 155\u2013163 (1952)"},{"issue":"11","key":"30_CR35","doi-asserted-by":"publisher","first-page":"2007","DOI":"10.1016\/j.cor.2010.02.001","volume":"37","author":"H Zhang","year":"2010","unstructured":"Zhang, H., Beltran-Royo, C., Constantino, M.: Effective formulation reductions for the quadratic assignment problem. Comput. Oper. Res. 37(11), 2007\u20132016 (2010)","journal-title":"Comput. Oper. Res."},{"key":"30_CR36","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10479-012-1079-4","volume":"207","author":"H Zhang","year":"2010","unstructured":"Zhang, H., Beltran-Royo, C., Ma, L.: Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers. Ann. Oper. Res. 207, 261\u2013278 (2010)","journal-title":"Ann. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00898-7_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T23:21:16Z","timestamp":1662074476000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00898-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030008970","9783030008987"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00898-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"20 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}