论文部分内容阅读
针对零等待流水车间调度问题特性,设计了一种蝙蝠算法进行求解.算法模拟蝙蝠捕食搜索行为进行寻优,利用基于最小位置值规则的随机键编码方式来表示问题解,采用基于NEH方法的局部搜索策略和随机交换、插入、逆序操作的变邻域搜索策略来提高局部优化性能,进一步根据Metropolis概率准则接受劣解来避免早熟.通过典型算例对所提算法进行仿真测试并与粒子群算法和RAJ启发式算法进行对比,结果表明所设计算法求解零等待流水车间调度问题的有效性和优越性,是求解流水车间生产调度问题的一种有效工具.
Aiming at the characteristics of zero-waiting flowshop scheduling problem, a bat algorithm is proposed to solve the problem. The algorithm simulates the searching behavior of bats, and uses the random key coding method based on the minimum position rule to represent the problem solution. Search strategies and random exchange, insert, reverse order to improve the performance of local optimization, and to accept the Metropolis probability criterion to avoid premature .Through the typical examples of the proposed algorithm to simulate the test and with the Particle Swarm Optimization Compared with the RAJ heuristic algorithm, the results show that the proposed algorithm solves the validity and superiority of the zero waiting flowshop scheduling problem, and is an effective tool to solve the flowshop scheduling problem.