2009 IEEE Workshop on Hybrid Intelligent Models and Applications 2009
DOI: 10.1109/hima.2009.4937826
|View full text |Cite
|
Sign up to set email alerts
|

Parameterless penalty function for solving constrained evolutionary optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2010
2010
2016
2016

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 14 publications
(8 citation statements)
references
References 14 publications
0
8
0
Order By: Relevance
“…4) Figures( 1, 2, 3) are drawn for groups 1, 2, and 3, respectively. Figures ( 4,5,6,7,8,9) provide the Average Makespan and Flowtime values for groups 1, 2, and 3, respectively.…”
Section: Simulation Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…4) Figures( 1, 2, 3) are drawn for groups 1, 2, and 3, respectively. Figures ( 4,5,6,7,8,9) provide the Average Makespan and Flowtime values for groups 1, 2, and 3, respectively.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…Evolutionary process is accomplished by applying Rankbased Roulette Wheel Selection (RRWS) [7], [8], [2], [3], Crossover and Mutation Operators from one generation to the next, and Selection Operator which determines how many and which individuals will be kept in the next generation. Crossover Operator controls how to exchange genes between individuals, while the Mutation Operator allows for random gene alteration of an individual.…”
Section: Evolutionary Processmentioning
confidence: 99%
“…The method adaptively updates different penalty parameter for each constraint. Some extensions and applications of penalty parameter less approach can be found in Liao (2010), Manoharan et al (2008), Jadaan et al (2009) and Jan and Khanum (2012).…”
Section: Related Studiesmentioning
confidence: 97%
“…There are generally two approaches for solving multi‐objective optimization problems: one is to convert the optimization problem into a single‐objective optimization using multi‐criteria decision‐making methods, and then the mature single‐ objective evolutionary algorithm (SOEA) is used to solve the optimization model. The other is a multi‐objective evolutionary algorithm (MOEA) such as the non‐dominated sorting genetic algorithm‐II (NSGA‐II), multi‐objective particle swarm optimization (MOPSO), or others, which are directly used to find a set of optimal solutions …”
Section: Optimization Model For Integrated Production Processmentioning
confidence: 99%