【摘要】 闭环布局问题本质上是一个混合优化问题。根据问题的特点,本文设计了一种基于混合编码的阈值接收(Mixed-coding Threshold Accepting, MTA)算法来求解该问题。MTA算法将矩形环的宽度和高度作为解编码的一部分,使算法能够同时搜索设施的最优放置顺序和矩形环的大小。为了评估MTA算法的性能,利用文献中普遍使用的13个测试实例进行了实验。结果表明,MTA算法在9个测试实例上找到了新的最优布局方案,性能明显优于现有的元启发式算法。更多还原

【Abstract】 The closed-loop layout problem is essentially a hybrid optimization problem. Based on the features of the problem, this paper proposes a Mixed-coding Threshold Accepting(MTA) algorithm to solve this problem.The MTA algorithm takes the width and height of the rectangle loop as part of the solution’s encoding, which enables the algorithm to search the optimal placement sequence of the facilities and the optimal size of the rectangle loop at the same time.In order to evaluate the performance of the MTA algorithm, experiments were carried out using the thirteen test instances previously used by other literatures.The results show that the MTA algorithm found new optimal solutions on nine test instances, and it is much better than existing meta heuristic algorithms.更多还原