CAJ | 학술논문

针对柔性作业车间调度问题，提出一种改进模拟退火算法来进行求解。该算法引入粒子群算法中的基于位置取整和基于轮盘赌两种个体编码方法，并采用3种不同的局部搜索方法来构造个体的邻域结构。算例计算表明，改进模拟退火算法在求解柔性作业车间调度问题时，比粒子群算法、混合粒子群算法以及模拟退火算法具有更好的求解性能，其中采用轮盘赌编码时，算法的求解性能要优于采用位置取整时的求解性能，且基于互换的局部搜索方法要优于其他两种局部搜索方法，能更有效地改善算法的求解性能。
침대유성작업차간조도문제，제출일충개진모의퇴화산법래진행구해。해산법인입입자군산법중적기우위치취정화기우륜반도량충개체편마방법，병채용3충불동적국부수색방법래구조개체적린역결구。산례계산표명，개진모의퇴화산법재구해유성작업차간조도문제시，비입자군산법、혼합입자군산법이급모의퇴화산법구유경호적구해성능，기중채용륜반도편마시，산법적구해성능요우우채용위치취정시적구해성능，차기우호환적국부수색방법요우우기타량충국부수색방법，능경유효지개선산법적구해성능。
A modified simulated annealing algorithm was put forward to resolve the flexible job‐shop scheduling problem ,which used two kinds of individual encoding method respectively based on parti‐cle position rounding and roulette probability assignment in particle swarm algorithm .Three different local search methods were employed to constitute the neighborhood structure .The computational re‐sults show that the modified simulated annealing algorithm is more effective than particle swarm algo‐rithm ,hybrid particle swarm algorithm and simulated annealing algorithm in resolving the flexible job‐shop scheduling problem .Compared with the position rounding encoding method ,the roulette‐probability‐assignment‐based encoding method can render the algorithm more effective ,and the local search method based on crossing‐over operation is better than the other two search methods in impro‐ving the solving performance of the algorithm .