Hybrid particle swarm optimization algorithm for process planning

10Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

Abstract

Process planning is a typical combinatorial optimization problem. When the scale of the problem increases, combinatorial explosion occurs, which makes it difficult for traditional precise algorithms to solve the problem. A hybrid particle swarm optimization (HPSO) algorithm is proposed in this paper to solve problems of process planning. A hierarchical coding method including operation layer, machine layer and logic layer is designed in this algorithm. Each layer of coding corresponds to the decision of a sub-problem of process planning. Several genetic operators of the genetic algorithm are designed to replace the update formula of particle position and velocity in the particle swarm optimization algorithm. The results of the benchmark example in case study show that the algorithm proposed in this paper has better performance.

Cite

CITATION STYLE

APA

Zhang, X., Guo, P., Zhang, H., & Yao, J. (2020). Hybrid particle swarm optimization algorithm for process planning. Mathematics, 8(10), 1–22. https://doi.org/10.3390/math8101745

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free