Article ID: | iaor20001529 |
Country: | United Kingdom |
Volume: | 37 |
Issue: | 5 |
Start Page Number: | 1063 |
End Page Number: | 1074 |
Publication Date: | Jan 1999 |
Journal: | International Journal of Production Research |
Authors: | Narendran T.T., Bhaskara Reddy S.V., Shunmugam M.S. |
Keywords: | genetic algorithms |
Computer aided process planning is an important interface between computer aided design and computer aided manufacturing in computer integrated manufacturing. Operation sequencing in process planning is concerned with the selection of machining operations in steps that can produce each form feature of the part by satisfying relevant technological constraints specified in the part drawing. A single sequence of operations may not be the best for all the situations in a changing production environment with multiple objectives such as minimizing number of set-ups, maximizing machine utilization and minimizing number of tool changes. This paper demonstrates the application of genetic algorithms as a global search technique for a quick identification of optimal or near optimal operation sequences in a dynamic planning environment. A novel initialization scheme for representing the genetic code and a new crossover operator are designed to retain the local operation precedence for each form feature. Since sequences can be obtained quickly, this approach can actually be used by the process planner to generate alternative feasible sequences for the prevailing operating environment.