2008 First International Conference on Emerging Trends in Engineering and Technology 2008
DOI: 10.1109/icetet.2008.139
|View full text |Cite
|
Sign up to set email alerts
|

Multi-Objective Optimization of Surface Grinding Process Using NSGA II

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
13
0

Year Published

2009
2009
2024
2024

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 21 publications
(13 citation statements)
references
References 8 publications
0
13
0
Order By: Relevance
“…Researchers had already solved the multiobjective optimization problems in machining processes using well-known posteriori approaches such as NSGA, NSGA-II, MOGA, and MODE (Mitra and Gopinath 2004;Kuriakose and Shunmugam 2005;Konak et al 2006;Mandal et al 2007;Kodali et al 2008;Kanagarajan et al 2008;Palanikumar et al 2009;Datta and Deb 2009;Yang and Natarajan 2010;Senthilkumar et al 2010Senthilkumar et al , 2011Joshi and Pande 2011;Mitra 2009;Acharya et al 2013). However, these algorithms require tuning of algorithm-specific parameters and improper tuning of algorithm-specific parameters may lead to non-Pareto optimal solutions.…”
Section: Multiobjective Optimization Of Machining Processesmentioning
confidence: 99%
“…Researchers had already solved the multiobjective optimization problems in machining processes using well-known posteriori approaches such as NSGA, NSGA-II, MOGA, and MODE (Mitra and Gopinath 2004;Kuriakose and Shunmugam 2005;Konak et al 2006;Mandal et al 2007;Kodali et al 2008;Kanagarajan et al 2008;Palanikumar et al 2009;Datta and Deb 2009;Yang and Natarajan 2010;Senthilkumar et al 2010Senthilkumar et al , 2011Joshi and Pande 2011;Mitra 2009;Acharya et al 2013). However, these algorithms require tuning of algorithm-specific parameters and improper tuning of algorithm-specific parameters may lead to non-Pareto optimal solutions.…”
Section: Multiobjective Optimization Of Machining Processesmentioning
confidence: 99%
“…Kodali et al [24] and Jianling [20] used optimization technique of NSGA-II to simulate a number of test problems from previous studies. They claimed that the performance of this technique is better than Pareto-archived evolution strategy (PAES) and strength Pareto EA (SPEA) in terms of converging near the true Pareto-optimal set and finding a diverse set of solutions.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The thresholds for symmetry detection (see Table 4) are fixed for all the results shown in this paper. The NSGA-II [31] searches the parameter space to find an optimal segmentation, measured by both the symmetry evaluation (17) and the supervised or unsupervised segmentation evaluation ((13) or (11)). All the segmentations shown in experiments are optimized.…”
Section: The Symmetry Evaluationmentioning
confidence: 99%
“…It is formulated as a multi-objective optimization (MOP), which is the process of optimizing multiple objectives subject to certain constraints. We use Nondominated Sorting Genetic Algorithm (NSGA-II) [31], a multi-objective optimization algorithm to search for optimum matched segmentation parameters ( g and m ) by using measures of the objective functions of segmentation and symmetry (see Section 3.3). Our optimization problem (see Fig.…”
Section: Multi-objective Optimization For Segmentation and Symmetrymentioning
confidence: 99%