We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Double Archive Particle Swarm Optimization Solving Flexible Job-Shop Scheduling Problem.
- Authors
ZHANG Yujia; SONG Wei
- Abstract
This paper proposes a particle swarm optimization based on credibility of solution and double archive to minimize makespan of flexible job-shop scheduling problem (FJSP). Firstly, the elite archive and the optimization archive are constructed to store the individual historical optimal position (Pbest) of the elite particle with better fitness value and the position of the particles that have made rapid progress, respectively. Secondly, it uses the particles in the elite archives to calculate the credibility of solution, and judge the evolutionary state of the current population according to the credibility of solution. The particles adjust the strength of learning from the two archives according to the evolutionary state to achieve a balance between convergence and diversity. Further, extensive experiments are carried out on 5 test problems of Kacem and 10 test problems of MK series, and the comparison with other algorithms according to the minimum completion time and average completion time proves the effectiveness of DAPSO in solving the FJSP problem.
- Subjects
PARTICLE swarm optimization; PRODUCTION scheduling; FLOW shops; ARCHIVES
- Publication
Journal of Computer Engineering & Applications, 2023, Vol 59, Issue 11, p294
- ISSN
1002-8331
- Publication type
Article
- DOI
10.3778/j.issn.1002-8331.2202-0298