i-manager Publications

Optimization of Tool Travel Path in A Multiple Holes Cutting Process By Genetic Algorithm

Neeraj Sharma*, Rahul Dev Gupta**, Nirmal Kumar***

* Assistant Professor, Department of Mechanical Engineering, R.P. Inderaprastha Institute of Technology, Karnal, India.

** Associate Professor, Department of Mechanical Engineering, Maharishi Markandeshwar Engineering College, Mullana, India.

*** Assistant Professor, Department of Mechanical Engineering, N.G.I., Karnal, Haryana, India.

Periodicity:November - January'2013
DOI : https://doi.org/10.26634/jme.3.1.2085

Abstract

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.

Keywords

Optimization, Genetic algorithm, Travelling Salesman problem.

How to Cite this Article?

Sharma, N., Gupta, R. D., & Kumar, N. (2013). Optimization of Tool Travel Path in A Multiple Holes Cutting Process By Genetic Algorithm..i-manager's Journal on Mechanical Engineering, 3(1), 30-36. https://doi.org/10.26634/jme.3.1.2085

References

[1]. Dantzig, G., Fulkerson, R., & Johnson, S. (1954). Solution of a large traveling-salesman problem. Journal of the Operations Research Society of America, 2 (4), 393-410.

[2]. Taha, H.A. (1998). Operation Research- An introduction, Prentice Hall, Upper Saddle River, New Jersey.

[3]. Rahbary, M.A. (2006). A minimum route for machine tool travel. Scientia iranica, 13(1), 83-90.

[4]. Oysu, C. & Bingul, Z. (2009). Application of heuristic & hybrid – GASA algorithm to tool- path optimization problem for minimizing air time during machining. Engineering applications of artificial intelligence, 22, 389-396.

[5]. Khan, W.A., Hayhurst, D.R. & Cannings, C. (1999). Determination of optimal path under approach & exit constraints. European Journal of operation research, 117, 310-325.

[6]. Fiechter, C.N. (1994). A parallel tabu search algorithm for large travelling salesman problems. Discrete Applied Mathematics, 51, 243- 267.

[7]. Fred, F. C., Mohebbi, E. & Khoo, H. (2006). A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times. European Journal of Operational Research, 175 (1), 318-337.

[8]. Kolahan, F. & Liang, M. (2000), Optimization of hole-making operations: a tabu-search approach. International Journal of Machine Tools & Manufacture, 40, 1735–1753.

[9]. Thamilselvan, R. & Balasubramanie, P. (2011). Analysis of various alternate crossover strategies for genetic algorithm to solve job shop scheduling problems. European Journal Sci. Res., 64, 538-554.

[10]. Fisher, M. L., Nemhauser, G. L. & Wolsey, L. A. (1979). An analysis of approximations for finding a maximum weight hamiltonian circuit. Operations Research, 27(4), 799–809.

[11]. Kosaraju, R., Park, J. & Stein, C. (1994). Long tours and short superstrings. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 166–177.

[12]. Lee, D.T., Yang, C.D. & Wong, C.K. (1996). Rectilinear paths among rectilinear obstacles. Discrete Applied Mathematics, 70 (3), 185-215.

[13]. Goldberg, D. (1989), Genetic algorithms in search, optimization, and machine learning. Addison-Wesley: Reading, MA.

[14]. Holland, John H. (1975). Adaptation in Natural and Artificial Systems, Ann Arbor, Univ. Michigan Press.

Optimization of Tool Travel Path in A Multiple Holes Cutting Process By Genetic Algorithm

Abstract

Keywords

How to Cite this Article?

References

If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Options for accessing this content:

	North Americas,UK, Middle East,Europe		India	Rest of world
	USD	EUR	INR	USD-ROW
Pdf	35	35	200	20
Online	35	35	200	15
Pdf & Online	35	35	400	25