基于信息素调整的蚁群算法求解JSP问题

为更好的求解作业车间调度问题,针对基本蚁群算法求解作业车间调度问题容易进入局部最优问题的情况,提出了一种基于信息素调整的蚁群算法.该算法通过判断信息素矩阵中最大值与最小值之间的比值,当该比值达到算法设定的阀值时,根据相应策略时信息素矩阵进行调整,有效地缩小了信息素之间的差距,有利于跳出局部最优状态;给出了该算法实施的具体步骤.用该算法求解作业车间调度问题,仿真实验结果表明,该算法与基本蚁群算法相比在收敛速度和计算最优解方面都有了改进.

Implementation of ant colony system algorithm with changing pheromones for job shop scheduling problem

Ant colony system algorithm solve the job shop scheduling problem,but it is easily trapped in local optimization problem.So an ant colony system algorithm with changing the pheromones is proposed.This algorithm firstly computes the ratio of the maximum value and minimum value of the pheromone matrix,and if the radio is over a certain threshold,the pheromone matrix is reset by the corresponding strategy.This algorithm narrow the gap of the pheromones and avoid the local optimal state.And the algorithm steps ...