2000
DOI: 10.1080/002077200291488
|View full text |Cite
|
Sign up to set email alerts
|

A combined genetic algorithms-shooting method approach to solving optimal control problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
16
0

Year Published

2003
2003
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 26 publications
(16 citation statements)
references
References 0 publications
0
16
0
Order By: Relevance
“…On the other aspect, GA can be distinguished from calculus-based and enumerative methods for optimization by the following characteristics [22,23,24,25,26,27,28]:…”
Section: Steps Of Cga Techniquementioning
confidence: 99%
“…On the other aspect, GA can be distinguished from calculus-based and enumerative methods for optimization by the following characteristics [22,23,24,25,26,27,28]:…”
Section: Steps Of Cga Techniquementioning
confidence: 99%
“…They don't really need good initial guesses and deterministic rules. Some of these methods are; Genetic algorithm (GA), see [1,23,24], Genetic programming (GP), see [18], Particle swarm optimization (PSO), see [3,4,21], Ant colony optimization (ACO), see [27] and Differential evolution (DE), see [8,19,28]. Many authors proposed many types of metaheuristics for solving NOCPs.…”
Section: Introductionmentioning
confidence: 99%
“…Lee et al [19] used a modified DE algorithm for dynamic optimization of a continuous polymer reactor. Sim et al [24] combined a GA and the shooting method for solving NOCP. Cruz et al [8] used efficient DE algorithms for solving multi-modal NOCPs.…”
Section: Introductionmentioning
confidence: 99%
“…On the other hand, dynamic optimization [6][7][8] computes the controls, the state, and possibly the final time that minimize a cost function, subject to state equations and to various other constraints, as required by the problem at hand. There are basically two alternative strategies for the numerical solution of a dynamic optimization problem.…”
Section: Introductionmentioning
confidence: 99%
“…Then the problem is reduced to a TPBVP (twopoint boundary value problem) in the infinite dimension and a suitable MSM (multiple-shooting method) can be used to resolve it in the finite dimension. [8][9][10] The second is the direct method, 6,7) which uses the discretized or parameterized equation for state equations, constraint equations and a cost function in the finite dimension. The result becomes a nonlinear programming problem which can be solved by one of the efficient NLP (non-linear programming) methods.…”
Section: Introductionmentioning
confidence: 99%