Skip navigation


Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/2870
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDalavi, A. M.-
dc.contributor.authorPawar, P. J.-
dc.contributor.authorSingh, T. P.-
dc.date.accessioned2020-12-12T10:56:31Z-
dc.date.available2020-12-12T10:56:31Z-
dc.date.issued2015-06-17-
dc.identifier.urihttp://192.168.3.232:8080/jspui/handle/123456789/2870-
dc.description.abstractOptimization of hole-making operations plays a crucial role in which tool travel and tool switch scheduling are the two major issues. Industrial applications such as moulds, dies, engine block etc. consist of large number of holes having different diameters, depths and surface finish. This results into to a large number of machining operations like drilling, reaming or tapping to achieve the final size of individual hole. Optimal sequence of operations and associated cutting speeds, which reduce the overall processing cost of these hole-making operations are essential to reach desirable products. In order to achieve this, an attempt is made by developing an effective methodology. An example of the injection mould is considered to demonstrate the proposed approach. The optimization of this example is carried out using recently developed particle swarm optimization (PSO) algorithm. The results obtained using PSO are compared with those obtained using tabu search method. It is observed that results obtained using PSO are slightly better than those obtained using tabu search method.en_US
dc.subjectHole-making operationsen_US
dc.subjectParticle swarm optimizationen_US
dc.subjectInjection moulden_US
dc.titleOptimization of hole-making operations for injection mould using particle swarm optimization algorithmen_US
Appears in Collections:production

Files in This Item:
File Description SizeFormat 
Optimization of hole-making operations for injection mould using particle swarm.pdf293.71 kBUnknownView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.