{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T16:54:06Z","timestamp":1765040046437},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,10,18]],"date-time":"2005-10-18T00:00:00Z","timestamp":1129593600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[2006,5]]},"DOI":"10.1007\/s10589-005-3069-9","type":"journal-article","created":{"date-parts":[[2005,12,20]],"date-time":"2005-12-20T15:51:48Z","timestamp":1135093908000},"page":"85-113","source":"Crossref","is-referenced-by-count":57,"title":["A Hybrid Metaheuristic for the Quadratic Assignment Problem"],"prefix":"10.1007","volume":"34","author":[{"given":"Lin-Yu","family":"Tseng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shyi-Ching","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,10,18]]},"reference":[{"key":"3069_CR1","doi-asserted-by":"crossref","unstructured":"E.H.L. Aarts and H.P. Stehouwer, \u201cNeural networks and the traveling salesman problem,\u201d in Proc. Int. Conf. on Artificial Neural Networks, Springer-Verlag, 1993, pp. 950\u2013955.,","DOI":"10.1007\/978-1-4471-2063-6_282"},{"key":"3069_CR2","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1016\/S0305-0548(99)00067-2","volume":"27","author":"R.K. Ahuja","year":"2000","unstructured":"R.K. Ahuja, J.B. Orlin, and A. Tiwari, \u201cA greedy genetic algorithm for the quadratic assignment problem,\u201d Computers & Operations Research, vol. 27, pp. 917\u2013934, 2000.,","journal-title":"Computers & Operations Research"},{"key":"3069_CR3","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0304-3975(00)00239-5","volume":"263","author":"E. Angel","year":"2001","unstructured":"E. Angel and V. Zissimopoulos, \u201cOn the landscape ruggedness of the quadratic assignment problem,\u201d Theoretical Computer Science, vol. 263, pp. 159\u2013172, 2001.,","journal-title":"Theoretical Computer Science"},{"key":"3069_CR4","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"R. Battiti","year":"1994","unstructured":"R. Battiti and G. Tecchiolli, \u201cThe reactive tabu search,\u201d ORSA Journal on Computing, vol. 6, pp. 126\u2013140, 1994.,","journal-title":"ORSA Journal on Computing"},{"key":"3069_CR5","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1287\/ijoc.4.4.387","volume":"4","author":"J.L. Bentley","year":"1992","unstructured":"J.L. Bentley, \u201cFast algorithms for geometric traveling salesman problem,\u201d ORSA Journal on Computing, vol. 4, pp. 397\u2013411, 1992.,","journal-title":"ORSA Journal on. Computing"},{"key":"3069_CR6","volume-title":"Lecture Notes in Economics and Mathematical Systems","author":"R.E. Burkard","year":"1980","unstructured":"R.E. Burkard and U. Derigs, \u201cAssignment and matching problems: solution methods with FORTRAN programs,\u201d Lecture Notes in Economics and Mathematical Systems, Springer-Verlag: Berlin, 1980.,"},{"key":"3069_CR7","doi-asserted-by":"crossref","unstructured":"R.E. Burkard, S.E. Karisch, and F. Rendl, \u201cQAPLIB-A quadratic assignment problem library, Journal of Global Optimization,\u201d vol. 10, pp. 391\u2013403, 1997. [URL: http:\/\/fmatbhp1.tu-graz.ac.at\/~karisch\/qaplib\/],","DOI":"10.1023\/A:1008293323270"},{"key":"3069_CR8","first-page":"B121","volume":"21","author":"R.E. Burkard","year":"1977","unstructured":"R.E. Burkard and J. Offermann, \u201cEntwurf von schreibmaschinentastaturen mittels quadratischer zuordnungsprobleme,\u201d Zeitschrift f\u00fcr Operations Research, vol. 21, pp. B121\u2013B132, 1977.,","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"issue":"3\/4","key":"3069_CR9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0305-0548(92)90050-F","volume":"19","author":"J. Chakrapani","year":"1992","unstructured":"J. Chakrapani and J. Skorin-Kapov, \u201cA connectionist approach to the quadratic assignment problem,\u201d Computers & Operations Reasearch, vol. 19, nos. 3\/4, pp. 287\u2013295, 1992.,","journal-title":"Computers & Operations Reasearch"},{"key":"3069_CR10","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0377-2217(90)90301-Q","volume":"46","author":"D.T. Connolly","year":"1990","unstructured":"D.T. Connolly, \u201cAn improved annealing scheme for the qap,\u201d European Journal of Operational Research, vol. 46, pp. 93\u2013100, 1990.,","journal-title":"European Journal of Operational Research"},{"key":"3069_CR11","unstructured":"M. Dorigo, \u201cOptimization, learning and natural algorithms,\u201d Doctoral dissertation, Dipartimento di Elettronica, Politecnico di Milano, IT, 1992.,"},{"key":"3069_CR12","unstructured":"M. Dorigo, V. Maniezzo, and A. Colorni, \u201cPositive feedback as a search strategy,\u201d Tech. Report pp. 91-016, Dipartimento di Elettronica e Informazione, Politecnico di Milano, IT, 1991.,"},{"key":"3069_CR13","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"M. Dorigo, V. Maniezzo, and A. Colorni, \u201cThe ant system: Optimization by a colony of cooperating agents,\u201d IEEE Transactions on Systems, Man, and Cybernetics-Part B, vol. 26, pp. 29\u201341, 1996.,","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics-Part B"},{"key":"3069_CR14","first-page":"190","volume-title":"Quadratic Assignment and Related Problems","author":"C. Fleurent","year":"1994","unstructured":"C. Fleurent and J. Ferland, \u201cGenetic hybrids for the quadratic assignment problems,\u201d in Quadratic Assignment and Related Problems, P.M. Pardalos and H. Wolkowicz (Eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16, AMS: Providence, Rhode Island, 1994, pp. 190\u2013206.,"},{"key":"3069_CR15","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1057\/palgrave.jors.2600676","volume":"50","author":"L.M. Gambardella","year":"1999","unstructured":"L.M. Gambardella, \u00c9.D. Taillard, and M. Dorigo, \u201cAnt colonies for the quadratic assignment problem,\u201d Journal of the Operational Research Society, vol. 50, pp. 167\u2013176, 1999.,","journal-title":"Journal of the Operational Research Society"},{"key":"3069_CR16","volume-title":"Computers and intractability: A guide to the theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-Completeness. Freeman: San Francisco, 1979.,"},{"key":"3069_CR17","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1287\/opre.24.4.595","volume":"24","author":"A.M. Geoffrion","year":"1976","unstructured":"A.M. Geoffrion and G.W. Graves, \u201cScheduling parallel production lines with changeover costs: Practical application of a quadratic assignment\/LP approach,\u201d Operations Research, vol. 24, pp. 595\u2013610, 1976.,","journal-title":"Operations Research"},{"key":"3069_CR18","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"D.S. Johnson","year":"1989","unstructured":"D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon, \u201cOptimization by simulated annealing: an experimental evaluation, part I (graph partitioning),\u201d Operations Research, vol. 37, pp. 865\u2013892, 1989.,","journal-title":"Operations Research"},{"key":"3069_CR19","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"T.C. Koopmans","year":"1957","unstructured":"T.C. Koopmans and M.J. Beckmann, \u201cAssignment problems and the location of economic activities,\u201d Econometrica, vol. 25, pp. 53\u201376, 1957.,","journal-title":"Econometrica"},{"key":"3069_CR20","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BFb0120827","volume":"9","author":"J. Krarup","year":"1978","unstructured":"J. Krarup and P.M. Pruzan, \u201cComputer-aided layout design,\u201d Mathematical Programming Study, vol. 9, pp. 75\u201394, 1978.,","journal-title":"Mathematical Programming Study"},{"key":"3069_CR21","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/0377-2217(93)90167-L","volume":"69","author":"P.S. Laursen","year":"1993","unstructured":"P.S. Laursen, \u201cSimulated annealing for the QAP-Optimal tradeoff between simulation time and solution quality,\u201d European Journal of Operational Research, vol. 69, pp. 238\u2013243, 1993.,","journal-title":"European Journal of Operational Research"},{"key":"3069_CR22","first-page":"173","volume-title":"Quadratic Assignment and Related Problems","author":"Y. Li","year":"1994","unstructured":"Y. Li, P.M. Pardalos, and M.G.C. Resende, \u201cA greedy randomized adaptive search procedure for the quadratic assignment problem,\u201d in Quadratic Assignment and Related Problems, P.M. Pardalos and H. Wolkowicz (Eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16, AMS: Providence, Rhode Island, 1994, pp. 173\u2013187.,"},{"issue":"3","key":"3069_CR23","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1023\/A:1008743718053","volume":"15","author":"M.H. Lim","year":"2000","unstructured":"M.H. Lim, Y. Yuan, and S. Omatu, \u201cEfficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem,\u201d Computational Optimization and Applications, vol. 15, no. 3, pp. 249\u2013268, 2000.,","journal-title":"Computational Optimization and Applications"},{"issue":"1","key":"3069_CR24","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1023\/A:1019972523847","volume":"23","author":"M.H. Lim","year":"2002","unstructured":"M.H. Lim, Y. Yuan, and S. Omatu, \u201cExtensive testing of a hybrid genetic algorithm for solving quadratic assignment problems,\u201d Computational Optimization and Applications, vol. 23, no. 1, pp. 47\u201364, 2002.,","journal-title":"Computational Optimization and Applications"},{"issue":"5","key":"3069_CR25","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/69.806935","volume":"11","author":"V. Maniezzo","year":"1999","unstructured":"V. Maniezzo and A. Colorni, \u201cThe ant system applied to the quadratic assignment problem,\u201d IEEE Transactions on Knowledge and Data Engineering, vol. 11, no. 5, pp. 769\u2013778, 1999.,","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"3069_CR26","unstructured":"P. Merz and B. Freisleben, \u201cA genetic local search approach to the quadratic assignment problem,\u201d in Proc. of the 7th International Conference of Genetic Algorithms, Morgan Kauffman Publishers, 1997, pp. 465\u2013472.,"},{"issue":"4","key":"3069_CR27","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/4235.887234","volume":"4","author":"P. Merz","year":"2000","unstructured":"P. Merz and B. Freisleben, \u201cFitness landscape analysis and memetic algorithms for the quadratic assignment problem,\u201d IEEE Transactions on Evolutionary Computation, vol. 4, no. 4, pp. 337\u2013352, 2000.,","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"3069_CR28","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0950-7051(03)00027-3","volume":"16","author":"A. Misevicius","year":"2003","unstructured":"A. Misevicius, \u201cGenetic algorithm hybridized with ruin and recreate procedure: Application to the quadratic assignment problem,\u201d Knowledge-Based Systems, vol. 16, pp. 261\u2013268, 2003.,","journal-title":"Knowledge-Based Systems"},{"key":"3069_CR29","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0377-2217(00)00029-1","volume":"130","author":"L.S. Pitsoulis","year":"2001","unstructured":"L.S. Pitsoulis, P.M. Pardalos, and D.W. Hearn, \u201cApproximate solutions to the turbine balancing problem,\u201d European Journal of Operational Research, vol. 130, pp. 147\u2013155, 2001.,","journal-title":"European Journal of Operational Research"},{"key":"3069_CR30","unstructured":"M. Rijal, Scheduling, design and assignment problems with quadratic costs, PhD thesis, New York University, New York, USA, 1995.,"},{"key":"3069_CR31","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1016\/S0360-8352(99)00153-9","volume":"36","author":"D.F. Rossin","year":"1999","unstructured":"D.F. Rossin, M.C. Springer, and B.D. Klein, \u201cNew complexity measures for the facility layout problem: An empirical study using traditional and neural network analysis,\u201d Computers & Industrial Engineering, vol. 36, pp. 585\u2013602, 1999.,","journal-title":"Computers & Industrial Engineering"},{"issue":"8","key":"3069_CR32","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1016\/0305-0548(94)90015-9","volume":"21","author":"J. Skorin-Kapov","year":"1994","unstructured":"J. Skorin-Kapov, \u201cExtensions of a tabu search adaptation to the quadratic assignment problem,\u201d Computers & Operations Research, vol. 21, no. 8, pp. 855\u2013865, 1994.,","journal-title":"Computers & Operations Research"},{"key":"3069_CR33","unstructured":"T. Starkweather, D. Whitley, C. Whitley, K. Mathial, \u201cA comparison of genetic sequencing operators,\u201d in Proc. Fourth Int. Conf. On Genetic Algorithms, Morgan Kaufmann, 1991, pp. 69\u201376.,"},{"key":"3069_CR34","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1137\/1003003","volume":"3","author":"L. Steinberg","year":"1961","unstructured":"L. Steinberg, \u201cThe backboard wiring problem: A placement algorithm,\u201d SIAM Review, vol. 3, pp. 37\u201350, 1961.,","journal-title":"SIAM Review"},{"key":"3069_CR35","unstructured":"T. St\u00fctzle, \u201cMAX-MIN Ant system for the quadratic assignment problems,\u201d Technical Report AIDA-97-04, FG Intellektik, FB Informatik, TU Darmstadt, march 1997.,"},{"key":"3069_CR36","unstructured":"T. St\u00fctzle, \u201cIterated local search for the quadratic assignment problem,\u201d Technical Report AIDA-99-03, FG Intellektik, FB Informatik, TU Darmstadt, March 1999.,"},{"key":"3069_CR37","unstructured":"T. St\u00fctzle and M. Dorigo, \u201cACO Algorithms for the quadratic assignment problem,\u201d in New Ideas in Optimization, D. Corne, M. Dorigo and F. Glove (Eds.), McGraw-Hill, 1999.,"},{"key":"3069_CR38","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E.D. Taillard","year":"1991","unstructured":"E.D. Taillard \u201cRobust taboo search for the quadratic assignment problem,\u201d Parallel Computing, vol. 17, pp. 443\u2013455, 1991.,","journal-title":"Parallel Computing"},{"key":"3069_CR39","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0966-8349(95)00008-6","volume":"3","author":"E.D. Taillard","year":"1995","unstructured":"E.D. Taillard, \u201cComparison of iterative searches for the quadratic assignment problem,\u201d Location Science, vol. 3, pp. 87\u2013105, 1995.,","journal-title":"Location Science"},{"key":"3069_CR40","unstructured":"E.-G. Talbi, Z. Hafidi and J.-M. Geib, \u201cParallel adaptive tabu search for large optimization problems,\u201d in Second Metaheuristics International Conference, MIC'97, Sophia-Antipolis, France, 1997, pp. 137\u2013142.,"},{"key":"3069_CR41","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/S0167-739X(99)00124-7","volume":"17","author":"E.-G. Talbi","year":"2001","unstructured":"E.-G. Talbi, O. Roux, C. Fonlupt, and D. Robillard, \u201cParallel ant colonies for the quadratic assignment problem,\u201d Future Generation Computer Systems, vol. 17, pp. 441\u2013449, 2001.,","journal-title":"Future Generation Computer Systems"},{"issue":"1","key":"3069_CR42","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0305-0548(93)E0020-T","volume":"22","author":"D.M. Tate","year":"1995","unstructured":"D.M. Tate and A.E. Smith, \u201cA genetic approach to the quadratic assignment problem,\u201d Computers and Operations Research, vol. 22, no. 1, pp. 73\u201383, 1995.,","journal-title":"Computers and Operations Research"},{"key":"3069_CR43","unstructured":"All tables in this paper are posted at http:\/\/www.math.ufl.edu\/~coap.,"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-3069-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-005-3069-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-3069-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T17:37:00Z","timestamp":1586626620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-005-3069-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,18]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,5]]}},"alternative-id":["3069"],"URL":"https:\/\/doi.org\/10.1007\/s10589-005-3069-9","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10,18]]}}}