Proposition of Selection Operation in a Genetic Algorithm for a Job Shop Rescheduling Problem
Proposition of Selection Operation in a Genetic Algorithm for a Job Shop Rescheduling Problem
复制标题
DOI：
10.1007/978-3-540-31880-4_50
复制
发表时间：
2005-03
期刊：
影响因子：
--
通讯作者：
H. Iima
中科院分区：
文献类型：
--
作者：
H. Iima
本文研究了一个带有交货期变更的车间双目标重调度问题。该问题的一个目标是最小化总误工时间，另一个目标是最小化时间差。提出了一种遗传算法，并特别引入了一种新的选择操作，以获得该问题的Pareto最优解。在所提出的方法中，在每一代，两个解决方案被选为父母。其中一个是从总体中选取的，另一个是从归档解决方案集中选取的。然后，从这些父母和四个孩子通过交叉和变异操作产生的两个解决方案。所选择的候选方案不仅是接近帕累托最优前沿的解，而且是具有较小总延误值的解，因为初始解是在总延误为零的解周围。为此，解决方案空间基于存档解决方案进行排名。计算结果表明，该方法优于其他方法。
This paper deals with a two-objective rescheduling problem in a job shop for alteration of due date. One objective of this problem is to minimize the total tardiness, and the other is to minimize the difference of schedule. A genetic algorithm is proposed, and a new selection operation is particularly introduced to obtain the Pareto optimal solutions in the problem. At every generation in the proposed method, two solutions are picked up as the parents. While one of them is picked up from the population, the other is picked up from the archive solution set. Then, two solutions are selected from these parents and four children generated by means of the crossover and the mutation operation. The candidates selected are not only solutions close to the Pareto-optimal front but also solutions with a smaller value of the total tardiness, because the initial solutions are around the solution in which the total tardiness is zero. For this purpose, the solution space is ranked on the basis of the archive solutions. It is confirmed from the computational result that the proposed method outperforms other methods.