A modified algorithm of Particle Swarm Optimization for form error evaluation

2017 ◽  
Vol 84 (4) ◽  
Author(s):  
Vimal Kumar Pathak ◽  
Amit Kumar Singh ◽  
Ramanpreet Singh ◽  
Himanshu Chaudhary

AbstractThe set of measured data points acquired from the Coordinate Measuring Machine (CMM) need to be processed and analyzed for evaluating the form errors inside the manufactured components. This paper presents a modified algorithm of particle swarm optimization (MPSO) for assessing the form error from the set of coordinate measured data points. In the classical algorithm of the particle swarm optimization (PSO), the value of the candidate solution is updated from its existing value without actually comparing the value obtained in the consecutive iterations for fitness. This behaviour attributes to a lack of exploitation ability in the defined search space. The proposed algorithm generates new swarm position and fitness solution for the objective function through an improved and modified search equation based on a proposed heuristic step. In this step, the swarm searches around the best solution of the previous iteration for improving the swarm exploitation capability. The particle swarm uses greedy selection procedure to choose the best candidate solution. A non-linear minimum zone objective function is formulated mathematically for different types of form errors and then optimized using proposed MPSO. Five benchmark functions are used to prove the effectiveness of the modified algorithm, which is verified by comparing its solution and convergence with those obtained from the established algorithms namely PSO and genetic algorithm (GA). Finally, the result of the proposed algorithm for form error evaluation is compared with previous work and other established nature-inspired algorithms. The results demonstrate that the proposed MPSO algorithm is more efficient and accurate than the other conventional heuristic optimization algorithms. Furthermore, it is well suited for form error evaluation using CMM acquired data.

2017 ◽  
Vol 16 (03) ◽  
pp. 205-226 ◽  
Author(s):  
Vimal Kumar Pathak ◽  
Amit Kumar Singh

Form error evaluation of manufactured parts is one of the crucial aspects of precision coordinate metrology. With the advent of technology, the noncontact data acquisition techniques are replacing the conventional machines like coordinate measuring machine (CMM). This paper presents an optimization technique to evaluate minimum zone form errors, namely straightness, circularity, flatness and cylindricity using constriction factor-based particle swarm optimization (CFPSO) algorithm. Addition of constriction factor helps in accelerating the convergence property of CFPSO. Initially, a simple minimum zone objective function is formulated mathematically for each form error and then optimized using the proposed CFPSO. Primarily, the results of the proposed method for form error evaluation are compared with the literature results. Furthermore, the data obtained from noncontact 3D scanner is processed and the results of form error evaluation using CFPSO algorithm are compared with Steinbichler’s INSPECT PLUS software results. It was found that the results obtained using the proposed CFPSO algorithm are fast and better as compared with other evolutionary techniques like genetic algorithm (GA), previous literatures and software results. Furthermore, to ensure effectiveness of the proposed method statistical analysis ([Formula: see text]-test) was performed. CFPSO results for large dimension of problem show significant difference in computation time as compared with GA. The CFPSO algorithm provides 27.25%, 7.5% and 6.38% improvements in circularity, flatness and cylindricity, respectively, in comparison to RE software results, for determination of minimum zone error. Thus, the methodology presented helps in improving the accuracy and for speeding up of the automated inspection process generally performed by CMMs in industries.


2018 ◽  
Vol 72 ◽  
pp. 1-11 ◽  
Author(s):  
Zhongke Wu ◽  
Xingce Wang ◽  
Yan Fu ◽  
Junchen Shen ◽  
Qianqian Jiang ◽  
...  

2010 ◽  
Vol 34 (2) ◽  
pp. 338-344 ◽  
Author(s):  
Xiu-Lan Wen ◽  
Jia-Cai Huang ◽  
Dang-Hong Sheng ◽  
Feng-Lin Wang

Author(s):  
Hung Quoc Truong ◽  
◽  
Long Thanh Ngo ◽  
Long The Pham

The interval type-2 fuzzy possibilistic C-means clustering (IT2FPCM) algorithm improves the performance of the fuzzy possibilistic C-means clustering (FPCM) algorithm by addressing high degrees of noise and uncertainty. However, the IT2FPCM algorithm continues to face drawbacks including sensitivity to cluster centroid initialization, slow processing speed, and the possibility of being easily trapped in local optima. To overcome these drawbacks and better address noise and uncertainty, we propose an IT2FPCM method based on granular gravitational forces and particle swarm optimization (PSO). This method is based on the idea of gravitational forces grouping the data points into granules and then processing clusters on a granular space using a hybrid algorithm of the IT2FPCM and PSO algorithms. The proposed method also determines the initial centroids by merging granules until the number of granules is equal to the number of clusters. By reducing the elements in the granular space, the proposed algorithms also significantly improve performance when clustering large datasets. Experimental results are reported on different datasets compared with other approaches to demonstrate the advantages of the proposed method.


Sign in / Sign up

Export Citation Format

Share Document