...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Production Research >A flower pollination algorithm for the double-floor corridor allocation problem
【24h】

A flower pollination algorithm for the double-floor corridor allocation problem

机译：一种用于双层走廊分配问题的花授粉算法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

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.
机译：本研究探讨了双层走廊分配问题（DFCAP），该问题涉及两层楼的各部门的最佳排列，然后将它们沿两侧放在走廊上。这个问题是走廊分配问题（帽）到额外地板的自然延伸;每个楼层的布局可以被视为近似独立的帽。 DFCAP通常在制造和服务建筑物中观察到。在本研究中，开发了DFCAP的混合整数编程配方，并且能够减少到经典帽模型。然后提供了一种新颖的花授粉算法，它是使用SWAP对集合方法离散的，以解决所考虑的DFCAP。此外，为了改善算法，开发了三种建设性启发式规则，以产生合理的初始群体;同时，提出了一种可变的邻域搜索结构，以防止到达达到糟糕的本地解决方案。最后，在算法中采用尺寸为9 <= n <= 80的DFCAP的若干实例，以及用Gurobi 7.0.1解决的混合整数非线性编程（MINLP）制剂。此外，利用上述实例来表明，与最先进的优化算法相比，所提出的算法更好地执行。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号