{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T07:40:10Z","timestamp":1746258010174,"version":"3.40.4"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319076430"},{"type":"electronic","value":"9783319076447"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07644-7_12","type":"book-chapter","created":{"date-parts":[[2014,6,4]],"date-time":"2014-06-04T21:27:11Z","timestamp":1401917231000},"page":"155-168","source":"Crossref","is-referenced-by-count":0,"title":["JAM: A Tabu-Based Two-Stage Simulated Annealing Algorithm for the Multidimensional Arrangement Problem"],"prefix":"10.1007","author":[{"given":"Jordi Arjona","family":"Aroca","sequence":"first","affiliation":[]},{"given":"Antonio Fern\u00e1ndez","family":"Anta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"12_CR1","first-page":"193","volume":"40","author":"E.H.L. Aarts","year":"1985","unstructured":"Aarts, E.H.L., van Laarhoven, P.J.M.: Statistical cooling: A general approach to combinatorial optimization problems. Philips Journal of Research\u00a040(4), 193 (1985)","journal-title":"Philips Journal of Research"},{"issue":"9","key":"12_CR2","doi-asserted-by":"publisher","first-page":"4800","DOI":"10.1016\/j.amc.2012.10.106","volume":"219","author":"U. Benlic","year":"2013","unstructured":"Benlic, U., Hao, J.-K.: Breakout local search for the quadratic assignment problem. Applied Mathematics and Computation\u00a0219(9), 4800\u20134815 (2013)","journal-title":"Applied Mathematics and Computation"},{"issue":"4","key":"12_CR3","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.E., Rendl, F.: Qaplib\u2013a quadratic assignment problem library. Journal of Global Optimization\u00a010(4), 391\u2013403 (1997)","journal-title":"Journal of Global Optimization"},{"issue":"2","key":"12_CR4","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0377-2217(84)90231-5","volume":"17","author":"R.E. Burkard","year":"1984","unstructured":"Burkard, R.E., Rendl, F.: A thermodynamically motivated simulation procedure for combinatorial optimization problems. European Journal of Operational Research\u00a017(2), 169\u2013174 (1984)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1287\/ijoc.1100.0390","volume":"23","author":"A. Caprara","year":"2011","unstructured":"Caprara, A., Letchford, A.N., Salazar-Gonz\u00e1lez, J.-J.: Decorous lower bounds for minimum linear arrangement. INFORMS Journal on Computing\u00a023(1), 26\u201340 (2011)","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"12_CR6","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s12532-011-0027-7","volume":"3","author":"A. Caprara","year":"2011","unstructured":"Caprara, A., Oswald, M., Reinelt, G., Schwarz, R., Traversi, E.: Optimal linear arrangements using betweenness variables. Mathematical Programming Computation\u00a03(3), 261\u2013280 (2011)","journal-title":"Mathematical Programming Computation"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0377-2217(90)90301-Q","volume":"46","author":"D.T. Connolly","year":"1990","unstructured":"Connolly, D.T.: An improved annealing scheme for the qap. European Journal of Operational Research\u00a046(1), 93\u2013100 (1990)","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"12_CR8","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(5), 475\u2013480 (2005)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"12_CR9","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1287\/opre.1120.1073","volume":"60","author":"M. Fischetti","year":"2012","unstructured":"Fischetti, M., Monaci, M., Salvagnin, D.: Three ideas for the quadratic assignment problem. Operations Research\u00a060(4), 954\u2013964 (2012)","journal-title":"Operations Research"},{"doi-asserted-by":"crossref","unstructured":"Fleurent, C., Ferland, J.A.: Genetic hybrids for the quadratic assignment problem. In: DIMACS Series in Mathematics and Theoretical Computer Science, pp. 173\u2013187. American Mathematical Society (1993)","key":"12_CR10","DOI":"10.1090\/dimacs\/016\/08"},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1287\/ijoc.11.2.198","volume":"11","author":"C. Fleurent","year":"1999","unstructured":"Fleurent, C., Glover, F.: Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory. INFORMS Journal on Computing\u00a011(2), 198\u2013204 (1999)","journal-title":"INFORMS Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"Hansen, M.D.: Approximation algorithms for geometric embeddings in the plane with applications to parallel processing problems. In: 30th Annual Symposium on FOCS 1989, pp. 604\u2013609. IEEE (1989)","key":"12_CR12","DOI":"10.1109\/SFCS.1989.63542"},{"issue":"3","key":"12_CR13","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. on Systems, Man and Cybernetics, Part A: Systems and Humans\u00a039(3), 579\u2013596 (2009)","journal-title":"IEEE Trans. on Systems, Man and Cybernetics, Part A: Systems and Humans"},{"doi-asserted-by":"crossref","unstructured":"Zhu, J., Rui, T., Fang, H., Zhang, J., Liao, M.: Simulated annealing ant colony algorithm for qap. In: ICNC 2012, pp. 789\u2013793 (2012)","key":"12_CR14","DOI":"10.1109\/ICNC.2012.6234519"},{"issue":"4598","key":"12_CR15","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt Jr., D., Vecchi, M.P.: Optimization by simmulated annealing. Science\u00a0220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"doi-asserted-by":"crossref","unstructured":"Koopmans, T.C., Beckmann, M.: Assignment problems and the location of economic activities. Econometrica: Journal of the Econometric Society, 53\u201376 (1957)","key":"12_CR16","DOI":"10.2307\/1907742"},{"key":"12_CR17","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1090\/dimacs\/016\/12","volume":"16","author":"Y. Li","year":"1994","unstructured":"Li, Y., Pardalos, P.M., Resende, M.G.C.: A greedy randomized adaptive search procedure for the quadratic assignment problem. Quadratic Assignment and Related Problems\u00a016, 237\u2013261 (1994)","journal-title":"Quadratic Assignment and Related Problems"},{"unstructured":"Mcallister, A.J.: A new heuristic algorithm for the linear arrangement problem. Technical Report TR-99-126a, University of New Brunswick (1999)","key":"12_CR18"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N. Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of state calculations by fast computing machines. The Journal of Chemical Physics\u00a021, 1087 (1953)","journal-title":"The Journal of Chemical Physics"},{"issue":"1-4","key":"12_CR20","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1023\/A:1021857607524","volume":"118","author":"P. Mills","year":"2003","unstructured":"Mills, P., Tsang, E., Ford, J.: Applying an extended guided local search to the quadratic assignment problem. Annals of Operations Research\u00a0118(1-4), 121\u2013135 (2003)","journal-title":"Annals of Operations Research"},{"issue":"4","key":"12_CR21","doi-asserted-by":"crossref","first-page":"497","DOI":"10.15388\/Informatica.2003.037","volume":"14","author":"A. Misevi\u010dius","year":"2003","unstructured":"Misevi\u010dius, A.: A modified simulated annealing algorithm for the quadratic assignment problem. Informatica\u00a014(4), 497\u2013514 (2003)","journal-title":"Informatica"},{"issue":"2-4","key":"12_CR22","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.knosys.2004.03.001","volume":"17","author":"A. Misevi\u010dius","year":"2004","unstructured":"Misevi\u010dius, A.: An improved hybrid genetic algorithm: new results for the quadratic assignment problem. Knowl.-Based Syst.\u00a017(2-4), 65\u201373 (2004)","journal-title":"Knowl.-Based Syst."},{"issue":"1","key":"12_CR23","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10589-005-4562-x","volume":"30","author":"A. Misevi\u010dius","year":"2005","unstructured":"Misevi\u010dius, A.: A tabu search algorithm for the quadratic assignment problem. Comp. Opt. and Appl.\u00a030(1), 95\u2013111 (2005)","journal-title":"Comp. Opt. and Appl."},{"issue":"3","key":"12_CR24","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/s00291-011-0274-z","volume":"34","author":"A. Misevi\u010dius","year":"2012","unstructured":"Misevi\u010dius, A.: An implementation of the iterated tabu search algorithm for the quadratic assignment problem. OR Spectrum\u00a034(3), 665\u2013690 (2012)","journal-title":"OR Spectrum"},{"issue":"2-3","key":"12_CR25","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. Operations-Research-Spektrum\u00a017(2-3), 205\u2013210 (1995)","journal-title":"Operations-Research-Spektrum"},{"key":"12_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-642-38171-3_13","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"A. Nyberg","year":"2013","unstructured":"Nyberg, A., Westerlund, T., Lundell, A.: Improved discrete reformulations for the quadratic assignment problem. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol.\u00a07874, pp. 193\u2013203. Springer, Heidelberg (2013)"},{"key":"12_CR27","first-page":"2","volume":"8","author":"J. Petit","year":"2003","unstructured":"Petit, J.: Experiments on the minimum linear arrangement problem. Journal of Experimental Algorithmics (JEA)\u00a08, 2\u20133 (2003)","journal-title":"Journal of Experimental Algorithmics (JEA)"},{"issue":"10","key":"12_CR28","doi-asserted-by":"publisher","first-page":"3331","DOI":"10.1016\/j.cor.2007.03.001","volume":"35","author":"E. Rodr\u00edguez-Tello","year":"2008","unstructured":"Rodr\u00edguez-Tello, E., Hao, J.-K., Torres-Jim\u00e9nez, J.: An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem. Computers & Operations Research\u00a035(10), 3331\u20133346 (2008)","journal-title":"Computers & Operations Research"},{"key":"12_CR29","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/11925231_37","volume-title":"MICAI 2006: Advances in Artificial Intelligence","author":"E. Rodriguez-Tello","year":"2006","unstructured":"Rodriguez-Tello, E., Hao, J.-K., Torres-Jim\u00e9nez, J.: A refined evaluation function for the minla problem. In: Gelbukh, A., Reyes-Garcia, C.A. (eds.) MICAI 2006. LNCS (LNAI), vol.\u00a04293, pp. 392\u2013403. Springer, Heidelberg (2006)"},{"issue":"1","key":"12_CR30","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.jalgor.2004.10.004","volume":"60","author":"I. Safro","year":"2006","unstructured":"Safro, I., Ron, D., Brandt, A.: Graph minimum linear arrangement by multilevel weighted edge contractions. Journal of Algorithms\u00a060(1), 24\u201341 (2006)","journal-title":"Journal of Algorithms"},{"issue":"3","key":"12_CR31","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni, S., Gonz\u00e1lez, T.F.: P-complete approximation problems. J. ACM\u00a023(3), 555\u2013565 (1976)","journal-title":"J. ACM"},{"unstructured":"St\u00fctzle, T.: Max-min ant system for quadratic assignment problems. Technical Report Forschungsbericht AIDA-97-04, TU Darmstadt (1997)","key":"12_CR32"},{"issue":"4-5","key":"12_CR33","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"},{"unstructured":"Taillard, \u00c9.D., Gambardella, L.M.: Adaptive memories for the quadratic assignment problems. Technical report (1997)","key":"12_CR34"},{"issue":"5","key":"12_CR35","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/S0305-0548(98)00062-8","volume":"26","author":"J.M. Varanelli","year":"1999","unstructured":"Varanelli, J.M., Cohoon, J.P.: A fast method for generalized starting temperature determination in homogeneous two-stage simulated annealing systems. Computers & Operations Research\u00a026(5), 481\u2013503 (1999)","journal-title":"Computers & Operations Research"},{"doi-asserted-by":"crossref","unstructured":"Wang, J.-C.: Solving quadratic assignment problems by a tabu based simulated annealing algorithm. In: ICIAS 2007, pp. 75\u201380. IEEE (2007)","key":"12_CR36","DOI":"10.1109\/ICIAS.2007.4658351"},{"doi-asserted-by":"crossref","unstructured":"Wang, J.-C.: A multistart simulated annealing algorithm for the quadratic assignment problem. In: IBICA 2012, pp. 19\u201323. IEEE (2012)","key":"12_CR37","DOI":"10.1109\/IBICA.2012.56"},{"issue":"1","key":"12_CR38","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1080\/07408178708975376","volume":"19","author":"M.R. Wilhelm","year":"1987","unstructured":"Wilhelm, M.R., Ward, T.L.: Solving quadratic assignment problems by simulated annealing. IIE Transactions\u00a019(1), 107\u2013119 (1987)","journal-title":"IIE Transactions"},{"key":"12_CR39","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/11554028_12","volume-title":"Knowledge-Based Intelligent Information and Engineering Systems","author":"C. Zhang","year":"2005","unstructured":"Zhang, C., Lin, Z., Lin, Z.: Variable neighborhood search with permutation distance for qap. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds.) KES 2005. LNCS (LNAI), vol.\u00a03684, pp. 81\u201388. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07644-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T07:00:06Z","timestamp":1746255606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07644-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319076430","9783319076447"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07644-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}