Abstract
Path planning (PP) is fundamental in the decision-making and control processes of computer numerical control (CNC) machines, playing a critical role in smart manufacturing research. Apart from improving optimization in PP, enhancing efficiency while decreasing CNC machine cycle time is important in manufacturing. Many methods have been offered in the literature to improve the cycle time for obtaining optimal trajectories in toolpath optimization, but these methods are mostly considered for improvements in path length or machining time in optimal PP. This study demonstrates a method for creating a smoothing path. It aims to minimize both cycle time and toolpath length, while demonstrating that the non-dominated sorting genetic algorithm (NSGA-II) is efficient in addressing the multi-objective PP problems within static situations. Pareto optimality for performance comparisons with multi-objective genetic algorithms (MOGAs) is presented in order to highlight the positive features of the non-dominant solving generated by the NSGA-II. According to the comprehensive analysis results, the optimization of the path carried out with the NSGA-II emphasizes its shorter and smoother attributes, with the optimal trajectory achieving approximately 30% and 7% reductions in path length and machining cycle time, respectively.