描述了Job-shop调度问题,研究遗传算法和蚁群算法在解决Job-shop问题中的优点和不足,融合遗传算法和蚁群算法设计了遗传蚁群算法以求解Job-shop调度问题,并对算法进行了仿真实验,通过与遗传算法、蚁群算法及已有的遗传算法和蚁群算法的融合算法结果的对比,验证了该算法的有效性。
This paper addressed the problem of Job-shop scheduling,and analyzed the advantage and disadvantage of GA and ACO in solving the Job-shop scheduling problem. By combining GA and ACO,proposed a novel GACA to solve the above problem. Simulation results are better compared with those obtained from GA,ACO and GAAA. It shows that the novel algorithm GACA is feasible and efficient.