JME_V3_N1_RP4 Neeraj Sharma R.D. Gupta Nirmal Kumar Journal on Mechanical Engineering 2249 - 0744 3 1 30 36 Optimization, Genetic Algorithm, Travelling Salesman Problem To economize cutting process used in component manufacturing number of procedures are used. Typical parameters which are optimized are feed rate, spindle speed, depth of cut, machining time etc. Almost no consideration is given to non-productive machining time, which is an important parameter on modern computer numerical control machine tools. Its importance is further augmented in the area of numerically controlled cutting where surface area to thickness ratio is high. The problem is formulated as a large scale traveling salesman problem (TSP). The stochastic search procedure genetic algorithm is used to solve these instances of TSP. This solution allows the optimization of non-productive movement thus reducing the cycle time and increasing the productivity of the process. November 2012 - January 2013 Copyright © 2013 i-manager publications. All rights reserved. i-manager Publications http://www.imanagerpublications.com/Article.aspx?ArticleId=2085