Minimization of Non-Productive Time during 2.5D Milling

Authors: Satish Kumar, Arun Kumar Gupta, Pankaj Chandna

Abstract:

In the modern manufacturing systems, the use of thermal cutting techniques using oxyfuel, plasma and laser have become indispensable for the shape forming of high quality complex components; however, the conventional chip removal production techniques still have its widespread space in the manufacturing industry. Both these types of machining operations require the positioning of end effector tool at the edge where the cutting process commences. This repositioning of the cutting tool in every machining operation is repeated several times and is termed as non-productive time or airtime motion. Minimization of this non-productive machining time plays an important role in mass production with high speed machining. As, the tool moves from one region to the other by rapid movement and visits a meticulous region once in the whole operation, hence the non-productive time can be minimized by synchronizing the tool movements. In this work, this problem is being formulated as a general travelling salesman problem (TSP) and a genetic algorithm approach has been applied to solve the same. For improving the efficiency of the algorithm, the GA has been hybridized with a noble special heuristic and simulating annealing (SA). In the present work a novel heuristic in the combination of GA has been developed for synchronization of toolpath movements during repositioning of the tool. A comparative analysis of new Meta heuristic techniques with simple genetic algorithm has been performed. The proposed metaheuristic approach shows better performance than simple genetic algorithm for minimization of nonproductive toolpath length. Also, the results obtained with the help of hybrid simulated annealing genetic algorithm (HSAGA) are also found better than the results using simple genetic algorithm only.

Keywords: Non-productive time, Airtime, 2.5 D milling, Laser cutting, Metaheuristic, Genetic Algorithm, Simulated Annealing.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1096011

References:

[1] A. K. Gupta, P. Chandna and P. Tandon "Hybrid genetic algorithm for minimizing non productive machining time” International Journal of Engineering, Science and Technology” vol. 3, no. 1, pp. 183-190, 2011.
[2] C. Oysu, Z. Bingul, "Application of heuristic and hybrid-GASA algorithms to tool-path optimization problem for minimizing airtime during machining,” Engineering Applications of Artificial Intelligence, vol. 22, pp.389–396, 2009.
[3] D. E. Goldberg, "Genetic algorithm in search, optimization & machining” Pearsons Publication, 2008.
[4] F. Kolahan and M. Liang, "Optimization of hole-making operations: a tabu- search approach”, International Journal of Machine Tools & Manufacture, vol. 40, no. 12, , pp. 1735–1753, 2000.
[5] H. K. Tsai, J. M. Yang, Y.F. Tsai and C. Y. Kao, "An Evolutionary Algorithm for Large Traveling Salesman Problems”, IEEE Transactions on Systems, Man, and Cybernetics, Part B, vol. 34, no. 4, pp. 1718-1729, 2004.
[6] H. Ghaiebi and M. Solimanpur, "An ant algorithm for Optimization of hole-making operations”. Computers & Industrial Engineering, vol. 52, pp. 308–319, 2007.
[7] K. Castelino, R. D’Souza and P. K. Wright. "Tool-path Optimization for Minimizing Airtime during Machining”, Journal of Manufacturing Systems, vol. 22, no. 3, pp. 173-180, 2003.
[8] M. Dorigo, V. Maniezzo and A. Colorni, "The Ant System: Optimization by a colony of cooperating agents” IEEE Transactions on Systems, Man, and Cybernetics–Part B, vol. 26, no. 1, pp.1-13, 1996.
[9] M. Dorigo and L. M. Gambardella, "Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem”, IEEE Transactions on Evolutionary Computation, vol. 1, pp. 308 – 313, 1997.
[10] N. L. J. Ulder, E. H. L. Aarts, H.J. Bandelt, P. J. M. V. Laarhoven, and E. Pesch, "Genetic local search algorithms for the traveling salesman problem”, Lecture Notes in Computer Science, vol. 496, pp.109-111.1991.
[11] Nawaz, Muhammad Enscore Jr, E Emory Ham and Inyong, "A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem,” International Journal of Management Sciences, Vol. 11 No.1, pp. 91-95, 1983.
[12] P. Jog, J. Y. Suh, ” Parallel genetic algorithms applied to the Traveling Salesman Problem”, SIAM Journal of Optimization, vol. 1, pp. 515– 529, 1991.
[13] P. Wu, Sreekanth Reddy, Jianlin Zeng and Changming Liu, "Airtime based packet scheduling for wireless networks”, United State Patent pat., no. 8,483,194, 2014.
[14] R. D’Souza, P. Wright and C. Skquin, "Automated Micro planning for 2.5-D Pocket Machining”, Journal of Manufacturing Systems, vol. 20, no. 4, pp. 288–296. 2001.
[15] R. Phipon and B.B. Pradhan"Process parameters optimisation of CNC drilling operation using genetic algorithm,” International Journal of Machining and Machinability of Materials, vol. 12, no. 1, pp. 54-65, 2012.
[16] S. Kirkpatrick, C. D. Gelatt Jr. and M. P. Vecchi, "Optimization by Simulated Annealing”, Science is currently published by American Association for the Advancement of Science, vol. 220, no. 4598, pp. 671 – 680, 1983.
[17] W.A. Khan, D.R. Hayhurst and C. Cannings, "Determination of optimal path under approach and exit constraints”. European Journal of Operational Research, vol. 117, no. 2, pp. 310-325, 1999.
[18] Y. Wang & J. Qin, "A memetic-clustering-based evolution strategy for traveling salesman problems”, Proceedings of the 2nd international conference on Rough sets and knowledge technology, 2007.