Optimization of the Turning Process

What is it about?

In this paper, we realize a comparative study between some heuristics methods applied in turning operation in order to find optimal cutting parameters. We consider five different constraints aimed to achieve minimum total cost of machining. We have chosen the Simulated Annealing (SA) – a local search method, and Weighted-Sum Genetic Algorithm (WSGA) – a non-Pareto approach of a multi-objective optimization algorithm, based on a weighted aggregation of objectives. The aggregation may be with fixed weights or with random (variable) weights. The simulations showed that, even if it produces better results than the SA, WSGA with fixed weights, does not lead to optimum results, highlighting in this way that in the formula of the cost function, some cost components may be more important than others. In addition, we extend our previous work by integrating in the software application a new optimization method: WSGA with random weights. Also, we increase the application’s flexibility by reconfiguring the graphical user interface in order to allow tuning the optimization techniques parameters.

Featured Image