Tool path planning of hole-making operations in ejector plate of injection mould using modified shuffled frog leaping algorithm. Issue 3 (8th April 2016)

• Record Type: Journal Article
• Authors: Dalavi, Amol M.; Pawar, Padmakar J.; Singh, Tejinder Paul
• Is Part Of: Journal of computational design and engineering. Volume 3:Issue 3(2016)
• Page Start: 266
• Page End: 273
• Publication Date: 2016-04-08
• Subjects: Hole-making operations -- Shuffled frog leaping algorithm -- Modified shuffled frog leaping algorithm -- Injection mould -- Ejector plate; Engineering -- Data processing -- Periodicals; Computer-aided design -- Periodicals; Computer-aided design; Engineering -- Data processing; Electronic journals; Electronic journals; Periodicals; 620.0042
• DOI: 10.1016/j.jcde.2016.04.001
• Languages: English
• ISSNs: 2288-4300

Abstract

Abstract: Optimization of hole-making operations in manufacturing industry plays a vital role. Tool travel and tool switch planning are the two major issues in hole-making operations. Many industrial applications such as moulds, dies, engine block, automotive parts etc. requires machining of large number of holes. Large number of machining operations like drilling, enlargement or tapping/reaming are required to achieve the final size of individual hole, which gives rise to number of possible sequences to complete hole-making operations on the part depending upon the location of hole and tool sequence to be followed. It is necessary to find the optimal sequence of operations which minimizes the total processing cost of hole-making operations. In this work, therefore an attempt is made to reduce the total processing cost of hole-making operations by applying relatively new optimization algorithms known as shuffled frog leaping algorithm and proposed modified shuffled frog leaping algorithm for the determination of optimal sequence of hole-making operations. An industrial application example of ejector plate of injection mould is considered in this work to demonstrate the proposed approach. The obtained results by the shuffled frog leaping algorithm and proposed modified shuffled frog leaping algorithm are compared with each other. It is seen from the obtained results that the results of proposed modified shuffled frog leaping algorithm are superior to those obtained using shuffled frog leaping algorithm.