A hybrid genetic algorithm for the single row layout problem
A hybrid genetic algorithm for the single row layout problem
复制标题
DOI：
10.1080/00207543.2011.636386
复制
发表时间：
2012-10
影响因子：
9.2
通讯作者：
F. Ozcelik
中科院分区：
文献类型：
--
作者：
F. Ozcelik
机器或部门沿沿着直线的布置被称为单行布局，它是柔性制造系统中广泛采用的配置。提出了一种混合遗传算法（HGA）来求解不等尺寸、不等间隙的单排排样问题。该算法是由一个局部搜索算子的遗传算法的杂交。建议的HGA进行了测试，从文献中的51个众所周知的数据集，具有相等和不等的间隙，并与最知名的解决方案的结果进行了比较。最后，算法的有效性，在达到以前已知的最佳解决方案的显示，并获得了不等间隙的问题的改善高达7%。
The arrangement of machines or departments along a straight line is known as single row layout and it is a widely employed configuration in flexible manufacturing systems. In this paper, a hybrid genetic algorithm (HGA) is proposed to solve the single row layout design problem with unequal sized machines and unequal clearances. The algorithm is developed by hybridisation of a genetic algorithm with a local search operator. The proposed HGA is tested on 51 well known data sets from the literature with equal and unequal clearances, and the results are compared with the best known solutions. Finally, algorithm's effectiveness in reaching previously known best solutions is revealed and improvements up to 7% in problems with unequal clearance are obtained.