论文部分内容阅读
提出了一种改进的禁忌搜索算法 .该算法利用了 Hash技术和对 Job-Shop调度问题的解进行编码实现了对 Job-Shop调度问题的解进行禁忌 .在算法中增加了回访功能 ,它可对未访问到的先前产生的解的相邻解继续搜索 .仿真实验表明算法是可行的和有效的 .
An improved tabu search algorithm is proposed.This algorithm uses Hash technology and encodes the solution of Job-Shop scheduling problem to achieve taboo solution to the Job-Shop scheduling problem.It adds return function in the algorithm, The search for the neighboring solutions to the previously generated solutions that have not been visited continues to be simulated. Simulation results show that the algorithm is feasible and effective.