机构地区: 西北工业大学机电学院系统集成与工程管理研究所
出 处: 《机械工程学报》 2005年第3期25-31,共7页
摘 要: 车间作业调度是典型的NP难题,传统求解方法都有各自的特色和不足。免疫系统强大的信息处理能力为人工免疫应用提供了丰富的暗示,因此,免疫算法被提出,并逐渐应用于许多工程实际。针对车间作业调度这个优化问题的难处理性,提出了基于动态评价的免疫算法用于求解车间作业调度问题。并建立了车间作业调度的模型,构造了抗体,设计了免疫算子,通过对著名的FT10×10标准问题进行仿真,同其他方法进行了比较,仿真结果不但验证了它的有效性,而且表明此算法优于其他算法。 The job-shop scheduling problem (JSS) is NP-hard. Traditional algorithms have their features and disadvantages. The powerful system processing capabilities of the immune system provide rich metaphors for its artificial counterpart. As a result, immune algorithm has emerged, and gradually been applied to many engineering practices. Due to the stubborn nature of the JSS, a dynamic evaluation based immune algorithm(DEIA) is initially brought forward to solve JSS. The JSS model is set up, and the antibody is constructed. By simulations of FT10×10 benchmark problem and comparisons with other algorithms, the proposed DEIA proves to be efficient in solving JSS.
关 键 词: 基于动态评价的免疫算法 车间作业调度 临时解集