Please use this identifier to cite or link to this item:
|dc.title||A simulated annealing-based optimization algorithm for process planning|
|dc.identifier.citation||Ma, G.H., Zhang, Y.F., Nee, A.Y.C. (2000-08-15). A simulated annealing-based optimization algorithm for process planning. International Journal of Production Research 38 (12) : 2671-2687. ScholarBank@NUS Repository. https://doi.org/10.1080/002075400411420|
|dc.description.abstract||Computer-aided process planning (CAPP) in the past typically employed knowledge-based approaches, which are only capable of generating a feasible plan for a given part based on invariable machining resources. In the field of concurrent engineering, there is a great need for process planning optimization. This paper describes an approach that models the constraints of process planning problems in a concurrent manner. It is able to generate the entire solution space by considering multiple planning tasks, i.e. operations (machine, tool and tool approach direction), selection and operations sequencing simultaneously. Precedence relationships among all the operations required for a given part are used as the constraints for the solution space. The relationship between an actual sequence and the feasibility of applying an operation is also considered. An algorithm based on simulated annealing (SA) has been developed to search for the optimal solution. Several cost factors including machine cost, tool cost, machine change cost, tool change cost and set-up change cost can be used flexibly as the objective function. The case study shows that the algorithm can generate highly satisfying results.|
|dc.contributor.department||MECHANICAL & PRODUCTION ENGINEERING|
|dc.description.sourcetitle||International Journal of Production Research|
|Appears in Collections:||Staff Publications|
Show simple item record
Files in This Item:
There are no files associated with this item.
checked on Nov 27, 2021
WEB OF SCIENCETM
checked on Sep 29, 2021
checked on Dec 2, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.