Abstract
Sculptured-dies Cavity Roughing (SDCR) problem is a multi-dimensional problem. In XY-single cutter problem, the decision variables consist of layering and tooling selection problem by maximizing the efficiency of roughing, which consider finishing efficiency. The previous research approach to this problem shows that the dynamic programming approach. However, it is effective in searching solutions for the time-to-volume coefficient minimization (TVC) problem, and empirically shows 10% improvement compared to machining time minimization objective. The pre-processing procedures in dynamic programming approach are quite complex time-consuming. Applying a genetic algorithm procedure for the multi-dimensional problem (GAMD) guarantees the merging process's feasibility, these pre-processing procedures can be eliminated, and significantly faster computational time. In the 7-3-3 problem chosen in this research, the computational time is reduced from about 2 hours to 30 seconds.
Sign-in/Register to access full text options 
Free) 
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 call
