This paper presents an iterated local search algorithm based on ejection chains to solve the space-free multi-row facility layout problem. The aim of this problem is to find a non-overlapping layout of facilities on a given number of rows such that there is no space between two adjacent facilities. In addition, the left-most facility of the arrangement must have zero abscissa. Our algorithm looks for a local optimal solution by continuously alternating ejection moves and trial moves to form an ejection chain. Since the ejection chain can compound simple moves to create more complex and powerful moves, it has a greater chance to discover better solutions. Additionally, we propose a directional perturbation strategy to produce a solution of both high quality and good diversity. The idea is to calculate the score of each facility based on the location concentration of facilities in the elite solution set and the historical perturbation times of facilities in the search process, and to select the facility with the highest score for perturbation. Experimental results on four benchmark sets containing a total of 290 instances reveal that the proposed algorithm performs better for 131 (45.2%) instances in terms of best solution values and for 196 (80.0%) instances in terms of average solution values than a recently reported state-of-the-art algorithm.

中文翻译：

---

针对无空间多行设施布局问题的弹射链迭代局部搜索

本文提出一种基于弹射链的迭代局部搜索算法来解决无空间多排设施布局问题。该问题的目的是在给定的行数上找到不重叠的设施布局，使得两个相邻设施之间没有空间。此外，排列中最左边的设施的横坐标必须为零。我们的算法通过不断交替弹射动作和尝试动作来形成弹射链来寻找局部最优解。由于弹射链可以将简单的动作组合成更复杂、更强大的动作，因此它有更大的机会发现更好的解决方案。此外，我们提出了一种定向扰动策略来产生高质量和良好多样性的解决方案。其思路是根据精英解集中设施点的位置集中度和搜索过程中设施点的历史扰动次数，计算每个设施点的得分，选择扰动得分最高的设施点。包含总共 290 个实例的四个基准集的实验结果表明，与最近报告的算法相比，该算法在 131 个实例（45.2%）的最佳解值和 196 个实例（80.0%）的平均解值方面表现更好。最先进的算法。