Enhance performance of inspection process on Coordinate Measuring Machine

Abstract Coordinate Measuring Machine (CMM) has been an important inspection tool in quality control for several years owing to its high accuracy and precision. Effectiveness of inspection plan generated by CMM greatly depends on measurement cycle time. Lesser the inspection time taken by CMM to measure a given part better will be the performance of inspection process. Therefore, it has been critical to reduce measurement time for efficient performance of inspection process. In this paper, methodologies to generate most suitable measurement path resulting into minimum inspection time has been introduced. These methodologies are based on different algorithms to reduce measurement cycle time for CMM. The different algorithms have successfully been explored and compared to show their effectiveness in minimizing inspection time for stationary CMM equipped with touch trigger probe. The proposed methodologies have also been implemented and tested on real-world mechanical part with certain number of features to demonstrate their applicability.

[1]  Shyi-Ming Chen,et al.  Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques , 2011, Expert Syst. Appl..

[2]  Jasbir S. Arora,et al.  A genetic algorithm for sequencing type problems in engineering design , 1997 .

[3]  D. Morton,et al.  An artificial intelligent (AI) inspection path management for multiple tasks measurement on co-ordinate measuring machine (CMM): an application of neural network technology , 1995, Proceedings for Operating Research and the Management Sciences.

[4]  Kai Zhao,et al.  Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search , 2011, Appl. Soft Comput..

[5]  S. M. Ruegsegger,et al.  Intelligent scheduling optimization using a rule-based artificial neural network , 1993, Proceedings of the IEEE 1993 National Aerospace and Electronics Conference-NAECON 1993.

[6]  Farhad Kolahan,et al.  Modeling and Optimization of Abrasive Waterjet Parameters using Regression Analysis , 2009 .

[7]  An Wang,et al.  CMM sequence optimisation with collision detection , 2006, Int. J. Comput. Appl. Technol..

[8]  Liangsheng Qu,et al.  Optimization of the measuring path on a coordinate measuring machine using genetic algorithms , 1998 .

[9]  Zone-Ching Lin,et al.  Measuring-sequence planning by the nearest neighbour method and the refinement method , 1997 .

[10]  Jaber Abu Qudeiri,et al.  Optimization of Operation Sequence in CNC Machine Tools Using Genetic Algorithm , 2007 .

[11]  Yueh-Jaw Lin,et al.  CAD-based CMM dimensional inspection path planning - a generic algorithm , 2001, Robotica.

[12]  W. Banzhaf,et al.  The “molecular” traveling salesman , 1990, Biological Cybernetics.

[13]  Xiaogang Ji,et al.  ACO-Based multiple geometric elements measure path planning for CMM , 2010, 2010 International Conference on Computer Application and System Modeling (ICCASM 2010).

[14]  E. Kodeekha,et al.  Brute Force Method for Lot Streaming in FMS Scheduling Problems , 2007, 2007 11th International Conference on Intelligent Engineering Systems.

[15]  Chetan Chauhan,et al.  Survey of Methods of Solving TSP along with its Implementation using Dynamic Programming Approach , 2012 .

[16]  Jun Ni,et al.  An Algorithm for the Generation of an Optimum CMM Inspection Path , 1994 .

[17]  Richard W. Eglese,et al.  Simulated annealing: A tool for operational research , 1990 .

[18]  James E. Baker,et al.  Adaptive Selection Methods for Genetic Algorithms , 1985, International Conference on Genetic Algorithms.

[19]  L. C. Stayton,et al.  On the effectiveness of crossover in simulated evolutionary optimization. , 1994, Bio Systems.

[20]  Devendra P. Garg,et al.  Optimization techniques applied to multiple manipulators for path planning and torque minimization , 2002 .

[21]  Necmettin Kaya,et al.  Machining fixture locating and clamping position optimization using genetic algorithms , 2006, Comput. Ind..

[22]  José Ignacio Hidalgo,et al.  A hybrid heuristic for the traveling salesman problem , 2001, IEEE Trans. Evol. Comput..

[23]  Franci Cus,et al.  Optimization of cutting process by GA approach , 2003 .

[24]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[25]  Lawrence Davis,et al.  Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.

[26]  Zehui Shao,et al.  An Effective Simulated Annealing Algorithm for Solving the Traveling Salesman Problem , 2009 .