New approach for robust multi-objective optimization of turning parameters using probabilistic genetic algorithm. Issue 5 (March 2016)

• Record Type: Journal Article
• Authors: Sahali, M.; Belaidi, I.; Serra, R.
• Is Part Of: International journal of advanced manufacturing technology. Volume 83:Issue 5/8(2016)
• Page Start: 1265
• Page End: 1279
• Publication Date: 2016-03
• Subjects: Failure probability -- Monte Carlo simulations -- Pareto optimal solutions -- Optimization -- NSGA-II -- Reliable machining parameters; Manufacturing processes -- Periodicals; Production engineering -- Periodicals; 670.427
• DOI: 10.1007/s00170-015-7526-z
• Languages: English
• ISSNs: 0268-3768

Abstract

Abstract In this paper, a contribution to the determination of reliable cutting parameters is presented, which is minimizing the expected machining cost and maximizing the expected production rate, with taking into account the uncertainties of uncontrollable factors. The concept of failure probability of stochastic production limitations is integrated into constrained and unconstrained formulations of multi-objective optimization problems. New probabilistic version of the nondominated sorting genetic algorithm P-NSGA-II, which incorporates the Monte Carlo simulations for accurate assessment of cumulative distribution functions, was developed and applied in two numerical examples based on similar and anterior work. In the first case, it is a question of the search space that is completely 'closed' by high natural variability related to the multi-pass roughing operation: in this case, the failure risk of technological limitations are considered as objectives to minimize with economic objectives. The second case is related to deformed search space due to the uncertainties specific to finishing operation; therefore, the economic objectives are minimized under imposed maximum probabilities of failure. In both situations, the efficiency and robustness of optimal solutions generated by the P-NSGA-II algorithm are analysed, discussed and compared with sequence of unconstrained minimization technique (SUMT) method.