返回
Mixed integer linear programming model and an effective algorithm for the bi-objective double-floor corridor allocation problem
DOI:10.1016/j.cor.2021.105283.png)
摘要
En 中文
The bi-objective double-floor corridor allocation problem (bDFCAP) investigated here explores the effective placement of given departments in a double-floor space to minimise the overall flow cost and the corridor length objectives. Within each floor, departments are arranged in two parallel rows on opposite sides along a central corridor without overlapping. In this study, the bDFCAP is formulated as a mixed integer linear programming model, which has improved the performance over the previous one. Thereafter, a genetic algorithm with a variable neighbourhood search technique is designed and employed to solve the bDFCAP in a more effective manner. This technique is utilized to improve the local search capability by adaptively transforming between a deep-searching strategy and broad-searching strategy, and the superior performance of the proposed method is proven through comparisons with two other algorithms in current literature. Besides, the state-of-the-art lower bounds of several benchmark instances are updated.
Keyword:
Facility layout design
Multi-objective optimisation
Genetic algorithm
Mixed integer linear programming
Variable neighbourhood search
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods使用穷举2-opt和插入邻域的单行设施布局问题的禁忌搜索
High-fat meal effect on LDL, HDL, and VLDL particle size and number in the Genetics of Lipid-Lowering drugs and diet network (GOLDN): An interventional study高脂餐对LDL、HDL和VLDL颗粒大小和数量的影响:遗传性降脂药物与饮食网络(GOLDN)的干预研究

