Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/11252
Title: OPERATION SEQUENCING OF MACHINED PARTS USING ANT COLONY ALGORITHM
Authors: Gupta, Vivek Kumar
Keywords: MECHANICAL INDUSTRIAL ENGINEERING
OPERATION SEQUENCING
MACHINED PARTS
ANT COLONY ALGORITHM
Issue Date: 2005
Abstract: A computer-aided process planning system should ideally generate and optimize' process plans to ensure the application of good manufacturing practices and maintain the consistency of the desired functional specifications of a part during its production processes. Crucial processes,. such as selecting machining resources, determining set-up plans and sequencing operations of a part should be considered simultaneously to achieve global optimal solutions. In this work, these processes are integrated and modeled as a constraint-based optimization problem, which is similar to the traveling salesman problem (TSP), and an ant colony-based approach is proposed to solve it effectively. The aggregate sum of machine change over cost, set-up configuration change over cost and tool change over cost is incorporated into the 'distance' between operations. Precedence constraints from the geometric and manufacturing interactions between features and their related operations in a part are treated as constraints. The evaluation criterion of machining cost comes from the combined strengths of machine costs, cutting tool costs, machine change over cost, set-up change over cost and tool change over cost. Case studies from the literature are taken to illustrate the proposed algorithm and the results have been compared with the published results. Reported results indicate that ant colony technique is more effective than the other techniques on quality and computational time basi
URI: http://hdl.handle.net/123456789/11252
Other Identifiers: M.Tech
Appears in Collections:MASTERS' DISSERTATIONS (MIED)

Files in This Item:
File Description SizeFormat 
MIEDG12450.pdf3.84 MBAdobe PDFView/Open


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