.png){kind=icon}
返回
A flower pollination algorithm for the double-floor corridor allocation problem†
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2019.1566673.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This research explores the double-floor corridor allocation problem (DFCAP), which deals with the optimal arrangement of departments over two floors and then place them along both sides against a corridor. This problem is a natural extension of the corridor allocation problem (CAP) to additional floors; the layout of each floor can be regarded as an approximately independent CAP. The DFCAP is commonly observed in manufacturing and service buildings. In this study, a mixed-integer programming formulation for the DFCAP is developed, and it is able to reduce to the classical CAP model. Then a novel flower pollination algorithm is provided, which is discretised using swap pair set approach to solve the considered DFCAP. In addition, to ameliorate the algorithm, three constructive heuristic rules are developed to produce a reasonably good initial population; meanwhile, a variable neighbourhood search structure is presented to prevent prematurity in arrival at a poor local solution. Finally, several instances for the DFCAP with a size of 9 <= n <= 80 are employed in the algorithms, as well as in mixed-integer non-linear programming (MINLP) formulations, which are solved with GUROBI 7.0.1. Moreover, the above-mentioned instances are utilized to show that the proposed algorithm performs better in comparison to the state-of-the-art optimization algorithms.
Keyword:
Facility design
double-floor corridor allocation problem
flower pollination algorithm
combinatorial optimisation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
分享收藏An efficient local search heuristic for the double row layout problem with asymmetric material flow具有非对称物料流的双行布局问题的有效局部搜索启发式
PREAI
分享收藏分享收藏
查看更多内容