Solving Job-Shop Scheduling Problem Based on Improved Adaptive Particle Swarm Optimization Algorithm |
| |
| Authors: | Gu Wenbin Tang Dunbing Zheng Kun |
| |
| Affiliation: | 1. College of Mechanical and Electrical Engineering, Nanjing University of Aeronautics and Astronautics,Nanjing, 210016, P.R.China;College of Mechanical and Electrical Engineering, Hohai University Changzhou, Changzhou, 213022, P.R.China
2. College of Mechanical and Electrical Engineering, Nanjing University of Aeronautics and Astronautics,Nanjing, 210016, P.R.China |
| |
| Abstract: | 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. |
| |
| Keywords: | job-shop scheduling problem (JSP) hormone modulation mechanism improved adaptive particle swarm optimization (IAPSO) algorithm minimum makespan |
| 本文献已被 CNKI 等数据库收录！ |
|
