{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T21:03:45Z","timestamp":1781298225915,"version":"3.54.1"},"reference-count":80,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.cor.2026.107537","type":"journal-article","created":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T02:35:42Z","timestamp":1778812542000},"page":"107537","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["An efficient memetic algorithm for the corridor allocation problem"],"prefix":"10.1016","volume":"194","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4991-1505","authenticated-orcid":false,"given":"Gintaras","family":"Palubeckis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3746-8200","authenticated-orcid":false,"given":"Alfonsas","family":"Misevi\u010dius","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5718-3766","authenticated-orcid":false,"given":"Armantas","family":"Ostreika","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.cor.2026.107537_b1","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":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107537_b2","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.dam.2008.06.002","article-title":"A new lower bound for the single row facility layout problem","volume":"157","author":"Amaral","year":"2009","journal-title":"Discrete Appl. Math."},{"issue":"12","key":"10.1016\/j.cor.2026.107537_b3","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":"12","key":"10.1016\/j.cor.2026.107537_b4","doi-asserted-by":"crossref","first-page":"2930","DOI":"10.1016\/j.cor.2013.07.003","article-title":"A parallel ordering problem in facilities layout","volume":"40","author":"Amaral","year":"2013","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107537_b5","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":"Optim. Lett."},{"key":"10.1016\/j.cor.2026.107537_b6","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1007\/s10479-020-03617-5","article-title":"A heuristic approach for the double row layout problem","volume":"316","author":"Amaral","year":"2022","journal-title":"Ann. Oper. Res."},{"issue":"6","key":"10.1016\/j.cor.2026.107537_b7","doi-asserted-by":"crossref","first-page":"1428","DOI":"10.1080\/10556788.2024.2349093","article-title":"A mixed-integer programming formulation for optimizing the double row layout problem","volume":"39","author":"Amaral","year":"2024","journal-title":"Optim. Methods Softw."},{"key":"10.1016\/j.cor.2026.107537_b8","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s10107-012-0533-z","article-title":"A polyhedral approach to the single row facility layout problem","volume":"141","author":"Amaral","year":"2013","journal-title":"Math. Program."},{"issue":"2","key":"10.1016\/j.cor.2026.107537_b9","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.disopt.2005.03.001","article-title":"A semidefinite optimization approach for the single-row layout problem with unequal dimensions","volume":"2","author":"Anjos","year":"2005","journal-title":"Discrete Optim."},{"issue":"1","key":"10.1016\/j.cor.2026.107537_b10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2017.01.049","article-title":"Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions","volume":"261","author":"Anjos","year":"2017","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107537_b11","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/s11590-020-01621-z","article-title":"Mathematical optimization approach for facility layout on several rows","volume":"15","author":"Anjos","year":"2021","journal-title":"Optim. Lett."},{"key":"10.1016\/j.cor.2026.107537_b12","series-title":"Facility Layout","author":"Anjos","year":"2021"},{"issue":"4\u20135","key":"10.1016\/j.cor.2026.107537_b13","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1080\/10556780902917735","article-title":"Provably near-optimal solutions for very large single-row facility layout problems","volume":"24","author":"Anjos","year":"2009","journal-title":"Optim. Methods Softw."},{"key":"10.1016\/j.cor.2026.107537_b14","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."},{"key":"10.1016\/j.cor.2026.107537_b15","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2025.111551","article-title":"An oscillation based simulated annealing algorithm for the single row facility layout problem","volume":"159","author":"Chen","year":"2025","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"3","key":"10.1016\/j.cor.2026.107537_b16","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."},{"key":"10.1016\/j.cor.2026.107537_b17","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.cor.2019.02.009","article-title":"A GRASP algorithm for solving large-scale single row facility layout problems","volume":"106","author":"Cravo","year":"2019","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107537_b18","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.118033","article-title":"Adaptive iterated local search for the parallel row ordering problem","volume":"208","author":"Cravo","year":"2022","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"10.1016\/j.cor.2026.107537_b19","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1016\/j.ejor.2011.03.034","article-title":"Single row facility layout problem using a permutation-based genetic algorithm","volume":"213","author":"Datta","year":"2011","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107537_b20","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.118804","article-title":"An efficient iterated local search algorithm for the corridor allocation problem","volume":"212","author":"Durmaz","year":"2023","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"10.1016\/j.cor.2026.107537_b21","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1007\/s12532-019-00162-6","article-title":"New exact approaches to row layout problems","volume":"11","author":"Fischer","year":"2019","journal-title":"Math. Program. Comput."},{"key":"10.1016\/j.cor.2026.107537_b22","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."},{"issue":"3","key":"10.1016\/j.cor.2026.107537_b23","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1016\/j.ejor.2015.08.014","article-title":"Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem","volume":"248","author":"Guan","year":"2016","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107537_b24","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.cor.2026.107537_b25","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.cor.2026.107537_b26","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.cor.2026.107537_b27","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.cor.2019.03.009","article-title":"Double-row facility layout with replicate machines and split flows","volume":"108","author":"G\u00fcl\u015fen","year":"2019","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107537_b28","doi-asserted-by":"crossref","DOI":"10.1049\/cit2.12398","article-title":"MOEA\/D-based multi-row facility layout optimisation method with discontinuity perceiving of the Pareto front","author":"Guo","year":"2024","journal-title":"CAAI Trans. Intell. Technol."},{"issue":"1","key":"10.1016\/j.cor.2026.107537_b29","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s11227-025-08150-5","article-title":"Learning-based hyper-heuristic algorithm for space-free multi-row facility layout problem","volume":"82","author":"He","year":"2026","journal-title":"J. Supercomput."},{"issue":"21","key":"10.1016\/j.cor.2026.107537_b30","doi-asserted-by":"crossref","first-page":"16575","DOI":"10.1007\/s00521-025-11370-8","article-title":"A genetic-based hyper-heuristic optimisation method to solve the constrained multi-row facility layout problem","volume":"37","author":"He","year":"2025","journal-title":"Neural Comput. Appl."},{"issue":"3","key":"10.1016\/j.cor.2026.107537_b31","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1016\/j.ejor.2021.03.027","article-title":"An efficient variable neighborhood search for the space-free multi-row facility layout problem","volume":"295","author":"Herr\u00e1n","year":"2021","journal-title":"European J. Oper. Res."},{"issue":"1\u20134","key":"10.1016\/j.cor.2026.107537_b32","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."},{"issue":"8","key":"10.1016\/j.cor.2026.107537_b33","doi-asserted-by":"crossref","first-page":"3201","DOI":"10.1007\/s12652-018-1037-3","article-title":"A particle swarm optimization algorithm for multi-row facility layout problem in semiconductor fabrication","volume":"10","author":"Hu","year":"2019","journal-title":"J. Ambient Intell. Humaniz. Comput."},{"issue":"1","key":"10.1016\/j.cor.2026.107537_b34","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.ejor.2015.02.049","article-title":"A semidefinite optimization-based approach for global optimization of multi-row facility layout","volume":"245","author":"Hungerl\u00e4nder","year":"2015","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107537_b35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10589-012-9505-8","article-title":"A computational study and survey of methods for the single-row facility layout problem","volume":"55","author":"Hungerl\u00e4nder","year":"2013","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.cor.2026.107537_b36","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2025.104453","article-title":"Multi-objective double-floor corridor allocation problem with floor loads and separated passages","volume":"204","author":"Ji","year":"2025","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"10.1016\/j.cor.2026.107537_b37","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1016\/j.jmsy.2023.06.013","article-title":"Mathematical formulation and a novel two-stage algorithm for double-row layout problem with fixed loading and unloading points","volume":"69","author":"Ji","year":"2023","journal-title":"J. Manuf. Syst."},{"key":"10.1016\/j.cor.2026.107537_b38","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2024.110738","article-title":"Exact formulation and two-stage optimisation method for corridor allocation problem consider separated man-vehicle logistics passage in manufacturing workshops","volume":"198","author":"Ji","year":"2024","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107537_b39","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2025.111010","article-title":"A multi-objective adaptive memetic algorithm and engineering application for a double-floor layout problem with separate human and vehicle transport elevators","volume":"155","author":"Ji","year":"2025","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.cor.2026.107537_b40","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."},{"key":"10.1016\/j.cor.2026.107537_b41","series-title":"Nature-Inspired Methods for Metaheuristics Optimization. Modeling and Optimization in Science and Technologies","first-page":"335","article-title":"Corridor allocation as a constrained optimization problem using a permutation-based multi-objective genetic algorithm","volume":"Vol. 16","author":"Kalita","year":"2020"},{"issue":"3","key":"10.1016\/j.cor.2026.107537_b42","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1007\/s00500-017-2807-0","article-title":"Bi-objective corridor allocation problem using a permutation-based genetic algorithm hybridized with a local search technique","volume":"23","author":"Kalita","year":"2019","journal-title":"Soft Comput."},{"issue":"2","key":"10.1016\/j.cor.2026.107537_b43","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/s11590-012-0605-2","article-title":"An efficient genetic algorithm for single row facility layout","volume":"8","author":"Kothari","year":"2014","journal-title":"Optim. Lett."},{"issue":"2","key":"10.1016\/j.cor.2026.107537_b44","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10732-013-9234-x","article-title":"A scatter search algorithm for the single row facility layout problem","volume":"20","author":"Kothari","year":"2014","journal-title":"J. Heuristics"},{"issue":"4","key":"10.1016\/j.cor.2026.107537_b45","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."},{"key":"10.1016\/j.cor.2026.107537_b46","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108118","article-title":"A novel hybrid clonal selection algorithm for the corridor allocation problem with irregular material handling positions","volume":"168","author":"Liu","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107537_b47","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.jmsy.2021.08.013","article-title":"Mathematical formulation and a new metaheuristic for the constrained double-floor corridor allocation problem","volume":"61","author":"Liu","year":"2021","journal-title":"J. Manuf. Syst."},{"issue":"9","key":"10.1016\/j.cor.2026.107537_b48","doi-asserted-by":"crossref","first-page":"6907","DOI":"10.1007\/s00521-021-06817-7","article-title":"Mathematical formulation and two-phase optimisation methodology for the constrained double-row layout problem","volume":"34","author":"Liu","year":"2022","journal-title":"Neural Comput. Appl."},{"issue":"8","key":"10.1016\/j.cor.2026.107537_b49","doi-asserted-by":"crossref","first-page":"2309","DOI":"10.1080\/00207543.2020.1730465","article-title":"An improved fireworks algorithm for the constrained single-row facility layout problem","volume":"59","author":"Liu","year":"2021","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107537_b50","doi-asserted-by":"crossref","DOI":"10.1016\/j.aei.2023.101977","article-title":"Parallel hyper heuristic algorithm based on reinforcement learning for the corridor allocation problem and parallel row ordering problem","volume":"56","author":"Liu","year":"2023","journal-title":"Adv. Eng. Inform."},{"key":"10.1016\/j.cor.2026.107537_b51","doi-asserted-by":"crossref","DOI":"10.1016\/j.rcim.2022.102364","article-title":"Mixed-integer programming model and hybrid immune clone select algorithm for multi-objective double floor corridor allocation problem with vertical conveyor","volume":"77","author":"Liu","year":"2022","journal-title":"Robot. Comput.-Integr. Manuf."},{"key":"10.1016\/j.cor.2026.107537_b52","doi-asserted-by":"crossref","DOI":"10.1016\/j.aei.2025.103636","article-title":"Mathematical formulation and hybrid algorithm for a three-dimensional parallel row ordering problem considering adaptive material handling points and obstacles","volume":"68","author":"Ma","year":"2025","journal-title":"Adv. Eng. Inform."},{"issue":"2","key":"10.1016\/j.cor.2026.107537_b53","first-page":"467","article-title":"Two strategies based on meta-heuristic algorithms for parallel row ordering problem (PROP)","volume":"10","author":"Maadi","year":"2017","journal-title":"Iran. J. Manag. Stud."},{"issue":"6","key":"10.1016\/j.cor.2026.107537_b54","doi-asserted-by":"crossref","first-page":"1882","DOI":"10.1080\/00207543.2022.2051090","article-title":"Solving the constrained single-row facility layout problem with integer linear programming","volume":"61","author":"Maier","year":"2023","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107537_b55","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":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107537_b56","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cie.2016.09.026","article-title":"Single row facility layout using multi-start simulated annealing","volume":"103","author":"Palubeckis","year":"2017","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107537_b57","article-title":"A fast local search based memetic algorithm for the parallel row ordering problem","volume":"486","author":"Palubeckis","year":"2025","journal-title":"Appl. Math. Comput."},{"issue":"2174","key":"10.1016\/j.cor.2026.107537_b58","article-title":"A variable neighborhood search approach for the dynamic single row facility layout problem","volume":"10","author":"Palubeckis","year":"2022","journal-title":"Mathematics"},{"key":"10.1016\/j.cor.2026.107537_b59","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2026.107397","article-title":"A matheuristic for solving the single row facility layout problem","volume":"189","author":"Pammer","year":"2026","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"10.1016\/j.cor.2026.107537_b60","doi-asserted-by":"crossref","first-page":"3777","DOI":"10.1080\/00207543.2021.1897176","article-title":"Facility layout planning. An extended literature review","volume":"59","author":"P\u00e9rez-Gosende","year":"2021","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107537_b61","first-page":"181","article-title":"The double row layout problem with safety consideration: a two-stage variable neighborhood search approach","volume":"39","author":"Rifai","year":"2022","journal-title":"J. Ind. Prod. Eng."},{"key":"10.1016\/j.cor.2026.107537_b62","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.knosys.2016.05.030","article-title":"GRASP with path relinking for the single row facility layout problem","volume":"106","author":"Rubio-S\u00e1nchez","year":"2016","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.cor.2026.107537_b63","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1016\/j.asoc.2017.09.003","article-title":"Solving an extended multi-row facility layout problem with fuzzy clearances using GA","volume":"61","author":"Safarzadeh","year":"2017","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cor.2026.107537_b64","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":"2","key":"10.1016\/j.cor.2026.107537_b65","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1109\/TEVC.2022.3165987","article-title":"Solving the single-row facility layout problem by K-medoids memetic permutation group","volume":"27","author":"Tang","year":"2023","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"12","key":"10.1016\/j.cor.2026.107537_b66","doi-asserted-by":"crossref","first-page":"1316","DOI":"10.1080\/0951192X.2017.1314013","article-title":"Single and multi-row layout design for flexible manufacturing systems","volume":"30","author":"Tubaileh","year":"2017","journal-title":"Int. J. Comput. Integr. Manuf."},{"key":"10.1016\/j.cor.2026.107537_b67","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2024.112666","article-title":"Path relinking strategies for the bi-objective double floor corridor allocation problem","volume":"305","author":"Uribe","year":"2024","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.cor.2026.107537_b68","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2024.111897","article-title":"A GRASP method for the bi-objective multiple row equal facility layout problem","volume":"163","author":"Uribe","year":"2024","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cor.2026.107537_b69","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.115184","article-title":"An improved GRASP method for the multiple row equal facility layout problem","volume":"182","author":"Uribe","year":"2021","journal-title":"Expert Syst. Appl."},{"issue":"3","key":"10.1016\/j.cor.2026.107537_b70","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1080\/00207543.2020.1847342","article-title":"A hybrid multiobjective GRASP for a multi-row facility layout problem with extra clearances","volume":"60","author":"Wan","year":"2022","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107537_b71","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2023.110716","article-title":"A thin-provisioned and functionalized memetic algorithm for the single row facility layout problem","volume":"146","author":"Wang","year":"2023","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cor.2026.107537_b72","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.asoc.2015.08.023","article-title":"Solving dynamic double row layout problem via combining simulated annealing and mathematical programming","volume":"37","author":"Wang","year":"2015","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"10.1016\/j.cor.2026.107537_b73","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1016\/j.ejor.2024.03.012","article-title":"Iterated local search with ejection chains for the space-free multi-row facility layout problem","volume":"316","author":"Wu","year":"2024","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107537_b74","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1080\/01605682.2018.1556570","article-title":"An improved model for the parallel row ordering problem","volume":"71","author":"Yang","year":"2020","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/j.cor.2026.107537_b75","doi-asserted-by":"crossref","DOI":"10.1016\/j.aei.2022.101700","article-title":"A fast two-stage hybrid meta-heuristic algorithm for robust corridor allocation problem","volume":"53","author":"Zhang","year":"2022","journal-title":"Adv. Eng. Inform."},{"key":"10.1016\/j.cor.2026.107537_b76","article-title":"Analysis of models and methods and perspectives for corridor allocation problem: a literature review","volume":"48","author":"Zhang","year":"2025","journal-title":"J. Ind. Inf. Integr."},{"issue":"1","key":"10.1016\/j.cor.2026.107537_b77","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."},{"key":"10.1016\/j.cor.2026.107537_b78","doi-asserted-by":"crossref","first-page":"4972","DOI":"10.1109\/TASE.2024.3414133","article-title":"Optimizing multi-row layouts with the through-aisle structure: a hybrid approach of teaching-learning-based optimization and linear programming","volume":"22","author":"Zhang","year":"2025","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"7","key":"10.1016\/j.cor.2026.107537_b79","doi-asserted-by":"crossref","first-page":"3549","DOI":"10.1109\/TCYB.2019.2937115","article-title":"MOEA\/D with linear programming for double row layout problem with center-islands","volume":"51","author":"Zuo","year":"2021","journal-title":"IEEE Trans. Cybern."},{"issue":"4","key":"10.1016\/j.cor.2026.107537_b80","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":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001553?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001553?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T20:41:26Z","timestamp":1781296886000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826001553"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":80,"alternative-id":["S0305054826001553"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107537","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An efficient memetic algorithm for the corridor allocation problem","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107537","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107537"}}