The Comparison of Imperialist Competitive Algorithm Applied and Genetic Algorithm for Machining Allocation of Clutch Assembly (TECHNICAL NOTE)

The allocation of design tolerances between the components of a mechanical assembly and manufacturing tolerances can significantly affect the functionality of products and related production costs. This paper introduces Imperialist Competitive Algorithm (ICA) approach to solve the machining tolerance allocation of an overrunning clutch assembly. ICA is a multi-agent algorithm with each agent being a country, which is either a colony or an imperialist. These countries form some empires in the search space. Movement of the colonies toward their related imperialist, and imperialistic competition among the empires, form the basis of the ICA. During these movements, the powerful imperialist are reinforced and the weak ones are weakened and gradually collapsed, directing the algorithm towards optimum points. The objective of present study is to obtain optimum tolerances of the individual components for the minimum cost of manufacturing using ICA.The results were finally compared with the Genetic Algorithm (GA). Based on the results, ICA has demonstrated excellent capabilities such as accuracy, faster convergence and better global optimum achievement in comparison with traditional GA.

[1]  Leandro dos Santos Coelho,et al.  Self-organizing migration algorithm applied to machining allocation of clutch assembly , 2009, Math. Comput. Simul..

[2]  R. Saravanan,et al.  Tolerance design optimization of machine elements using genetic algorithm , 2005 .

[3]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[4]  K. Deb.  An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .

[5]  M. Yousefi,et al.  An imperialist competitive algorithm for optimal design of plate-fin heat exchangers , 2012 .

[6]  Siamak Talatahari,et al.  Optimum design of skeletal structures using imperialist competitive algorithm , 2010 .

[7]  Caro Lucas,et al.  Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition , 2007, 2007 IEEE Congress on Evolutionary Computation.

[8]  P. K. Jain,et al.  A genetic algorithm-based solution to optimal tolerance synthesis of mechanical assemblies with alternative manufacturing processes: focus on complex tolerancing problems , 2004 .

[9]  Melanie Mitchell,et al.  An introduction to genetic algorithms , 1996 .

[10]  Satish C. Jain,et al.  Advanced optimal tolerance design of mechanical assemblies with interrelated dimension chains and process precision limits , 2005, Comput. Ind..

[11]  Behzad Abdi,et al.  Optimization of Adhesive-Bonded Fiber Glass Strip using Imperialist Competitive Algorithm , 2012 .

[12]  Caro Lucas,et al.  Colonial competitive algorithm: A novel approach for PID controller design in MIMO distillation column process , 2008, Int. J. Intell. Comput. Cybern..

[13]  Earlwood T. Fortini.  Dimensioning for interchangeable manufacture , 1967 .

[14]  Towsyfyan Hossein,et al.  Optimization of Bead Geometry in Submerged Arc Welding Process Using Imperialist Competitive Algorithm , 2012 .

[15]  Kamran Rezaie,et al.  Solving the integrated product mix-outsourcing problem using the Imperialist Competitive Algorithm , 2010, Expert Syst. Appl..

[16]  R. Saravanan,et al.  Particle swarm optimization (PSO) algorithm for optimal machining allocation of clutch assembly , 2006 .

[17]  Babak Forouraghi.  Worst-Case Tolerance Design and Quality Assurance via Genetic Algorithms , 2002 .