{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T05:15:06Z","timestamp":1770441306533,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"7-8","license":[{"start":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T00:00:00Z","timestamp":1406851200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s00521-014-1678-x","type":"journal-article","created":{"date-parts":[[2014,7,31]],"date-time":"2014-07-31T13:53:42Z","timestamp":1406814822000},"page":"1871-1885","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":48,"title":["Hybrid imperialist competitive algorithm, variable neighborhood search, and simulated annealing for dynamic facility layout problem"],"prefix":"10.1007","volume":"25","author":[{"given":"Seyedmohsen","family":"Hosseini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdullah Al","family":"Khaled","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satish","family":"Vadlamani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,1]]},"reference":[{"issue":"3","key":"1678_CR1","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","volume":"2","author":"S Sahni","year":"1976","unstructured":"Sahni S, Gonzalez T (1976) P-complete approximation problems. J ACM 2(3):555\u2013565","journal-title":"J ACM"},{"issue":"1","key":"1678_CR2","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0377-2217(90)90301-Q","volume":"46","author":"DT Connolly","year":"1990","unstructured":"Connolly DT (1990) An improved annealing scheme for the QAP. Eur J Oper Res 46(1):93\u2013100","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1678_CR3","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/A:1008696503659","volume":"8","author":"J Clausen","year":"1997","unstructured":"Clausen J, Perregaard M (1997) Solving large quadratic assignment problem in parallel. Comput Optim Appl 8(2):111\u2013127","journal-title":"Comput Optim Appl"},{"issue":"1\u20134","key":"1678_CR4","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1023\/A:1021857607524","volume":"118","author":"P Mills","year":"2003","unstructured":"Mills P, Tsang EPE, Ford J (2003) Applying an extended guided local search on the quadratic assignment problem. Ann Oper Res 118(1\u20134):121\u2013135","journal-title":"Ann Oper Res"},{"issue":"3","key":"1678_CR5","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1080\/00207549308956741","volume":"31","author":"TA Lacksonen","year":"1993","unstructured":"Lacksonen TA, Enscore EE (1993) Quadratic assignment algorithms for the dynamic layout problem. Int J Prod Res 31(3):503\u2013517","journal-title":"Int J Prod Res"},{"issue":"1","key":"1678_CR6","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1287\/mnsc.32.1.76","volume":"32","author":"MJ Rosenblatt","year":"1986","unstructured":"Rosenblatt MJ (1986) The dynamics of plant layout. Manag Sci 32(1):76\u201386","journal-title":"Manag Sci"},{"issue":"1","key":"1678_CR7","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.ejor.2003.01.002","volume":"165","author":"T Dunker","year":"2005","unstructured":"Dunker T, Radons G, Westkamper E (2005) Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem. Eur J Oper Res 165(1):55\u201369","journal-title":"Eur J Oper Res"},{"issue":"14","key":"1678_CR8","doi-asserted-by":"crossref","first-page":"1403","DOI":"10.1016\/S0305-0548(00)00049-6","volume":"28","author":"A Baykasoglu","year":"2001","unstructured":"Baykasoglu A, Gindy NNZ (2001) A simulated annealing for dynamic facility layout problem. Comput Oper Res 28(14):1403\u20131426","journal-title":"Comput Oper Res"},{"issue":"2","key":"1678_CR9","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0925-5273(03)00027-6","volume":"86","author":"J Balakrishnan","year":"2003","unstructured":"Balakrishnan J, Cheng CH, Conway DG, Lau CM (2003) A hybrid genetic algorithm for the dynamic plants layout problem. Int J Prod Econ 86(2):107\u2013120","journal-title":"Int J Prod Econ"},{"issue":"3","key":"1678_CR10","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1016\/j.cor.2004.08.008","volume":"33","author":"AR McKendall","year":"2006","unstructured":"McKendall AR, Shang J (2006) Hybrid ant systems for the dynamic facility layout problem. Comput Oper Res 33(3):790\u2013803","journal-title":"Comput Oper Res"},{"issue":"8","key":"1678_CR11","doi-asserted-by":"crossref","first-page":"2431","DOI":"10.1016\/j.cor.2005.02.021","volume":"33","author":"AR McKendall","year":"2006","unstructured":"McKendall AR, Shang J, Kuppusamy S (2006) Simulated annealing heuristics for the dynamic layout problem. Comput Oper Res 33(8):2431\u20132444","journal-title":"Comput Oper Res"},{"issue":"4","key":"1678_CR12","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/j.omega.2004.12.001","volume":"34","author":"A Baykasoglu","year":"2006","unstructured":"Baykasoglu A, Dereli T, Sabuncu I (2006) An ant colony algorithm for solving budget constrained and unconstrained dynamic facility layout problems. Omega 34(4):385\u2013396","journal-title":"Omega"},{"key":"1678_CR13","doi-asserted-by":"crossref","unstructured":"Azimi P, Charmchi HR (2012) A new optimization via simulation approach for dynamic facility layout problem with budget constraints. Model Simul Eng. doi: 10.1155\/2012\/189742","DOI":"10.1155\/2012\/189742"},{"issue":"4","key":"1678_CR14","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1631\/jzus.A0820284","volume":"10","author":"H Rezazadeh","year":"2009","unstructured":"Rezazadeh H, Ghazanfari M, Saidi-Mehrabadi M, Sadjadi AJ (2009) An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem. J Zhejiang Univ Sci A 10(4):520\u2013529","journal-title":"J Zhejiang Univ Sci A"},{"issue":"2","key":"1678_CR15","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/j.ijpe.2012.12.012","volume":"142","author":"GYH Chen","year":"2013","unstructured":"Chen GYH (2013) A new data structure of solution representation in hybrid ant colony optimization for large dynamic facility layout problems. Int J Prod Econ 142(2):362\u2013371","journal-title":"Int J Prod Econ"},{"key":"1678_CR16","doi-asserted-by":"crossref","unstructured":"Atashpaz-Gargari E, Lucas C (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialist competition. In: IEEE congress evolutionary computation, pp 4661\u20134667","DOI":"10.1109\/CEC.2007.4425083"},{"issue":"12","key":"1678_CR17","doi-asserted-by":"crossref","first-page":"14490","DOI":"10.1016\/j.eswa.2011.04.241","volume":"38","author":"J Behnamian","year":"2011","unstructured":"Behnamian J, Zandieh M (2011) A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties. Expert Syst Appl 38(12):14490\u201314498","journal-title":"Expert Syst Appl"},{"issue":"1\u20134","key":"1678_CR18","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s00170-010-2937-3","volume":"54","author":"M Bagher","year":"2011","unstructured":"Bagher M, Zandieh M, Farsijani H (2011) Balancing of stochastic U-type assembly lines: an imperialist competitive algorithm. Int J Adv Manuf Technol 54(1\u20134):271\u2013285","journal-title":"Int J Adv Manuf Technol"},{"issue":"11\u201312","key":"1678_CR19","doi-asserted-by":"crossref","first-page":"3178","DOI":"10.1016\/j.ijheatmasstransfer.2012.02.041","volume":"55","author":"M Yousefi","year":"2012","unstructured":"Yousefi M, Darus AN, Mohammadi H (2012) An imperialist competitive algorithm for optimal design of plate-fin heat exchangers. Int J Heat Mass Transf 55(11\u201312):3178\u20133185","journal-title":"Int J Heat Mass Transf"},{"issue":"13","key":"1678_CR20","doi-asserted-by":"crossref","first-page":"1868","DOI":"10.1016\/j.patrec.2009.12.005","volume":"3","author":"H Duan","year":"2010","unstructured":"Duan H, Xu C, Liu S, Shao S (2010) Template matching using chaotic imperialist competitive algorithm. Pattern Recognit Lett 3(13):1868\u20131875","journal-title":"Pattern Recognit Lett"},{"issue":"18","key":"1678_CR21","doi-asserted-by":"crossref","first-page":"5117","DOI":"10.1080\/00207543.2011.653453","volume":"50","author":"K Lian","year":"2012","unstructured":"Lian K, Zhang C, Gao L, Shao X (2012) A modified colonial competitive algorithm for the mixed-model U-line balancing sequencing problem. Int J Prod Res 50(18):5117\u20135131","journal-title":"Int J Prod Res"},{"issue":"11","key":"1678_CR22","doi-asserted-by":"crossref","first-page":"2623","DOI":"10.1016\/j.mcm.2011.06.038","volume":"54","author":"M Mohammadi","year":"2011","unstructured":"Mohammadi M, Jolai F, Rostami H (2011) An M\/M\/c queue model for hub covering location problem. Math Comput Model 54(11):2623\u20132638","journal-title":"Math Comput Model"},{"issue":"11","key":"1678_CR23","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovic","year":"1997","unstructured":"Mladenovic N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097\u20131100","journal-title":"Comput Oper Res"},{"issue":"3","key":"1678_CR24","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen P, Mladenovic N (2001) Variable neighborhood search: principles and applications. Eur J Oper Res 130(3):449\u2013467","journal-title":"Eur J Oper Res"},{"key":"1678_CR25","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671\u2013680","journal-title":"Science"},{"key":"1678_CR26","volume-title":"Design and analysis of experiments","author":"DC Montgomery","year":"2000","unstructured":"Montgomery DC (2000) Design and analysis of experiments, 5th edn. Wiley, New York","edition":"5"},{"issue":"5","key":"1678_CR27","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/j.omega.2004.12.006","volume":"34","author":"R Ruiz","year":"2006","unstructured":"Ruiz R, Maroto C, Alcaraz J (2006) Two new robust genetic algorithm for the flow shop scheduling problem. Omega 34(5):461\u2013476","journal-title":"Omega"},{"key":"1678_CR28","unstructured":"Schaffer JD, Caruana RA, Eshelman L, Da R (1989) A study of control parameters affecting online performance of genetic algorithms for function optimization. In: 3rd international conference on genetics, pp 51\u201360"},{"key":"1678_CR29","volume-title":"Experimental designs","author":"WG Cochran","year":"1992","unstructured":"Cochran WG, Cox GM (1992) Experimental designs, 2nd edn. Wiley, USA","edition":"2"},{"key":"1678_CR30","volume-title":"Quality engineering using robust design","author":"MS Phadke","year":"1989","unstructured":"Phadke MS (1989) Quality engineering using robust design. Prentice-Hall, Upper Saddle River"},{"issue":"12","key":"1678_CR31","doi-asserted-by":"crossref","first-page":"1275","DOI":"10.1057\/palgrave.jors.2601646","volume":"54","author":"E Erel","year":"2003","unstructured":"Erel E, Ghosh JB, Simon JT (2003) New heuristic for the dynamic layout problem. J Oper Res Soc 54(12):1275\u20131282","journal-title":"J Oper Res Soc"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s00521-014-1678-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/article\/10.1007\/s00521-014-1678-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s00521-014-1678-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T12:01:00Z","timestamp":1565697660000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/10.1007\/s00521-014-1678-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,1]]},"references-count":31,"journal-issue":{"issue":"7-8","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["1678"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/s00521-014-1678-x","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,1]]}}}