Multi-objective optimization of surface grinding process with the use of evolutionary algorithm with remembered Pareto set

2007 ◽  
Vol 37 (7-8) ◽  
pp. 657-669 ◽  
Author(s):  
A. Slowik ◽  
J. Slowik
Keyword(s):  
Evolutionary Algorithm ◽  
Pareto Set ◽  
Surface Grinding ◽  
Grinding Process ◽  
Multi Objective Optimization ◽  
Multi Objective

scholarly journals COMBINATION OF TAGUCHI METHOD, MOORA AND COPRAS TECHNIQUES IN MULTI-OBJECTIVE OPTIMIZATION OF SURFACE GRINDING PROCESS

2020 ◽  
pp. 1-9
Author(s):  
Do Duc Trung
Keyword(s):  
Surface Roughness ◽  
Material Removal Rate ◽  
Material Removal ◽  
Optimization Problem ◽  
Removal Rate ◽  
Optimization Techniques ◽  
Surface Grinding ◽  
Grinding Process ◽  
Multi Objective Optimization ◽  
Multi Objective

This study presentes a combination method of several optimization techniques and Taguchi method to solve the multi-objective optimization problem for surface grinding process of SKD11 steel. The optimization techniques that were used in this study were Multi-Objective Optimization on basis of Ratio Analysis (MOORA) and Complex Proportional Assessment (COPRAS). In surface grinding process, two parameters that were chosen as the evaluation creterias were surface roughness (Ra) and material removal rate (MRR). The orthogonal Taguchi L16 matrix was chosen to design the experimental matrix with two input parameters namely workpiece velocity and depth of cut.  The two optimization techniques that mentioned above were applied to solve the multi-objective optimization problem in the grinding process. Using two above techniques, the optimized results of the cutting parameters were the same. The optimal workpiece velocity and cutting depth were 20 m/min and 0.02 mm. Corresponding to these optimal values of the workpiece velocity and cutting depth, the surface roughness and material removal rate were 1.16 µm and 86.67 mm3/s. These proposed techniques and method can be used to improve the quality and effectiveness of grinding processes by reducing the surface roughness and increasing the material removal rate.

Synchronous R-NSGA-II: An Extended Preference-Based Evolutionary Algorithm for Multi-Objective Optimization

Informatica ◽  
2015 ◽  
Vol 26 (1) ◽  
pp. 33-50 ◽  
Author(s):  
Ernestas Filatovas ◽  
Olga Kurasova ◽  
Karthik Sindhya
Keyword(s):  
Evolutionary Algorithm ◽  
Multi Objective Optimization ◽  
Nsga Ii ◽  
Multi Objective

Pareto Set as a Model for Dispatching Resources in Emergency Centres (Preprint)

2018 ◽  
Author(s):  
Ricardo Guedes ◽  
Vasco Furtado ◽  
Tarcísio Pequeno ◽  
Joel Rodrigues
Keyword(s):  
Operational Research ◽  
Real Data ◽  
Pareto Set ◽  
Multi Objective Optimization ◽  
Pareto Dominance ◽  
Four Dimensions ◽  
Multi Objective ◽  
The Best Approximation ◽  
One Year ◽  
The Cost

UNSTRUCTURED The article investigates policies for helping emergency-centre authorities for dispatching resources aimed at reducing goals such as response time, the number of unattended calls, the attending of priority calls, and the cost of displacement of vehicles. Pareto Set is shown to be the appropriated way to support the representation of policies of dispatch since it naturally fits the challenges of multi-objective optimization. By means of the concept of Pareto dominance a set with objectives may be ordered in a way that guides the dispatch of resources. Instead of manually trying to identify the best dispatching strategy, a multi-objective evolutionary algorithm coupled with an Emergency Call Simulator uncovers automatically the best approximation of the optimal Pareto Set that would be the responsible for indicating the importance of each objective and consequently the order of attendance of the calls. The scenario of validation is a big metropolis in Brazil using one-year of real data from 911 calls. Comparisons with traditional policies proposed in the literature are done as well as other innovative policies inspired from different domains as computer science and operational research. The results show that strategy of ranking the calls from a Pareto Set discovered by the evolutionary method is a good option because it has the second best (lowest) waiting time, serves almost 100% of priority calls, is the second most economical, and is the second in attendance of calls. That is to say, it is a strategy in which the four dimensions are considered without major impairment to any of them.

Sign in / Sign up

Export Citation Format

Share Document