{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:46:29Z","timestamp":1758267989463,"version":"3.37.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030311391"},{"type":"electronic","value":"9783030311407"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-31140-7_19","type":"book-chapter","created":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T19:26:53Z","timestamp":1568921213000},"page":"297-316","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Developing an Effective Decomposition-Based Procedure 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":[[2019,9,20]]},"reference":[{"issue":"4","key":"19_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."},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-030-00898-7_30","volume-title":"Computational Logistics","author":"M Amirghasemi","year":"2018","unstructured":"Amirghasemi, M., Zamani, R.: An effective structural iterative refinement technique for solving the quadratic assignment problem. In: Cerulli, R., Raiconi, A., Vo\u00df, S. (eds.) Computational Logistics, pp. 446\u2013460. Springer International Publishing, Cham (2018)"},{"issue":"1","key":"19_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10107-003-0437-z","volume":"97","author":"K Anstreicher","year":"2003","unstructured":"Anstreicher, K.: Recent advances in the solution of quadratic assignment problems. Math. Program. 97(1), 27\u201342 (2003)","journal-title":"Math. Program."},{"issue":"6","key":"19_CR4","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1023\/B:JIMS.0000042661.56171.bb","volume":"15","author":"A Baykaso\u011flu","year":"2004","unstructured":"Baykaso\u011flu, A.: A meta-heuristic algorithm to solve quadratic assignment formulations of cell formation problems without presetting number of cells. J. Intell. Manufact. 15(6), 753\u2013759 (2004)","journal-title":"J. Intell. Manufact."},{"issue":"4","key":"19_CR5","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/0377-2217(83)90097-8","volume":"13","author":"RE Burkard","year":"1983","unstructured":"Burkard, R.E., B\u00f6nniger, T.: A heuristic for quadratic boolean programs with applications to quadratic assignment problems. Eur. J. Oper. Res. 13(4), 374\u2013386 (1983)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"19_CR6","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":"19_CR7","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":"19_CR8","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0377-2217(90)90301-Q","volume":"46","author":"D Connolly","year":"1990","unstructured":"Connolly, D.: An improved annealing scheme for the QAP. Eur. J. Oper. Res. 46(1), 93\u2013100 (1990)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"19_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF02022561","volume":"41","author":"F Dammeyer","year":"1993","unstructured":"Dammeyer, F., Vo\u00df, S.: Dynamic tabu list management using the reverse elimination method. Ann. Oper. Res. 41(2), 29\u201346 (1993)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"19_CR10","first-page":"427","volume":"183","author":"N Demirel","year":"2006","unstructured":"Demirel, N., Toksar\u0131, 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":"19_CR11","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-77537-6_23","volume-title":"New Directions for Operations Research in Manufacturing","author":"W Domschke","year":"1992","unstructured":"Domschke, W., Forst, P., Vo\u00df, S.: Tabu search techniques for the quadratic semi-assignment problem. In: Fandel, G., Gulledge, T., Jones, A. (eds.) New Directions for Operations Research in Manufacturing, pp. 389\u2013405. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/978-3-642-77537-6_23"},{"key":"19_CR12","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":"2","key":"19_CR13","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1016\/S0377-2217(03)00438-7","volume":"160","author":"Z Drezner","year":"2005","unstructured":"Drezner, Z.: The extended concentric tabu for the quadratic assignment problem. Eur. J. Oper. Res. 160(2), 416\u2013422 (2005)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"19_CR14","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10479-005-3444-z","volume":"139","author":"Z Drezner","year":"2005","unstructured":"Drezner, Z., Hahn, P., Taillard, E.: Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods. Ann. Oper. Res. 139(1), 65\u201394 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"19_CR15","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":"1","key":"19_CR16","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 - part II. ORSA J. Comput. 2(1), 4\u201332 (1990)","journal-title":"ORSA J. Comput."},{"issue":"3","key":"19_CR17","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1016\/j.ejor.2007.06.061","volume":"195","author":"T James","year":"2009","unstructured":"James, T., Rego, C., Glover, F.: A cooperative parallel tabu search algorithm for the quadratic assignment problem. Eur. J. Oper. Res. 195(3), 810\u2013826 (2009). https:\/\/doi.org\/10.1016\/j.ejor.2007.06.061","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"19_CR18","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":"19_CR19","unstructured":"Lee, Y., Orlin, J.: Quickmatch: a very fast algorithm for the assignment problem. Report, Massachusetts Institute of Technology, Sloan School of Management (Report number: WP#3547-93) (1993)"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Li, Y., Pardalos, P., Resende, M.: A greedy randomized adaptive search procedure for the quadratic assignment problem. In: Pardalos, P., Wolkowicz, H. (eds.) Quadratic Assignment and Related Problems, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 16, pp. 237\u2013261 (1994)","DOI":"10.1090\/dimacs\/016\/12"},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21, 443\u2013452 (1973)","journal-title":"Oper. Res."},{"issue":"2","key":"19_CR22","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). https:\/\/doi.org\/10.1016\/j.ejor.2005.09.032","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"19_CR23","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."},{"issue":"1","key":"19_CR24","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":"19_CR25","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."},{"issue":"2","key":"19_CR26","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01719267","volume":"17","author":"V Nissen","year":"1995","unstructured":"Nissen, V., Paul, H.: A modification of threshold accepting and its application to the quadratic assignment problem. OR Spectr. 17(2), 205\u2013210 (1995)","journal-title":"OR Spectr."},{"issue":"3","key":"19_CR27","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":"19_CR28","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":"19_CR29","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/S0167-739X(99)00124-7","volume":"17","author":"EG Talbi","year":"2001","unstructured":"Talbi, E.G., Roux, O., Fonlupt, C., Robillard, D.: Parallel ant colonies for the quadratic assignment problem. Future Gener. Comput. Syst. 17(4), 441\u2013449 (2001). https:\/\/doi.org\/10.1016\/S0167-739X(99)00124-7","journal-title":"Future Gener. Comput. Syst."},{"key":"19_CR30","unstructured":"Thompson, P., Orlin, J.: The theory of cyclic transfers. Technical report, Operations Research Center Report, MIT, Cambridge, MA, oR 200\u201389 (1989)"},{"issue":"2","key":"19_CR31","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1016\/j.ejor.2005.06.014","volume":"175","author":"LY Tseng","year":"2006","unstructured":"Tseng, L.Y., Chen, S.C.: A hybrid metaheuristic for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 175(2), 707\u2013721 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"19_CR32","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"publisher","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. Operations Research\/Computer Science Interfaces Series, vol. 4. Springer, Boston (1995). https:\/\/doi.org\/10.1007\/978-1-4615-2223-2_14"},{"issue":"4","key":"19_CR33","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1145\/356056.356062","volume":"9","author":"D West","year":"1983","unstructured":"West, D.: Algorithm 608: approximate solution of the quadratic assignment problem. ACM Trans. Math. Softw. (TOMS) 9(4), 461\u2013466 (1983)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"Zamani, R., Amirghasemi, M.: A self-adaptive nature-inspired procedure for solving the quadratic assignment problem (2019, submitted)","DOI":"10.1007\/978-3-030-31140-7_19"}],"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-31140-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,7]],"date-time":"2019-12-07T11:12:41Z","timestamp":1575717161000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31140-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030311391","9783030311407"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31140-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"20 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Logistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Barranquilla","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Colombia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccl22019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iccl2019.co\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}