基于退火选择微粒群算法的车间调度问题研究

Research of the job shop scheduling problem based on the ASPSO algorithm

针对车间调度问题研究的不足,以及标准微粒群算法只能求解无约束问题和容易陷入局部最优的缺陷,提出一种退火选择微粒群算法。通过构造混合罚函数的方式对目标函数进行优化;采用一种动态权重策略,并与模拟退火算法以及遗传算法的选择过程相结合,有效避免陷入局部最优,提高了算法的寻优能力。将ASPSO算法应用于实例仿真,得到了较好的结果,证明了算法的可行性和有效性。

Annealing selection particle swarm optimization algorithm （ASPS0） is put forward in this paper for the Job Shop Scheduling Problem. For only unconstrained optimization problems can be solved with the Standard Particle Swarm Optimization algorithm （PSO）, the method of constructing penalty functions is proposed. However, because of the disadvantage of local optimum drawback in the search of PSO, a dynamic weighting strategy is presented, which is combined with simulated annealing algorithm and Genetic selection process, and the ability of the algorithm optimization is improved. The Algorithm is applied into simulation, and had achieved a good result and the feasibility and effectiveness of the algorithm is proved.