Using Hybrid Particle Swarm Optimization for Process Planning Problem

摘要：

In this paper, a hybrid particle swarm optimization (PSO) incorporating local search algorithm is reported to handle the process planning problem. From modeling perspective, the process planning problem is considered as deciding the operation methods, including selection of machine, tool and tool approach direction, and operation sequencing in a concurrent way, which is a non-deterministic polynomial-time (NP) hard combinatorial problem. To solve this discrete optimization problem, a hybrid PSO approach is proposed using a specific solution representation, update and search. The presented case study has shown the capability of the proposed algorithm to gain a good quality of solution.

作者: Y.F.Wang Y.F.Zhang J.Y.H.Fuh

作者单位: Department of Mechanical Engineering, National University of Singapore

会议类型: 国际会议

会议名称: The Second International Joint Conference on Computational Science and Optimization(CSO 2009)(2009 国际计算科学与优化会议)

会议地点: 三亚

会议语种:英文

页码: 304-308

在线出版日期: 2009-04-24（万方平台首次上网日期，不代表论文的发表时间）