2012
DOI: 10.1016/j.ejor.2011.11.028
|View full text |Cite
|
Sign up to set email alerts
|

Multi-objective optimization for stochastic computer networks using NSGA-II and TOPSIS

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
30
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 83 publications
(30 citation statements)
references
References 30 publications
0
30
0
Order By: Relevance
“…NSGA-II has a fast non-dominated sorting approach, a fast crowded distance estimation procedure and a simple crowded comparison operator [32]. It is popular and reliable in various fields, such as in stochastic computer network optimization [34], and reactive power planning [33,35]. Algorithm 1 shows the operation framework of NSGA-II in the methodology.…”
Section: The Nsga-ii For Selecting the Most Suitable Sitementioning
confidence: 99%
See 1 more Smart Citation
“…NSGA-II has a fast non-dominated sorting approach, a fast crowded distance estimation procedure and a simple crowded comparison operator [32]. It is popular and reliable in various fields, such as in stochastic computer network optimization [34], and reactive power planning [33,35]. Algorithm 1 shows the operation framework of NSGA-II in the methodology.…”
Section: The Nsga-ii For Selecting the Most Suitable Sitementioning
confidence: 99%
“…Here, the NSGA-II is applied because of its superior computational capacity. The NSGA-II was initially proposed by Deb et al [32] and has been widely applied to various problems [33][34][35].…”
Section: Introductionmentioning
confidence: 99%
“…These features have made the NSGA-II very effective in solving the FJSP. In this paper, NSGA-II is used for solving this problem, as it has recently been applied to solve several different problems [10,19,27]. Another well-known MOEA, a modified version of the NSGA-II, is called non-dominated ranking genetic algorithm (NRGA) proposed by Al Jadaan et al [3].…”
Section: Introductionmentioning
confidence: 99%
“…It is now desired to find a trade-off optimum design point from all non-dominated threeobjective optimization processes with the compromising of all objective functions. This can be achieved by the nearest-to-ideal-point method and TOPSIS method (Atashkari et al, 2007) and (Lin and Yeh, 2012).…”
Section: Multi-objective Optimizationmentioning
confidence: 99%