{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T06:54:40Z","timestamp":1781592880227,"version":"3.54.5"},"reference-count":64,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003787","name":"Natural Science Foundation of Hebei Province","doi-asserted-by":"publisher","award":["E2024105031"],"award-info":[{"award-number":["E2024105031"]}],"id":[{"id":"10.13039\/501100003787","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72401239"],"award-info":[{"award-number":["72401239"]}],"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":["52375268"],"award-info":[{"award-number":["52375268"]}],"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":["52342505"],"award-info":[{"award-number":["52342505"]}],"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","id":[{"id":"10.13039\/501100013139","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012542","name":"Sichuan Provincial Science and Technology Support Program","doi-asserted-by":"publisher","award":["2025ZNSFSC0425"],"award-info":[{"award-number":["2025ZNSFSC0425"]}],"id":[{"id":"10.13039\/100012542","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012542","name":"Sichuan Provincial Science and Technology Support Program","doi-asserted-by":"publisher","award":["2024NSFSC1048"],"award-info":[{"award-number":["2024NSFSC1048"]}],"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","award":["23YJA630139"],"award-info":[{"award-number":["23YJA630139"]}],"id":[{"id":"10.13039\/501100002338","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.cor.2026.107410","type":"journal-article","created":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T23:19:30Z","timestamp":1769296770000},"page":"107410","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Mathematical modelling and an effective algorithm for unidirectional loop layout problem with fixed loading and unloading points"],"prefix":"10.1016","volume":"190","author":[{"given":"Zongxing","family":"He","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zeqiang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuai","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8477-8327","authenticated-orcid":false,"given":"Silu","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2026.107410_b0005","doi-asserted-by":"crossref","first-page":"5605","DOI":"10.1016\/j.apm.2016.01.014","article-title":"An efficient multiple-stage mathematical programming method for advanced single and multi-floor facility layout problems","volume":"40","author":"Ahmadi","year":"2016","journal-title":"App. Math. Model."},{"key":"10.1016\/j.cor.2026.107410_b0010","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."},{"key":"10.1016\/j.cor.2026.107410_b0015","doi-asserted-by":"crossref","first-page":"4451","DOI":"10.1007\/s12190-023-01935-y","article-title":"Hybridizing simulated annealing and genetic algorithms with Pythagorean fuzzy uncertainty for traveling salesman problem optimization","volume":"69","author":"Akram","year":"2023","journal-title":"J. Appl. Math. Comput."},{"issue":"6","key":"10.1016\/j.cor.2026.107410_b0020","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.107410_b0025","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":"Discret. Appl. Math."},{"key":"10.1016\/j.cor.2026.107410_b0030","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":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107410_b0035","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.asoc.2018.11.019","article-title":"Using list-based simulated annealing and genetic algorithm for order batching and picker routing in put wall based picking systems","volume":"75","author":"Ardjmand","year":"2019","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cor.2026.107410_b0040","doi-asserted-by":"crossref","first-page":"1546","DOI":"10.1016\/j.cor.2006.08.018","article-title":"The significance of deterministic empty vehicle trips in the design of a unidirectional loop flow path","volume":"35","author":"Asef-Vaziri","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107410_b0045","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1016\/j.ejor.2017.07.019","article-title":"Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout","volume":"264","author":"Asef-Vaziri","year":"2018","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107410_b0050","unstructured":"Balaji, S.S., Ragunathan, S., Visagavel, K., Ganesh Kumar, S., 2022. Design and optimization of layout problem using meta-heuristic algorithms. Sci. Iran. 29, 2290\u20132303. 10.24200\/sci.2022.58011.5519."},{"key":"10.1016\/j.cor.2026.107410_b0055","doi-asserted-by":"crossref","first-page":"2561","DOI":"10.1080\/00207540500446287","article-title":"A simulated annealing algorithm based on a closed loop layout for facility layout design in flexible manufacturing systems","volume":"44","author":"Chae","year":"2006","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107410_b0060","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. Intel."},{"key":"10.1016\/j.cor.2026.107410_b0065","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/j.jmsy.2023.08.008","article-title":"Mathematical model and adaptive simulated annealing algorithm for mixed-model assembly job-shop scheduling with lot streaming","volume":"70","author":"Cheng","year":"2023","journal-title":"J. Manuf. Syst."},{"issue":"2","key":"10.1016\/j.cor.2026.107410_b0070","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1016\/j.ejor.2022.04.031","article-title":"Exact approaches for the combined cell layout problem","volume":"305","author":"Dahlbeck","year":"2023","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107410_b0075","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1080\/00207549308956725","article-title":"A facility layout method for flexible manufacturing systems\u2217","volume":"31","author":"Das","year":"1993","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107410_b0080","unstructured":"Dong, S., Xu, Z., Chang, Y., Qin, K., Zhu, J., Su, K., 2021. Multi-row facility layout considering material loading\/unloading points and handling passages. Comput. Integr. Manuf. Syst. 27, 1269\u20131280. 10.13196\/j.cims.2021.05.003."},{"key":"10.1016\/j.cor.2026.107410_b0085","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."},{"key":"10.1016\/j.cor.2026.107410_b0090","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.107410_b0095","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1016\/S0377-2217(99)00341-0","article-title":"Positioning automated guided vehicles in a loop layout","volume":"127","author":"Gademann","year":"2000","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107410_b0100","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2023.105941","article-title":"Hidden-variables genetic algorithm for variable-size design space optimal layout problems with application to aerospace vehicles","volume":"121","author":"Gamot","year":"2023","journal-title":"Eng. Appl. Artif. Intel."},{"key":"10.1016\/j.cor.2026.107410_b0105","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.ejor.2015.04.029","article-title":"A biased random-key genetic algorithm for the unequal area facility layout problem","volume":"246","author":"Gon\u00e7alves","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107410_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."},{"key":"10.1016\/j.cor.2026.107410_b0115","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.107410_b0120","doi-asserted-by":"crossref","first-page":"4948","DOI":"10.1016\/j.apm.2015.12.013","article-title":"Multi-objective multi-layer congested facility location-allocation problem optimization with Pareto-based meta-heuristics","volume":"40","author":"Hajipour","year":"2016","journal-title":"App. Math. Model."},{"key":"10.1016\/j.cor.2026.107410_b0125","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":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107410_b0130","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1016\/0952-1976(96)00049-8","article-title":"Adaptive simulated annealing genetic algorithm for system identification","volume":"9","author":"Jeong","year":"1996","journal-title":"Eng. Appl. Artif. Intel."},{"key":"10.1016\/j.cor.2026.107410_b0135","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.107410_b0140","unstructured":"Ji, D., Zhang, Z., Liu, J., Fang, X., 2023b. Modeling and optimization of multi-row problem with safety clearance and material handling points. Comput. Integr. Manuf. Syst. 29, 3074\u20133085. 10.13196\/j.cims.2023.09.019."},{"key":"10.1016\/j.cor.2026.107410_b0145","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.107410_b0150","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/j.apm.2015.05.008","article-title":"A simulated annealing algorithm for first train transfer problem in urban railway networks","volume":"40","author":"Kang","year":"2016","journal-title":"App. Math. Model."},{"key":"10.1016\/j.cor.2026.107410_b0155","doi-asserted-by":"crossref","first-page":"4635","DOI":"10.1080\/00207540050205550","article-title":"Layout planning for facilities with fixed shapes and input and output points","volume":"38","author":"Kim","year":"2000","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107410_b0160","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1287\/opre.40.3.533","article-title":"Unidirectional loop network layout problem in automated manufacturing systems","volume":"40","author":"Kouvelis","year":"1992","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2026.107410_b0165","doi-asserted-by":"crossref","first-page":"7637","DOI":"10.1038\/s41598-024-58024-8","article-title":"Hybrid genetic algorithm-simulated annealing based electric vehicle charging station placement for optimizing distribution network resilience","volume":"14","author":"Kumar","year":"2024","journal-title":"Sci. Rep."},{"key":"10.1016\/j.cor.2026.107410_b0170","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1016\/j.cor.2003.09.004","article-title":"An improved genetic algorithm for multi-floor facility layout problems having inner structure walls and passages","volume":"32","author":"Lee","year":"2005","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107410_b0175","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.1007\/s11269-007-9209-5","article-title":"An improved genetic algorithm-simulated annealing hybrid algorithm for the optimization of multiple reservoirs","volume":"22","author":"Li","year":"2008","journal-title":"Water Resour. Manag."},{"key":"10.1016\/j.cor.2026.107410_b0180","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2025.107257","article-title":"Solving Type-I unpaced synchronous mixed-model two-sided assembly line balancing problem using a genetic algorithm","volume":"184","author":"Liao","year":"2025","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107410_b0185","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1016\/j.apm.2020.12.031","article-title":"Integrating traffic routing optimization and train formation plan using simulated annealing algorithm","volume":"93","author":"Lin","year":"2021","journal-title":"App. Math. Model."},{"key":"10.1016\/j.cor.2026.107410_b0190","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/j.optcom.2018.12.084","article-title":"Coverage uniformity with improved genetic simulated annealing algorithm for indoor Visible Light Communications","volume":"439","author":"Liu","year":"2019","journal-title":"Opt. Commun."},{"key":"10.1016\/j.cor.2026.107410_b0195","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. Inf."},{"key":"10.1016\/j.cor.2026.107410_b0200","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. Inf."},{"key":"10.1016\/j.cor.2026.107410_b0205","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."},{"key":"10.1016\/j.cor.2026.107410_b0210","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1023\/B:JIMS.0000010079.68350.ae","article-title":"Unidirectional loop network layout by a LP heuristic and design of telecommunications networks","volume":"15","author":"Malakooti","year":"2004","journal-title":"J. Intell. Manuf."},{"key":"10.1016\/j.cor.2026.107410_b0215","doi-asserted-by":"crossref","first-page":"1841","DOI":"10.1007\/s00170-015-7715-9","article-title":"A new meta-heuristics for optimum design of loop layout in flexible manufacturing system with integrated scheduling","volume":"84","author":"Mallikarjuna","year":"2016","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.cor.2026.107410_b0220","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1080\/00207543.2015.1064178","article-title":"A new approach for loop machine layout problem integrating proximity constraints","volume":"54","author":"Manita","year":"2016","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107410_b0225","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.106030","article-title":"A Benders decomposition algorithm for the maximum availability service facility location problem","volume":"149","author":"Muffak","year":"2023","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107410_b0230","first-page":"190","article-title":"A mixed integer linear programming formulation of closed loop layout with exact distances","volume":"30","author":"Niroomand","year":"2013","journal-title":"J. Ind. Prod. Eng."},{"key":"10.1016\/j.cor.2026.107410_b0235","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1016\/j.ejor.2006.09.094","article-title":"Exact solution procedures for the balanced unidirectional cyclic layout problem","volume":"189","author":"\u00d6ncan","year":"2008","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107410_b0240","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1007\/s11590-016-1056-y","article-title":"An alternative MILP model for makespan minimization on assembly lines","volume":"11","author":"Ozcan","year":"2017","journal-title":"Optim. Lett."},{"key":"10.1016\/j.cor.2026.107410_b0245","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1080\/00207540903496673","article-title":"Generalisation of unidirectional loop layout problem and solution by a genetic algorithm","volume":"49","author":"Ozcelik","year":"2011","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107410_b0250","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."},{"key":"10.1016\/j.cor.2026.107410_b0255","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.107410_b0260","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1016\/j.cie.2011.12.033","article-title":"A genetic algorithm with the heuristic procedure to solve the multi-line layout problem","volume":"62","author":"Sadrzadeh","year":"2012","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107410_b0265","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1109\/21.286385","article-title":"Adaptive probabilities of crossover and mutation in genetic algorithms","volume":"24","author":"Srinivas","year":"1994","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"10.1016\/j.cor.2026.107410_b0270","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.119199","article-title":"Unequal-area capability-based facility layout design problem with a heuristic decomposition-based iterative mathematical programming approach","volume":"214","author":"Subulan","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107410_b0275","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2022.110002","article-title":"An adaptive memetic algorithm for the bidirectional loop layout problem","volume":"258","author":"Sun","year":"2022","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.cor.2026.107410_b0280","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/S0377-2217(97)00062-3","article-title":"Move based heuristics for the unidirectional loop network layout problem","volume":"108","author":"Tansel","year":"1998","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107410_b0285","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."},{"key":"10.1016\/j.cor.2026.107410_b0290","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.107410_b0295","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2022.108725","article-title":"A differential evolution algorithm combined with linear programming for solving a closed loop facility layout problem","volume":"121","author":"Wan","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cor.2026.107410_b0300","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.compind.2004.06.003","article-title":"A solution to the unequal area facilities layout problem by genetic algorithm","volume":"56","author":"Wang","year":"2005","journal-title":"Comput. Ind."},{"key":"10.1016\/j.cor.2026.107410_b0305","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":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107410_b0310","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.cor.2017.06.025","article-title":"A problem evolution algorithm with linear programming for the dynamic facility layout problem\u2014a general layout formulation","volume":"88","author":"Xiao","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107410_b0315","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."},{"key":"10.1016\/j.cor.2026.107410_b0320","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1109\/TSM.2016.2603443","article-title":"The double-bay layout problem","volume":"29","author":"Zuo","year":"2016","journal-title":"IEEE Trans. Semicond. Manuf."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826000286?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826000286?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T07:48:47Z","timestamp":1778744927000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826000286"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":64,"alternative-id":["S0305054826000286"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107410","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Mathematical modelling and an effective algorithm for unidirectional loop layout problem with fixed loading and unloading points","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107410","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":"107410"}}