Abstract
For the problems in process routing optimization of Computer Aided Process Planning (CAPP) system, the major shortcomings in the previous were analyzed and corresponding means for improving were put forward. Process digraph, as an effective process routing decision-making model, was established based on precedence constraints among operations. An algorithm was designed to operate the process digraph and then a number of process plans all feasible were obtained for the initial population. In order to solve the problem that some infeasible process plans generating in evolutionary process, the repair method of infeasible process plan in the evolution process was proposed. A case study has been carried out to demonstrate the feasibility and efficiency of the proposed approach. Finally, conclusions and future work are summarized.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
