Novel algorithmic approach to generate the ‘number of passes’ and ‘depth of cuts’ for the optimisation routines of multipass machining

A novel heuristic algorithm is proposed to generate feasible neighbouring solutions for the ‘number of passes’ and ‘depth of cuts’ variables in optimizing the cutting conditions in multipass machining. The problem is probably the most important step in developing effective optimization algorithms for multipass machining. Previous approaches to the problem are not very effective. The problem has remained a bottleneck in developing effective multipass optimization routines. The research here proposes a heuristic algorithm that can be integrated into machining optimization routines to overcome the problem. The proposed heuristic is explained in detail along with several examples. Integration of the proposed heuristic into a simulated annealing algorithm that optimizes cutting conditions for turning is also shown, along with an example problem.