{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T13:37:34Z","timestamp":1778852254441,"version":"3.51.4"},"reference-count":68,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100012542","name":"Sichuan Province Science and Technology Support Program","doi-asserted-by":"publisher","award":["2019YFG0285"],"award-info":[{"award-number":["2019YFG0285"]}],"id":[{"id":"10.13039\/100012542","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002338","name":"Ministry of Education of the People's Republic of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002338","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["51675450"],"award-info":[{"award-number":["51675450"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["51205328"],"award-info":[{"award-number":["51205328"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013139","name":"Humanities and Social Science Fund of Ministry of Education of the People's Republic of China","doi-asserted-by":"publisher","award":["18YJC630255"],"award-info":[{"award-number":["18YJC630255"]}],"id":[{"id":"10.13039\/501100013139","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Advanced Engineering Informatics"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1016\/j.aei.2022.101700","type":"journal-article","created":{"date-parts":[[2022,8,27]],"date-time":"2022-08-27T13:22:20Z","timestamp":1661606540000},"page":"101700","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":15,"special_numbering":"C","title":["A fast two-stage hybrid meta-heuristic algorithm for robust corridor allocation problem"],"prefix":"10.1016","volume":"53","author":[{"given":"Zeqiang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juhua","family":"Gong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junqi","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.aei.2022.101700_b0005","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/j.ejor.2013.07.010","article-title":"Simulated annealing and tabu search approaches for the corridor allocation problem","volume":"232","author":"Ahonen","year":"2014","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"10.1016\/j.aei.2022.101700_b0010","doi-asserted-by":"crossref","first-page":"3325","DOI":"10.1016\/j.cor.2012.04.016","article-title":"The corridor allocation problem","volume":"39","author":"Amaral","year":"2012","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.aei.2022.101700_b0015","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s11590-011-0426-8","article-title":"Optimal solutions for the double row layout problem","volume":"7","author":"Amaral","year":"2013","journal-title":"Opt. Lett."},{"key":"10.1016\/j.aei.2022.101700_b0020","first-page":"1","article-title":"A heuristic approach for the double row layout problem","author":"Amaral","year":"2020","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"10.1016\/j.aei.2022.101700_b0025","doi-asserted-by":"crossref","first-page":"1407","DOI":"10.1007\/s11590-020-01651-7","article-title":"A mixed-integer programming formulation of the double row layout problem based on a linear extension of a partial order","volume":"15","author":"Amaral","year":"2021","journal-title":"Opt. Lett."},{"issue":"6","key":"10.1016\/j.aei.2022.101700_b0030","doi-asserted-by":"crossref","first-page":"1317","DOI":"10.1007\/s10845-015-1053-5","article-title":"Solving unequal-area static and dynamic facility layout problems using modified particle swarm optimization","volume":"28","author":"Asl","year":"2017","journal-title":"J. Intell. Manuf."},{"issue":"3","key":"10.1016\/j.aei.2022.101700_b0035","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S1474-0346(02)00012-5","article-title":"An Evolutionary Parallel Tabu Search approach for distribution systems reinforcement planning","volume":"16","author":"Augugliaro","year":"2002","journal-title":"Adv. Eng. Inf."},{"issue":"1","key":"10.1016\/j.aei.2022.101700_b0040","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/opre.1030.0065","article-title":"The Price of Robustness","volume":"52","author":"Bertsimas","year":"2004","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/j.aei.2022.101700_b0045","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1007\/s10845-019-01468-x","article-title":"A methodology for solving facility layout problem considering barriers: genetic algorithm coupled with A* search","volume":"31","author":"Besbes","year":"2020","journal-title":"J. Intell. Manuf."},{"issue":"4","key":"10.1016\/j.aei.2022.101700_b0050","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1007\/s10845-020-01603-z","article-title":"3D facility layout problem","volume":"32","author":"Besbes","year":"2021","journal-title":"J. Intell. Manuf."},{"key":"10.1016\/j.aei.2022.101700_b0055","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2019.106244","article-title":"A mixed integer programming model for a double row layout problem","volume":"140","author":"Chae","year":"2020","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"10.1016\/j.aei.2022.101700_b0060","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1080\/00207540802192126","article-title":"The double row layout problem","volume":"48","author":"Chung","year":"2010","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"10.1016\/j.aei.2022.101700_b0065","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.arcontrol.2007.04.001","article-title":"Facility layout problems: A survey","volume":"31","author":"Drira","year":"2007","journal-title":"Ann. Rev. Control"},{"issue":"9\u201312","key":"10.1016\/j.aei.2022.101700_b0070","doi-asserted-by":"crossref","first-page":"2215","DOI":"10.1007\/s00170-013-4820-5","article-title":"Managing a new multi-objective model for the dynamic facility layout problem","volume":"68","author":"Emami","year":"2013","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"3","key":"10.1016\/j.aei.2022.101700_b0075","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10845-005-7025-4","article-title":"The facility layout problem approached using a fuzzy model and a genetic search","volume":"16","author":"Enea","year":"2005","journal-title":"J. Intell. Manuf."},{"issue":"4","key":"10.1016\/j.aei.2022.101700_b0080","doi-asserted-by":"crossref","first-page":"1801","DOI":"10.3934\/jimo.2019030","article-title":"An integrated dynamic facility layout and job shop scheduling problem: A hybrid NSGA-II and local search algorithm","volume":"16","author":"Erfani","year":"2020","journal-title":"J. Ind. Manage. Opt."},{"key":"10.1016\/j.aei.2022.101700_b0085","doi-asserted-by":"crossref","first-page":"101418","DOI":"10.1016\/j.aei.2021.101418","article-title":"Two hybrid meta-heuristic algorithms for a dual-channel closed-loop supply chain network design problem in the tire industry under uncertainty","volume":"50","author":"Fathollahi-Fard","year":"2021","journal-title":"Adv. Eng. Inf."},{"issue":"4","key":"10.1016\/j.aei.2022.101700_b0090","doi-asserted-by":"crossref","first-page":"1718","DOI":"10.1016\/j.asoc.2013.01.003","article-title":"Handling qualitative aspects in unequal area facility layout problem: an interactive genetic algorithm","volume":"13","author":"Garc\u00eda-Hern\u00e1ndez","year":"2013","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"10.1016\/j.aei.2022.101700_b0095","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1177\/003754970107600201","article-title":"A new heuristic optimization algorithm: harmony search","volume":"76","author":"Geem","year":"2001","journal-title":"Simulation"},{"key":"10.1016\/j.aei.2022.101700_b0100","series-title":"Handbook of combinatorial optimization","first-page":"2093","article-title":"Tabu search","author":"Glover","year":"1998"},{"key":"10.1016\/j.aei.2022.101700_b0105","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.jmsy.2020.11.014","article-title":"Hybrid algorithm of harmony search for dynamic parallel row ordering problem","volume":"58","author":"Gong","year":"2021","journal-title":"J. Manuf. Syst."},{"key":"10.1016\/j.aei.2022.101700_b0110","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105283","article-title":"Mixed integer linear programming model and an effective algorithm for the bi-objective double-floor corridor allocation problem","volume":"132","author":"Guan","year":"2021","journal-title":"Comput. Oper. Res."},{"issue":"20","key":"10.1016\/j.aei.2022.101700_b0115","doi-asserted-by":"crossref","first-page":"6506","DOI":"10.1080\/00207543.2019.1566673","article-title":"A flower pollination algorithm for the double-floor corridor allocation problem","volume":"57","author":"Guan","year":"2019","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.aei.2022.101700_b0120","doi-asserted-by":"crossref","first-page":"963","DOI":"10.1016\/j.apm.2019.08.015","article-title":"A decomposition-based algorithm for the double row layout problem","volume":"77","author":"Guan","year":"2020","journal-title":"Appl. Math. Model."},{"key":"10.1016\/j.aei.2022.101700_b0125","doi-asserted-by":"crossref","first-page":"101252","DOI":"10.1016\/j.aei.2021.101252","article-title":"Modeling berth allocation and quay crane assignment considering QC driver cost and operating efficiency","volume":"47","author":"He","year":"2021","journal-title":"Adv. Eng. Inf."},{"issue":"1","key":"10.1016\/j.aei.2022.101700_b0130","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1109\/TII.2021.3056425","article-title":"Multiobjective Optimization of Energy-Efficient JOB-Shop Scheduling With Dynamic Reference Point-Based Fuzzy Relative Entropy","volume":"18","author":"He","year":"2022","journal-title":"IEEE Trans. Ind. Inf."},{"key":"10.1016\/j.aei.2022.101700_b0135","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2019.100575","article-title":"A discrete multi-objective fireworks algorithm for flowshop scheduling with sequence-dependent setup times","volume":"51","author":"He","year":"2019","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.aei.2022.101700_b0140","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.aei.2018.04.007","article-title":"An adaptive clustering-based genetic algorithm for the dual-gantry pick-and-place machine optimization","volume":"37","author":"He","year":"2018","journal-title":"Adv. Eng. Inf."},{"issue":"4","key":"10.1016\/j.aei.2022.101700_b0145","first-page":"231","article-title":"A concurrent approach for facility layout and AMHS design in semiconductor manufacturing","volume":"21","author":"Hong","year":"2014","journal-title":"Int. J. Ind. Eng.: Theory Appl. Pract."},{"issue":"1","key":"10.1016\/j.aei.2022.101700_b0150","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1007\/s00170-017-0895-8","article-title":"Classification of facility layout problems: a review study","volume":"94","author":"Hosseini-Nasab","year":"2018","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.aei.2022.101700_b0155","doi-asserted-by":"crossref","first-page":"S2433","DOI":"10.1051\/ro\/2020127","article-title":"A new soft computing algorithm based on cloud theory for dynamic facility layout problem","volume":"55","author":"Hosseini","year":"2021","journal-title":"RAIRO-Oper. Res."},{"issue":"5","key":"10.1016\/j.aei.2022.101700_b0160","doi-asserted-by":"crossref","first-page":"1257","DOI":"10.1080\/00207543.2013.828163","article-title":"Single-row equidistant facility layout as a special case of single-row facility layout","volume":"52","author":"Hungerlaender","year":"2014","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.aei.2022.101700_b0165","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/j.cie.2016.02.026","article-title":"A robust mathematical model and ACO solution for multi-floor discrete layout problem with uncertain locations and demands","volume":"96","author":"Izadinia","year":"2016","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.aei.2022.101700_b0170","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.cie.2014.09.023","article-title":"A robust model for multi-floor layout problem","volume":"78","author":"Izadinia","year":"2014","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.aei.2022.101700_b0175","doi-asserted-by":"crossref","first-page":"101306","DOI":"10.1016\/j.aei.2021.101306","article-title":"A heuristic optimization approach for multi-vehicle and one-cargo green transportation scheduling in shipbuilding","volume":"49","author":"Jiang","year":"2021","journal-title":"Adv. Eng. Inf."},{"key":"10.1016\/j.aei.2022.101700_b0180","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.cor.2014.07.008","article-title":"Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm","volume":"52","author":"Kalita","year":"2014","journal-title":"Comput. Oper. Res."},{"issue":"5\u20138","key":"10.1016\/j.aei.2022.101700_b0185","doi-asserted-by":"crossref","first-page":"2173","DOI":"10.1007\/s00170-018-2370-6","article-title":"A constrained single-row facility layout problem","volume":"98","author":"Kalita","year":"2018","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.aei.2022.101700_b0195","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/j.eswa.2017.02.047","article-title":"Harmony search for the layout design of an unequal area facility","volume":"79","author":"Kang","year":"2017","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"10.1016\/j.aei.2022.101700_b0200","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s10845-007-0020-1","article-title":"Approaches to uncertainties in facility layout problems: Perspectives at the beginning of the 21st Century","volume":"18","author":"Kulturel-Konak","year":"2007","journal-title":"J. Intell. Manuf."},{"issue":"3","key":"10.1016\/j.aei.2022.101700_b0205","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1016\/j.ejor.2012.07.019","article-title":"A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays","volume":"223","author":"Kulturel-Konak","year":"2012","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20132","key":"10.1016\/j.aei.2022.101700_b0210","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1080\/00207543.2017.1351644","article-title":"Smart manufacturing","volume":"56","author":"Kusiak","year":"2018","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.aei.2022.101700_b0215","article-title":"Many-Objective Evolutionary Algorithm With Reference Point-Based Fuzzy Correlation Entropy for Energy-Efficient Job Shop Scheduling With Limited Workers","volume":"1\u201314","author":"Li","year":"2021","journal-title":"IEEE Trans. Cybern."},{"issue":"4","key":"10.1016\/j.aei.2022.101700_b0220","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1007\/s10845-020-01693-9","article-title":"A novel hybrid immune clonal selection algorithm for the constrained corridor allocation problem","volume":"33","author":"Liu","year":"2022","journal-title":"J. Intell. Manuf."},{"issue":"06","key":"10.1016\/j.aei.2022.101700_b0225","first-page":"299","article-title":"An Algorithm for Solving Generalized Single Row Facility Layout Problem","volume":"10","author":"Meskar","year":"2020","journal-title":"Am. J. Oper. Res."},{"issue":"11","key":"10.1016\/j.aei.2022.101700_b0230","doi-asserted-by":"crossref","first-page":"3243","DOI":"10.1080\/00207543.2014.970712","article-title":"Integrating occupational health and safety in facility layout planning, part I: methodology","volume":"53","author":"Moatari-Kazerouni","year":"2014","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"10.1016\/j.aei.2022.101700_b0235","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1016\/j.cie.2011.10.004","article-title":"An integrated synthetic value of fuzzy judgments and nonlinear programming methodology for ranking the facility layout patterns","volume":"62","author":"Mohamadghasemi","year":"2012","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"10.1016\/j.aei.2022.101700_b0240","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s10033-017-0073-9","article-title":"Performance analysis of intelligent robust facility layout design","volume":"30","author":"Moslemipour","year":"2017","journal-title":"Chinese J. Mech. Eng."},{"key":"10.1016\/j.aei.2022.101700_b0245","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/j.ins.2014.03.067","article-title":"A new model for robust facility layout problem","volume":"278","author":"Neghabi","year":"2014","journal-title":"Inf. Sci."},{"issue":"1\u20134","key":"10.1016\/j.aei.2022.101700_b0250","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00170-013-5564-y","article-title":"A robust single row facility layout problem with fuzzy random variables","volume":"72","author":"Nematian","year":"2014","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"3","key":"10.1016\/j.aei.2022.101700_b0255","doi-asserted-by":"crossref","first-page":"800","DOI":"10.1016\/j.ejor.2015.05.055","article-title":"Fast local search for single row facility layout","volume":"246","author":"Palubeckis","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.aei.2022.101700_b0260","first-page":"287","article-title":"Fast simulated annealing for single-row equidistant facility layout","volume":"263","author":"Palubeckis","year":"2015","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"10.1016\/j.aei.2022.101700_b0265","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1080\/00207543.2019.1708990","article-title":"Solving the grocery backroom layout problem","volume":"59","author":"Pires","year":"2020","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.aei.2022.101700_b0270","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2012.07.003","article-title":"Adaptive variable neighborhood search for solving multi-objective facility layout problems with unequal area facilities","volume":"8","author":"Ripon","year":"2013","journal-title":"Swarm Evol. Comput."},{"issue":"1","key":"10.1016\/j.aei.2022.101700_b0275","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s10479-020-03704-7","article-title":"Mathematical formulation and hybrid meta-heuristic solution approaches for dynamic single row facility layout problem","volume":"295","author":"\u015eahin","year":"2020","journal-title":"Ann. Oper. Res."},{"issue":"9","key":"10.1016\/j.aei.2022.101700_b0280","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1007\/s00170-015-7290-0","article-title":"A bi-objective MIP model for facility layout problem in uncertain environment","volume":"81","author":"Salmani","year":"2015","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"1","key":"10.1016\/j.aei.2022.101700_b0285","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.ejor.2009.11.034","article-title":"An efficient tabu algorithm for the single row facility layout problem","volume":"205","author":"Samarghandi","year":"2010","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"10.1016\/j.aei.2022.101700_b0290","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1287\/opre.17.5.812","article-title":"One-Dimensional Space Allocation: An Ordering Algorithm","volume":"17","author":"Simmons","year":"1969","journal-title":"Oper. Res."},{"key":"10.1016\/j.aei.2022.101700_b0295","doi-asserted-by":"crossref","unstructured":"L. Tang, X. Zuo, C. Wang, X. Zhao, A MOEA\/D based approach for solving robust double row layout problem, in: Paper presented at the 2015 IEEE Congress on Evolutionary Computation (CEC), 2015.","DOI":"10.1109\/CEC.2015.7257126"},{"key":"10.1016\/j.aei.2022.101700_b0300","doi-asserted-by":"crossref","unstructured":"N.S. Targhi, M. Sabzehparvar, S. Ebrahimnezhad, A Mathematical Model for Robust Facility Layout Problem in 3D Space with Possibility of Floors, in: Paper presented at the 2019 15th Iran International Industrial Engineering Conference (IIIEC), 2019.","DOI":"10.1109\/IIIEC.2019.8720721"},{"issue":"5","key":"10.1016\/j.aei.2022.101700_b0305","doi-asserted-by":"crossref","first-page":"1805","DOI":"10.1109\/TSMC.2017.2788879","article-title":"A Knowledge-Based Cooperative Algorithm for Energy-Efficient Scheduling of Distributed Flow-Shop","volume":"50","author":"Wang","year":"2020","journal-title":"IEEE Trans. Syst., Man, Cybernet.: Syst."},{"issue":"12","key":"10.1016\/j.aei.2022.101700_b0310","doi-asserted-by":"crossref","first-page":"2264","DOI":"10.1177\/0954405415615728","article-title":"A robust approach to design a single facility layout plan in dynamic manufacturing environments using a permutation-based genetic algorithm","volume":"230","author":"Zarea Fazlelahi","year":"2016","journal-title":"Proc. Inst. Mech. Eng., Part B: J. Eng. Manuf."},{"issue":"5","key":"10.1016\/j.aei.2022.101700_b0315","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1007\/s10845-014-0875-x","article-title":"Job-shop cell-scheduling problem with inter-cell moves and automated guided vehicles","volume":"26","author":"Zeng","year":"2015","journal-title":"J. Intell. Manuf."},{"key":"10.1016\/j.aei.2022.101700_b0320","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/j.procir.2017.03.079","article-title":"Robust Facility Layout Design under Uncertain Product Demands","volume":"63","author":"Zha","year":"2017","journal-title":"Proc. CIRP"},{"issue":"1","key":"10.1016\/j.aei.2022.101700_b0325","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/s00500-019-03925-4","article-title":"An improved scatter search algorithm for the corridor allocation problem considering corridor width","volume":"24","author":"Zhang","year":"2020","journal-title":"Soft. Comput."},{"issue":"15","key":"10.1016\/j.aei.2022.101700_b0330","doi-asserted-by":"crossref","first-page":"4220","DOI":"10.1080\/00207543.2011.603371","article-title":"A corrected formulation for the double row layout problem","volume":"50","author":"Zhang","year":"2012","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.aei.2022.101700_b0335","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/j.aei.2018.07.007","article-title":"Capacitated closed-loop supply chain network design under uncertainty","volume":"38","author":"Zhen","year":"2018","journal-title":"Adv. Eng. Inf."},{"key":"10.1016\/j.aei.2022.101700_b0340","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2021.104503","article-title":"An effective hybrid meta-heuristic for flexible flow shop scheduling with limited buffers and step-deteriorating jobs","volume":"106","author":"Zheng","year":"2021","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"4","key":"10.1016\/j.aei.2022.101700_b0345","doi-asserted-by":"crossref","first-page":"1122","DOI":"10.1109\/TASE.2014.2304471","article-title":"Solving an Extended Double Row Layout Problem Using Multiobjective Tabu Search and Linear Programming","volume":"11","author":"Zuo","year":"2014","journal-title":"IEEE Trans. Autom. Sci. Eng."}],"container-title":["Advanced Engineering Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1474034622001598?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1474034622001598?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T19:57:08Z","timestamp":1778615828000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1474034622001598"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8]]},"references-count":68,"alternative-id":["S1474034622001598"],"URL":"https:\/\/doi.org\/10.1016\/j.aei.2022.101700","relation":{},"ISSN":["1474-0346"],"issn-type":[{"value":"1474-0346","type":"print"}],"subject":[],"published":{"date-parts":[[2022,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A fast two-stage hybrid meta-heuristic algorithm for robust corridor allocation problem","name":"articletitle","label":"Article Title"},{"value":"Advanced Engineering Informatics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.aei.2022.101700","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"101700"}}