{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T14:17:02Z","timestamp":1770473822314,"version":"3.49.0"},"reference-count":50,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1998,4]]},"DOI":"10.1016\/s0377-2217(97)00285-3","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"457-488","source":"Crossref","is-referenced-by-count":43,"title":["Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation"],"prefix":"10.1016","volume":"106","author":[{"given":"Wen-Chyuan","family":"Chiang","sequence":"first","affiliation":[]},{"given":"Chi","family":"Chiang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00285-3_BIB1","series-title":"Proceedings of AIIE 1972 Spring Conference","first-page":"112","article-title":"A computerized plant layout analysis and evaluation technique","author":"Apple","year":"1972"},{"issue":"2","key":"10.1016\/S0377-2217(97)00285-3_BIB2","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1287\/mnsc.9.2.294","article-title":"A heuristic algorithm and simulation approach to the relative location of facilities","volume":"9","author":"Armour","year":"1963","journal-title":"Management Science"},{"issue":"6","key":"10.1016\/S0377-2217(97)00285-3_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0898-1221(94)00147-2","article-title":"Simulated annealing and tabu search in the long run: a comparison on QAP tasks","volume":"28","author":"Battiti","year":"1994","journal-title":"Computers and Mathematics with Applications"},{"issue":"4","key":"10.1016\/S0377-2217(97)00285-3_BIB4","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1080\/05695557508975028","article-title":"Computerized layout design: a branch and bound approach","volume":"7","author":"Bazaraa","year":"1975","journal-title":"AIIE Transactions"},{"key":"10.1016\/S0377-2217(97)00285-3_BIB5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/nav.3800260111","article-title":"An exact branch and bound procedure for quadratic assignment problems","volume":"26","author":"Bazaraa","year":"1979","journal-title":"Naval Research Logistics Quarterly"},{"issue":"1","key":"10.1016\/S0377-2217(97)00285-3_BIB6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/nav.3800270104","article-title":"Bender's partitioning scheme applied to a new formulation of the quadratic assignment problem","volume":"27","author":"Bazaraa","year":"1980","journal-title":"Naval Research Logistics Quarterly"},{"issue":"1","key":"10.1016\/S0377-2217(97)00285-3_BIB7","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0377-2217(95)00149-2","article-title":"Simulated annealing approach for the one-machine mean tardiness scheduling problem","volume":"93","author":"Ben-Daya","year":"1996","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/S0377-2217(97)00285-3_BIB8","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1137\/1026105","article-title":"The N-City travelling salesman problem: statistical mechanics and the metropolis algorithm","volume":"26","author":"Bonomi","year":"1984","journal-title":"SIAM Review"},{"key":"10.1016\/S0377-2217(97)00285-3_BIB9","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0377-2217(86)90193-1","article-title":"The asymptotic behavior of quadratic sum assignment problems: a statistical mechanics approach","volume":"26","author":"Bonomi","year":"1986","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00285-3_BIB10","series-title":"Discrete Location Theory","article-title":"Locations with spatial interactions: the quadratic assignment Problem","author":"Burkard","year":"1990"},{"key":"10.1016\/S0377-2217(97)00285-3_BIB11","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0377-2217(84)90231-5","article-title":"A thermodynamically motivated simulation procedure for combinatorial optimization problems","volume":"17","author":"Burkard","year":"1984","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00285-3_BIB12","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/nav.3800250111","article-title":"Numerical investigation on quadratic assignment problems","volume":"25","author":"Burkard","year":"1978","journal-title":"Naval Research Logistic Quarterly"},{"key":"10.1016\/S0377-2217(97)00285-3_BIB13","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF02022999","article-title":"Massively parallel tabu search for the quadratic assignment problem","volume":"41","author":"Chakrapani","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(97)00285-3_BIB14","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1287\/mnsc.17.3.161","article-title":"Modular allocation technique","volume":"17","author":"Edwards","year":"1970","journal-title":"Management Science"},{"issue":"12","key":"10.1016\/S0377-2217(97)00285-3_BIB15","doi-asserted-by":"crossref","first-page":"1414","DOI":"10.1287\/mnsc.29.12.1414","article-title":"Techniques for facilities layout: deciding which pairs of activities should be adjacent","volume":"29","author":"Foulds","year":"1983","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00285-3_BIB16","series-title":"Facility Layout and Location: An Analytical Approach","author":"Francis","year":"1974"},{"key":"10.1016\/S0377-2217(97)00285-3_BIB17","series-title":"Facility Layout and Location: An Analytical Approach","author":"Francis","year":"1992"},{"issue":"2","key":"10.1016\/S0377-2217(97)00285-3_BIB18","first-page":"305","article-title":"Optimal and suboptimal algorithms for the quadratic assignment problem","volume":"10","author":"Gilmore","year":"1963","journal-title":"SIAM Journal"},{"key":"10.1016\/S0377-2217(97)00285-3_BIB19","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search, Part 1","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00285-3_BIB20","series-title":"Interfaces in Computer Science and Operations Research","article-title":"Tabu search and adaptive memory programming \u2014 Advances, applications, and challenges","author":"Glover","year":"1996"},{"key":"10.1016\/S0377-2217(97)00285-3_BIB21","series-title":"Modern Heuristic Techniques for Combinatorial Problems","article-title":"Tabu search","author":"Glover","year":"1993"},{"issue":"2","key":"10.1016\/S0377-2217(97)00285-3_BIB22","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1080\/00207548908942548","article-title":"A heuristic algorithm for the quadratic assignment formulation to the plant layout problem","volume":"27","author":"Golany","year":"1989","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(97)00285-3_BIB23","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/0377-2217(92)90042-8","article-title":"A distance assignment approach to the facility layout problem","volume":"57","author":"Heragu","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00285-3_BIB24","first-page":"33","article-title":"Quantitative tools for plant layout analysis","volume":"14","author":"Hillier","year":"1963","journal-title":"Journal of Industrial Engineering"},{"issue":"4","key":"10.1016\/S0377-2217(97)00285-3_BIB25","first-page":"586","article-title":"Quadratic assignment problem algorithms and the location of indivisible facilities","volume":"9","author":"Hiller","year":"1966","journal-title":"Management Science"},{"issue":"1","key":"10.1016\/S0377-2217(97)00285-3_BIB26","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1080\/00207549208942880","article-title":"CLASS: Computerized layout solutions using simulated annealing","volume":"30","author":"Jajodia","year":"1992","journal-title":"International Journal of Production Research"},{"issue":"3","key":"10.1016\/S0377-2217(97)00285-3_BIB27","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","article-title":"Optimization by simulated annealing: an experimental evaluation; Part II Graph coloring and number partitioning","volume":"39","author":"Johnson","year":"1991","journal-title":"Operations Research"},{"issue":"8","key":"10.1016\/S0377-2217(97)00285-3_BIB28","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1016\/0305-0548(94)90018-3","article-title":"A study of diversification strategies for the quadratic assignment problem","volume":"21","author":"Kelly","year":"1994","journal-title":"Computers and operations research"},{"issue":"1","key":"10.1016\/S0377-2217(97)00285-3_BIB29","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","article-title":"Assignment problems and the location of economic activities","volume":"25","author":"Koopmans","year":"1957","journal-title":"Econometrica"},{"issue":"4","key":"10.1016\/S0377-2217(97)00285-3_BIB30","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1080\/00207543.1992.9728452","article-title":"A simulated annealing procedure for single row layout problems in flexible manufacturing systems","volume":"30","author":"Kouvelis","year":"1992","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(97)00285-3_BIB31","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0377-2217(92)90043-9","article-title":"Simulated annealing for machine layout problems in the presence of zoning constraints","volume":"57","author":"Kouvelis","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00285-3_BIB32","series-title":"Intelligent Manufacturing Systems","author":"Kusiak","year":"1990"},{"issue":"3","key":"10.1016\/S0377-2217(97)00285-3_BIB33","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0377-2217(87)90238-4","article-title":"The facility layout problem","volume":"29","author":"Kusiak","year":"1987","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/S0377-2217(97)00285-3_BIB34","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1287\/mnsc.39.4.492","article-title":"Bandwidth packing: a tabu search approach","volume":"39","author":"Laguna","year":"1993","journal-title":"Management Science"},{"issue":"4","key":"10.1016\/S0377-2217(97)00285-3_BIB35","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","article-title":"The quadratic assignment problem","volume":"9","author":"Lawler","year":"1963","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00285-3_BIB36","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/opre.16.1.150","article-title":"An experimental comparison of techniques for the assignment of facilities to locations","volume":"16","author":"Nugent","year":"1968","journal-title":"Operations Research"},{"issue":"10","key":"10.1016\/S0377-2217(97)00285-3_BIB37","doi-asserted-by":"crossref","first-page":"1238","DOI":"10.1287\/mnsc.30.10.1238","article-title":"Perturbation scheme to improve Hillier's solution to the facilities layout problem","volume":"30","author":"Picone","year":"1984","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00285-3_BIB38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/nav.3800180102","article-title":"Tree search algorithms for the quadratic assignment problem","volume":"18","author":"Pierce","year":"1971","journal-title":"Naval Research Logistic Quarterly"},{"issue":"5","key":"10.1016\/S0377-2217(97)00285-3_BIB39","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1287\/opre.43.5.781","article-title":"Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming","volume":"43","author":"Resende","year":"1995","journal-title":"Operations Research"},{"issue":"4","key":"10.1016\/S0377-2217(97)00285-3_BIB40","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1080\/00207547908919617","article-title":"The facilities layout problem: a multigoal approach","volume":"17","author":"Rosenblatt","year":"1979","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(97)00285-3_BIB41","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0377-2217(92)90047-D","article-title":"A distance assignment approach to the facility layout problem","volume":"57","author":"Rosenblatt","year":"1992","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/S0377-2217(97)00285-3_BIB42","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","article-title":"P-complete approximation problem","volume":"23","author":"Sahni","year":"1976","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0377-2217(97)00285-3_BIB43","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1068\/b120443","article-title":"Facility layout optimization using the metropolis algorithm","volume":"B 12","author":"Sharpe","year":"1985","journal-title":"Environmental and Planning"},{"issue":"3","key":"10.1016\/S0377-2217(97)00285-3_BIB44","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0307-904X(85)90009-5","article-title":"An interactive model for the layout of buildings","volume":"9","author":"Sharpe","year":"1985","journal-title":"Applied Mathematical Modeling"},{"key":"10.1016\/S0377-2217(97)00285-3_BIB45","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1287\/ijoc.2.1.33","article-title":"Tabu search applied to the quadratic assignment problem","volume":"2","author":"Skorin-Kapov","year":"1990","journal-title":"ORSA Journal on Computing"},{"issue":"8","key":"10.1016\/S0377-2217(97)00285-3_BIB46","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1016\/0305-0548(94)90015-9","article-title":"Extensions of a tabu search adaptation to the quadratic assignment problem","volume":"21","author":"Skorin-Kapov","year":"1994","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(97)00285-3_BIB47","series-title":"Manufacturing Facilities","author":"Sule","year":"1988"},{"key":"10.1016\/S0377-2217(97)00285-3_BIB48","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","article-title":"Robust tabu search for the quadratic assignment","volume":"17","author":"Taillard","year":"1991","journal-title":"Parallel Computing"},{"key":"10.1016\/S0377-2217(97)00285-3_BIB49","series-title":"Simulated Annealing: Theory and Applications","author":"Van Laarhoven","year":"1987"},{"key":"10.1016\/S0377-2217(97)00285-3_BIB50","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1080\/07408178708975376","article-title":"Solving quadratic assignment problems by simulated annealing","volume":"19","author":"Wilhelm","year":"1987","journal-title":"IIE Transactions"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002853?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002853?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T20:58:22Z","timestamp":1556657902000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797002853"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":50,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0377221797002853"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00285-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}