A discrete differential evolution algorithm for the constrained single-row facility layout problem with asymmetric clearances
Computers and Operations Research, cilt.194, 2026 (SCI-Expanded, Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 194
- Basım Tarihi: 2026
- Doi Numarası: 10.1016/j.cor.2026.107540
- Dergi Adı: Computers and Operations Research
- Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, ABI/INFORM, Aerospace Database, Applied Science & Technology Source, Compendex, INSPEC, MathSciNet, zbMATH, Business Source Ultimate (EBSCO), Engineering Source (EBSCO), Technology Collection (ProQuest)
- Anahtar Kelimeler: Asymmetric clearances, Constrained single-row facility layout problem, Differential evolution algorithm, Mathematical modelling, Repair mechanism
- Eskişehir Osmangazi Üniversitesi Adresli: Evet
Özet
Facility layout problems (FLPs) require adequate clearances between facilities to ensure operational safety and efficiency. Most studies simplify this issue by assuming fixed or symmetric distances, whereas in real applications clearances are often asymmetric and sequence-dependent. Constrained single-row facility layout problems (cSRFLPs), in turn, incorporate positioning, ordering, and relation constraints. Although both aspects have been investigated separately, no prior study has jointly considered asymmetric clearances within constrained layouts. This paper introduces the cSRFLP with asymmetric clearances and develops a mixed-integer linear programming (MILP) model to minimise total material-handling cost while explicitly capturing clearance asymmetry and logical constraint structures. For large-scale instances that become computationally intractable for exact optimisation, a discrete differential evolution algorithm (DDEA) with an embedded repair framework is proposed. The algorithm is systematically calibrated using a structured experimental design to determine robust parameter settings across different problem sizes. Computational experiments on newly generated asymmetric-clearance benchmark instances demonstrate the competitiveness and scalability of the proposed approach. Furthermore, when applied to 73 classical cSRFLP benchmark instances, the calibrated DDEA outperformed exact approaches in 17 cases and surpassed the best-known metaheuristic results in 19 others, while matching the remaining solutions. These findings confirm the robustness, scalability, and generalisability of the proposed method.