Abstract
The distributed permutation flow shop scheduling problem (DPFSP) is a variant of the permutation flow shop scheduling problem (PFSP). DPFSP is closer to the actual situation of industrial production and has important research significance. In this paper, a multiobjective particle swarm optimization with directional search (MoPSO-DS) is proposed to solve DPFSP. Directional search strategy are inspired by decomposition. Firstly, MoPSO-DS divides the particle swarm into three subgroups, and three subgroups are biased in different regions of the Pareto front. Then, particles are updated in the direction of the partiality. Finally, combine the particles of the three subgroups to find the best solution. MoPSO-DS updates particles in different directions which speed up the convergence of the particles while ensuring good distribution performance. In this paper, MoPSO-DS is compared with the NAGA-II, SPEA2, MoPSO, MOEA/D, and MOHEA algorithms. Experimental results show that the performance of MoPSO-DS is better.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
