2015
DOI: 10.1016/j.jprocont.2015.01.001
|View full text |Cite
|
Sign up to set email alerts
|

Modified genetic algorithm using Box Complex method: Application to optimal control problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
7
1
1
1

Relationship

0
10

Authors

Journals

citations
Cited by 19 publications
(6 citation statements)
references
References 45 publications
0
6
0
Order By: Relevance
“…GAs are a family of popular heuristic optimization techniques that search the parameter space for the optimal solution of a problem in a manner inspired by Darwin's principle of natural selection (Holland, 1975). GAs have generally higher demands in CPU time compared to gradientbased algorithms, but they are capable of providing potentially global optimal solutions for complex functions (Patel and Padhiyar, 2015). The parameter vectors ( 1, , 2, 1, , 2, ) and ( 1, , 2, , 1, , 2, ) were bounded between 0-20 seconds and 0-3 seconds, respectively.…”
Section: Parameter Estimationmentioning
confidence: 99%
“…GAs are a family of popular heuristic optimization techniques that search the parameter space for the optimal solution of a problem in a manner inspired by Darwin's principle of natural selection (Holland, 1975). GAs have generally higher demands in CPU time compared to gradientbased algorithms, but they are capable of providing potentially global optimal solutions for complex functions (Patel and Padhiyar, 2015). The parameter vectors ( 1, , 2, 1, , 2, ) and ( 1, , 2, , 1, , 2, ) were bounded between 0-20 seconds and 0-3 seconds, respectively.…”
Section: Parameter Estimationmentioning
confidence: 99%
“…GAs are a family of popular heuristic optimization techniques that search the parameter space for the optimal solution of a problem in a manner inspired by Darwin's principle of natural selection (Holland, 1975). GAs have generally higher demands in CPU time compared to gradient-based algorithms, but 235 they are capable of providing potentially global optimal solutions for complex functions (Patel and Padhiyar, 2015). The parameters ( 1, , 2, 1, , 2, ) and ( 1, , 2, , 1, , 2, ) were bounded between 0-20 seconds and 0-3 seconds, respectively.…”
Section: Parameter Estimationmentioning
confidence: 99%
“…The GTSP has been widely studied, since it can be the model for many practical problems in industries such as flowshop scheduling and toolpath planning [22][23][24] . The optimization issue can be dealed with a genetic algorithm (GA) combined with some powerful algorithms for local searching [25][26][27] .…”
Section: Figure 1 Pictures Of Modernizing the Traditional Solar Greenmentioning
confidence: 99%