期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Solving Job-Shop Scheduling Problem Based on Improved Adaptive Particle Swarm Optimization Algorithm 被引量:3
1
作者 顾文斌 唐敦兵 郑堃 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI 2014年第5期559-567,共9页
An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal ... An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal factor(HF),composed of an adaptive local hormonal factor(H l)and an adaptive global hormonal factor(H g),is devised to strengthen the information connection between particles.Using HF,each particle of the swarm can adjust its position self-adaptively to avoid premature phenomena and reach better solution.The computational results validate the effectiveness and stability of the proposed IAPSO,which can not only find optimal or close-to-optimal solutions but also obtain both better and more stability results than the existing particle swarm optimization(PSO)algorithms. 展开更多
关键词 job-shop scheduling problem(JSP) hormone modulation mechanism improved adaptive particle swarm optimization(IAPSO) algorithm minimum makespan
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部