Mathematical Problems in Engineering

Volume 2012 (2012), Article ID 761978, 15 pages

http://dx.doi.org/10.1155/2012/761978

## Quasiparticle Swarm Optimization for Cross-Section Linear Profile Error Evaluation of Variation Elliptical Piston Skirt

Automation Department, Nanjing Institute of Technology, Nanjing 211167, China

Received 28 August 2011; Revised 23 October 2011; Accepted 14 November 2011

Academic Editor: Andrzej Swierniak

Copyright © 2012 Xiulan Wen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

Variation elliptical piston skirt has better mechanical and thermodynamic properties and it is widely applied in internal combustion engine in recent years. Because of its complex form, its geometrical precision evaluation is a difficult problem. In this paper, quasi-particle swarm optimization (QPSO) is proposed to calculate the minimum zone error and ellipticity of cross-section linear profile, where initial positions and initial velocities of all particles are generated by using quasi-random Halton sequences which sample points have good distribution properties and the particles’ velocities are modified by constriction factor approach. Then, the design formula and mathematical model of the cross-section linear profile of variation elliptical piston skirt are set up and its objective function calculation approach using QPSO to solve the minimum zone cross-section linear profile error is developed which conforms to the ISO/1101 standard. Finally, the experimental results evaluated by QPSO, particle swarm optimization (PSO), improved genetic algorithm (IGA) and the least square method (LSM) confirm the effectiveness of the proposed QPSO and it improves the linear profile error evaluation accuracy and efficiency. This method can be extended to other complex curve form error evaluation such as cam curve profile.

#### 1. Introduction

Piston skirt is the key parts of internal combustion engines (ICEs). Because internal combustion engines usually run under the circumstance of higher speed, larger pressure, and heavier load, it makes piston skirt work in overload conditions. Besides, piston skirt is also an important source of lubrication failures that will in turn lead to noise and power loss arisen from friction forces [1]. Therefore, it is necessary to improve its design, manufacture, measurement and evaluation method. With the rapid development of ICE industry, higher and higher design requirement for piston skirt is proposed for realizing high speed, high efficiency, low consumption, and low noise. The piston skirts of traditional formal cylinder and formal cone are seldom used, and they are mostly replaced with complex new-style profile piston skirts, especially for automobile engine. Among them convex variation elliptical piston skirt is widely applied that has the characteristics that the cross-section profiles at different heights are different ellipses and the axis-section profile is a convex curve. Compared with traditional one, the convex variation elliptical piston skirt has much better mechanical and thermodynamic properties. But the geometrical precision evaluation is a difficult problem because of its complex form. Recently many researchers have devoted themselves to develop different algorithms to compute the cross-section linear profile error of piston skirt. Huang et al. [2] proposed the algorithm based on single optimum seeking and moment method to evaluate cross-section linear profile error. In the hypothesis conditions of small deviation and small error with the measured data, least square cross-section linear profile error was calculated. Based on the combination of moment method and least square method, Huang and Wang [3] also put forward the evaluation method of piston skirt cross-section linear profile error. Liu et al. [4] set up the mathematical model of cross-section linear profile and deduced relevant designing formulae. The least square cross-section linear profile error was calculated. Nowadays most algorithms are based on LSM because of its ease of computation and the uniqueness of its solution. Because ISO 1101 (1996) recommends the form tolerance being evaluated based on the concept of minimum zone [5], the minimum zone method (MZM) has received much attention in recent years, and it has been applied to solve circularity (roundness), straightness, flatness, sphericity, and cylindricity error. Cheraghi et al. [6] formulated straightness and flatness errors by nonlinear optimization problems with linear objective function and nonlinear constraints. Samuel and Shunmugam [7] established the minimum circumscribed limacoid, maximum inscribed limacoid, and minimum zone limacoid in literature based on the computational geometry to evaluate sphericity error from coordinate measurement data. Weber et al. [8] proposed a unified linear approximation technique for use in evaluating the forms of straightness, flatness, circularity, and cylindricity. Non-linear equation for each form was linearized using Taylor expansion, and then it was solved as a linear program. Zhu and Ding [9] established the equivalence between the width of a point set and the inner radius of the convex hull of the self-difference of the set. An algorithm was proposed to calculate the “almost exact” minimum zone solution, which is implemented by solving a single linear programming problem. Li and Shi [10] applied the curvature technique for solving problems of roundness evaluation from coordinate data measured by CMM. Above methods are effective in solving simple form errors such as straightness, flatness, circularity, sphericity and cylindricity. Because the cross-section linear profile of variation elliptical piston skirt is more complex, it is difficult for traditional method to calculate the minimum zone error.

With the emergence of computational intelligence, the intelligence-oriented algorithms such as genetic algorithms (GAs) and particle swarm optimization (PSO) have been successfully employed to evaluate form error such as flatness, straightness, cylindricity, and so forth [11–13]. Wen attempted to calculate the minimum zone solution of piston skirt cross-section linear profile error by PSO [14]. Because there are several approximations in establishing profile error mathematical model, the solution is not very accurate.

In order to solve the minimum zone error of piston skirt cross-section linear profile accurately and efficiently, its mathematical model is founded, and QPSO is proposed. The paper is organized as follows: the design formula and mathematical model of the cross-section linear profile of variation elliptical piston skirt are set up. Then, QPSO for piston skirt cross-section linear profile error evaluation is developed. Finally, the examples are given, and conclusions are drawn.

#### 2. Mathematical Model of Piston Skirt Cross-Section Linear Profile Error Evaluation

##### 2.1. Design Formula

Set up the design coordinate system of the cross-section linear profile of variation elliptical piston skirt, shown in Figure 1. is the design point on the cross-section linear profile. The radial reduction of the point is usually formulated as [4] where is the diameter of long axis, is the diameter of short axis, is the polar angle of the point , is the coefficient of plump degree, and is the ellipticity.

The design formula of the point on cross-section linear profile is formulated as where is the radius of the point .

##### 2.2. Mathematics Model of Cross-Section Linear Profile

The measurement model of cross-section linear profile of variation elliptical piston skirt is shown in Figure 2.

is the revolving centre of the measurement platform and is the design center of piston skirt, is the setting eccentricity () and is the eccentric angle, and is the angle between the measurement coordinate axis and the long axis of design profile (). Assuming that (, is the number of measured point) is the measured point of the cross-section linear profile corresponding to the revolving centre , and and are the radius and polar angle of point , respectively. is the mapping point of , and and are the radius and polar angle of point in the design coordinate system . is the angle between and , is the angle between and . Because the setting eccentricity is very small, and is also very small.

Using cosine theorem in the triangle , we get the following: Equation (2.3) can be rewritten From Figure 2, we can learn So, we get the following: According to Taylor series expansion, we have the following When , the radius design value corresponding to the polar can be rewritten Using sine theorem in the triangle , we get the following Because is very small, , and it is substituted into (2.9), then (2.9) can be approximated as Substituting (2.10) into (2.8), we have the following:

##### 2.3. The Objective Function in Using QPSO to Calculate the Minimum Zone Error

The deviation between the polar radius of the mapping point and the polar radius of the design point corresponding to the same polar angle is where .

According to the ISO/1101 standard, the minimum zone solution of linear profile error is the minimum width value of two ideal equidistance design profiles which encompass the measured real profile. Therefore, the objective function in using QPSO to calculate the minimum zone error of cross-section linear profile can be expressed as: Equation (2.13) is a function of . Consequently, solving the minimum zone cross-section linear profile error of variation elliptical piston skirt is translated into searching the values of the parameters set , so that the objective function is the minimum.

#### 3. Using QPSO to Evaluate Piston Skirt Cross-Section Linear Profile Error

##### 3.1. Pseudorandom Numbers and Quasirandom Halton Sequences

###### 3.1.1. Pseudorandom Numbers and Quasirandom Sequences

Pseudorandom numbers are deterministic, but they try to imitate an independent sequence of genuine random numbers. Common pseudorandom number generators include linear congruential, quadratic congruential, inversive congruential, parallel linear congruential, et.al. In contrast to pseudorandom numbers, the points in a quasirandom sequence do not imitate genuine random points. But they try to cover the feasible region in an optimal way. Quasirandom generators do not generate numbers, but sequences of points in the desired dimension. Common quasirandom sequence generators include Halton, Hammersley, Faure, Sobol, and Niederreiter generators [15]. In this paper we focus our attention on Halton sequence since it is conceptually very appealing, and it can be produced easily and fast with simple algorithms.

###### 3.1.2. Halton Sequences

Halton sequences are not unique, and they depend on the set of prime numbers taken as bases to construct their vector components. Typically and most efficiently, the lowest possible primes are used.

Let be a prime number. Then any integer , can be written in base- representation as where . Define the base- radical inverse function, , as Notice that for every integer, .

The th element of the Halton sequence is obtained via the radical inverse function evaluated at . Specifically, if are different prime numbers, then a -dimensional Halton sequence of length is given by , where the th element of the sequence is

##### 3.2. QPSO for Evaluating Cross-Section Linear Profile Error of Piston Skirt

Particle swarm optimization (PSO) method is one of the most powerful methods for solving unconstrained and constrained global optimization problems. The method was originally proposed by Kennedy and Eberhart as an optimization method in 1995 [16], which was inspired by the social behavior of bird flocking and fish schooling. It utilizes a “population” of particles that fly through the problem hyperspace with given velocities [17]. In PSO initial position and initial velocity of particles are often randomly generated by using pseudorandom numbers [13, 18]. Because the positions of initial particles have influence on the optimization performance, Richard and Ventura [19] proposed initializing the particles in a way that they are distributed as evenly as possible throughout the problem space. This ensures a broad coverage of the search space. They concluded that applying a starting configuration based on the centroidal Voronoi tessellations (CVTs) improves the performance of the PSO compared with the original random initialization. As an alternative method, Campana et al. [20] proposed reformulating the standard iteration of PSO into a linear dynamic system. The system can then be investigated to determine the initial particles’ positions such that the trajectories over the problem hyperspace are orthogonal, improving the exploration mode and convergence of the swarm.

Quasirandom sequences have been successfully applied in numerical integration and in random search optimization methods [21]. The idea of a good initial population has also been used in genetic programming and genetic algorithm [22]. In this work, quasirandom Halton sequences are applied to generate the initial positions and velocities of particles in PSO for solving the minimum zone profile error of variation elliptical piston skirts. For short, the proposed PSO is called quasiparticle swarm optimization (QPSO).

QPSO algorithm begins by using quasirandom Halton sequences to initialize a swarm of particles ( is referred as particle size), each having unknown parameters ( is referred as the dimensionality of optimized variables) to be optimized at each iteration. The ideal cross-section linear profile can be decided by the set of six parameters and the method takes as a particle. Therefore, the dimension of the particle is six. The best particle with the minimum objective function value is considered as the minimum zone solution to the cross-section linear profile error. The flow of QPSO for evaluating cross-section linear profile error is as follows.

*Step 1. *Input the measurement values () () of the cross-section linear profile. If the point is measured in the Cartesian coordinates, it needs to be transformed into the polar coordinates.

*Step 2. *Generate the initial positions and initial velocities of all particles by using quasirandom Halton sequences.

*Step 3. *Calculate the objective functions of all particles according to (2.13). The less the objective function value is, the better the particle is.

*Step 4. *Update velocity. Because constriction factor approach (CFA) ensures the convergence of the search procedures based on the mathematical theory and can generate higher-quality solutions [23], CFA is employed to modify the velocity. The velocity and position parameters of each particle () in the swarm are updated at iteration () according to CFA:

where and are the velocity and position of th particle at iteration *t*, respectively. and are uniform random numbers between 0 and 1. , and are acceleration factors that determine the relative pull for each particle toward its previous best position (*best*) and the group’s best position (*best*), respectively. and meet the conditions .

*Step 5. *Update position. The position of each particle is modified by

*Step 6. *Update *best*. Calculate the objective function of all particles. If the current objective function value of a particle is less than the old *best* value, the *best *is replaced with the current position.

*Step 7. *Update *best*. If the current objective function value of a particle is less than the old *best *value, the *best* is replaced with the current position.

*Step 8. *Go to Step 4 until the maximum iteration is satisfied.

*Step 9. *Output the computation results.

#### 4. Results and Discussion

##### 4.1. Optimizing Classical Testing Functions

In order to verify the optimization efficiency of QPSO, numerical experiments on some classical testing functions are carried out [24]. Two examples are given as follows.

*Function 1*

It is hard to be minimized. The global minimum point is at (1.0, l.0), and the global minimum is zero.

*Function 2*

It is the Schaffer test function defined as
This function has many circle ridges nearby the global minimum (1.0, l.0), and the function value of the nearest circle ridge () is 0.009716. It is very easy to trap in this value.

The proposed algorithms were written in MATLAB, and the experiments were run in Windows XP on an IBM ThinkPad X200-7457 A46 with 2.26 GHz main frequency and 1 GB memory. QPSO is also a stochastic optimization method and it is important to evaluate the average performance. For comparison, two stochastic optimization methods including PSO [13] and IGA [11] are employed. The popsize size was set 50, and 20 trials were performed in prescribed maximum iteration 200. In specified initial ranges, initial populations and initial positions were randomly generated by using pseudorandom numbers for PSO and IGA. Initial populations were generated by using Halton random sequences for QPSO. The mean values and the standard deviations are tabulated in Table 1.

As seen in Table 1, the QPSO method for two examples could provide more accurate and stable solution. Figures 3 and 4 show the optimizing processes of these methods at one trial for two examples, respectively. As seen in the figures, it is evident that the optimization performance of QPSO is better than those of PSO and IGA.

##### 4.2. Examples

*Simulation Example*

According to the design formula of cross-section linear profile of variation elliptical piston skirt, the simulation data with random noise are generated. The setting eccentricity and the angle between the measurement coordinate axis and the long axis of design profile are set by the coordinate translation and rotation transform. In the experiment, the design data of are listed in Table 2, and the transformed simulation data are shown in Table 3. For comparison, IGA and PSO were employed. Considering the values of optimized parameters, are very small, and and are usually larger, in order to save searching time, the initial populations and initial positions were randomly generated by using pseudorandom numbers in: (,,,,) for IGA and PSO. For QPSO the initial positions were generated by using quasrandom Halton sequence in () and the initial velocities were generated by using quasirandom Halton sequence in:(). In our experiments, is all set 0.5. The searching process and optimization results of the minimum zone error of cross-section linear profile by different methods are shown in Figure 5 and Table 2. As seen in Figure 5 and Table 2, the minimum zone error by QPSO is 0.0775 mm and it is smaller than that by PSO and IGA. It takes about 40 iterations for the proposed QPSO to find the optimal solution and it is faster than PSO and IGA. The cross-section linear profile error by LSM is 0.0932 mm and it is larger than the minimum zone error.

*Practical Example*

The cross-section profiles of piston skirt of a SL 105 diesel engine are variation ellipses and its main cross-section profiles (upper end, convexity and lower end) are inspected by Coordinate Measurement Machine (CMM). And the minimum zone error of every cross-section linear profile is calculated by the proposed QPSO and the results are listed in Table 4. For comparison, the ellipticities of three cross-sections are calibrated by 19JPC microcomputer-type all-purpose tool microscope and the values are also listed in Table 4. From the table, we can learn the cross-section linear profile error of MZM is less than that of LSM. And the ellipticity calculated by QPSO is almost the same as the calibration value.

#### 5. Conclusions

In this paper, QPSO is proposed to calculate the minimum zone error and ellipticity of cross-section linear profile of variation elliptical piston skirt, which initial positions and initial velocities of all particles are generated by using quasirandom Halton sequences and the particles’ velocities are modified by constriction factor approach. The design formula and mathematical model of the cross-section linear profile are set up and its objective function calculation approach using QPSO to solve the minimum zone error of cross-section linear profile is developed. The simulation and practical examples confirm the optimization efficiency of QPSO is better than that of PSO and IGA for complex optimal problems. Compared with conventional evaluation methods, the proposed method not only has the advantages of simple algorithm and good flexibility, but also improves cross-section linear profile error evaluation accuracy. The proposed method can be extended to other complex curve profile error evaluation.

#### Acknowledgments

The research was supported by Natural Science Research Project of the People’s Republic of China (no: 51075198), Natural Science Research Project of Jiangsu Province (BK2010479) Jiangsu Provincial Project of 333 Talents Engineering of China, Jiangsu Provincial Project of Six Talented Peak of China.

#### References

- F. M. Meng, Y. Y. Zhang, Y. Z. Hu, and H. Wang, “Thermo-elasto-hydrodynamic lubrication analysis of piston skirt considering oil film inertia effect,”
*Tribology International*, vol. 40, no. 7, pp. 1089–1099, 2007. View at Publisher · View at Google Scholar · View at Scopus - R. Y. Huang, N. X. Wang, and Q. Yang, “The evaluation of piston skirt contour error,”
*Acta Northwest Agriculture University*, vol. 21, no. 3, pp. 41–46, 1993 (Chinese). View at Google Scholar - R. Y. Huang and N. X. Wang, “Study on the evaluation of piston skirt cross-section contour error with moment method,”
*Transactions of CSICE*, vol. 14, no. 1, pp. 84–91, 1996 (Chinese). View at Google Scholar - H. G. Liu, D. A. Wan, X. L. Min et al., “Study on least square method about the evaluation of contour of cross section of variation elliptical piston skirt,”
*Journal of Tongji University*, vol. 28, no. 2, pp. 231–235, 2000 (Chinese). View at Google Scholar - ISO/DIS 1101-1996, Technical drawings—geometrical tolerancing, ISO, Geneva, Switzerland, 1996.
- S. H. Cheraghi, H. S. Lim, and S. Motavalli, “Straightness and flatness tolerance evaluation: an optimization approach,”
*Precision Engineering*, vol. 18, no. 1, pp. 30–37, 1996. View at Publisher · View at Google Scholar · View at Scopus - G. L. Samuel and M. S. Shunmugam, “Evaluation of sphericity error from coordinate measurement data using computational geometric techniques,”
*Computer Methods in Applied Mechanics and Engineering*, vol. 190, no. 51-52, pp. 6765–6781, 2001. View at Publisher · View at Google Scholar · View at Scopus - T. Weber, S. Motavalli, B. Fallahi, and S. H. Cheraghi, “A unified approach to form error evaluation,”
*Precision Engineering*, vol. 26, no. 3, pp. 269–278, 2002. View at Publisher · View at Google Scholar · View at Scopus - X. Zhu and H. Ding, “Flatness tolerance evaluation: an approximate minimum zone solution,”
*CAD Computer Aided Design*, vol. 34, no. 9, pp. 655–664, 2002. View at Publisher · View at Google Scholar · View at Scopus - X. M. Li and Z. Y. Shi, “Evaluation of roundness error from coordinate data using curvature technique,”
*Measurement*, vol. 43, no. 2, pp. 164–168, 2010. View at Publisher · View at Google Scholar · View at Scopus - X. Wen and A. Song, “An improved genetic algorithm for planar and spatial straightness error evaluation,”
*International Journal of Machine Tools and Manufacture*, vol. 43, no. 11, pp. 1157–1162, 2003. View at Publisher · View at Google Scholar · View at Scopus - C. H. Liu, W. Y. Jywe, and C. K. Chen, “Quality assessment on a conical taper part based on the minimum zone definition using genetic algorithms,”
*International Journal of Machine Tools and Manufacture*, vol. 44, no. 2-3, pp. 183–190, 2004. View at Publisher · View at Google Scholar · View at Scopus - X. L. Wen, J. C. Huang, D. H. Sheng, and F. L. Wang, “Conicity and cylindricity error evaluation using particle swarm optimization,”
*Precision Engineering*, vol. 34, no. 2, pp. 338–344, 2010. View at Publisher · View at Google Scholar · View at Scopus - X. L. Wen, Y. B. Zhao, F. L. Wang, and D. X. Wang, “Particle swarm optimization for the evaluation of cross-section contour error of variation elliptical piston skirt,” in
*Proceedings of the International Conference on Computer Application and System Modeling*, pp. V131–V135, October 2010. View at Publisher · View at Google Scholar · View at Scopus - J. Wolfgang, “Quasi-Monte Carlo sampling to improve the efficiency of Monte Carlo EM,”
*Computational Statistics and Data Analysis*, vol. 48, no. 4, pp. 685–701, 2005. View at Publisher · View at Google Scholar · View at Scopus - J. Kennedy and R. Eberhart, “Particle swarm optimization,” in
*Proceedings of the IEEE International Conference on Neural Networks*, pp. 1942–1948, December 1995. View at Scopus - R. Eberhart, Y. Shi, and J. Kennedy,
*Swarm Intelligence*, Morgan Kaufmann, San Mateo, Calif, USA, 2001. - Y. del Valle, G. K. Venayagamoorthy, S. Mohagheghi, J. C. Hernandez, and R. G. Harley, “Particle swarm optimization: basic concepts, variants and applications in power systems,”
*IEEE Transactions on Evolutionary Computation*, vol. 12, no. 2, pp. 171–195, 2008. View at Publisher · View at Google Scholar · View at Scopus - M. Richards and D. Ventura, “Choosing a starting configuration for particle swarm optimization,” in
*Proceedings of the IEEE International Joint Conference on Neural Networks*, pp. 2309–2312, July 2004. View at Scopus - E. F. Campana, G. Fasano, and A. Pinto, “Dynamic system analysis and initial particles position in particle swarm optimization,” in
*Proceedings of the IEEE Swarm Intelligence Symposium*, pp. 202–209, May 2006. - G. Lei, “Adaptive random search in quasi-Monte Carlo methods for global optimization,”
*Computers & Mathematics with Applications*, vol. 43, no. 6-7, pp. 747–754, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - H. Maaranen, K. Miettinen, and M. M. Mäkelä, “Quasi-random initial population for genetic algorithms,”
*Computers & Mathematics with Applications*, vol. 47, no. 12, pp. 1885–1895, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - R. C. Eberhart and Y. Shi, “Comparing inertia weights and constriction factors in particle swarm optimization,” in
*Proceedings of the Congress on Evolutionary Computation*, pp. 84–88, July 2000. View at Scopus - J. J. Liang, A. K. Qin, P. N. Suganthan, and S. Baskar, “Comprehensive learning particle swarm optimizer for global optimization of multimodal functions,”
*IEEE Transactions on Evolutionary Computation*, vol. 10, no. 3, pp. 281–295, 2006. View at Publisher · View at Google Scholar · View at Scopus