2005
DOI: 10.1016/j.cam.2004.07.034
|View full text |Cite
|
Sign up to set email alerts
|

Genetic algorithms for modelling and optimisation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
390
0
16

Year Published

2008
2008
2022
2022

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 835 publications
(406 citation statements)
references
References 14 publications
0
390
0
16
Order By: Relevance
“…It is difficult to obtain the analytical solution for α 2 , so the optimization algorithm should be employed to compute the optimum solution of α 2 . We use the Standard Genetic Algorithm (SGA) [54] to compute the optimum solution. The objective function of SGA is written as: …”
Section: Continuous Mathematical Model Of the Whitecap Coverage Functmentioning
confidence: 99%
“…It is difficult to obtain the analytical solution for α 2 , so the optimization algorithm should be employed to compute the optimum solution of α 2 . We use the Standard Genetic Algorithm (SGA) [54] to compute the optimum solution. The objective function of SGA is written as: …”
Section: Continuous Mathematical Model Of the Whitecap Coverage Functmentioning
confidence: 99%
“…John Holland and other people in the United States at the university of Michigan, in order to simulate biological evolution of Darwin, designed a optimization algorithm in 1975 [10] , called Genetic Algorithm (GA), but it was easy to fall into the "premature". This article describes improved Genetic Algorithm, in order to avoid genetic algorithm to fall into "premature", by modifying the cross of Genetic Algorithm.…”
Section: Improved Genetic Optimization Bp-nn Algorithm Designmentioning
confidence: 99%
“…Costa & Oliveira (2001) addressed that evolution strategies such as GA, SAA and ES are emerging as the best algorithm for MNIP problems. Mccall (2005) stated that one of the most attractive features of the GA is its flexibility on handling various objective functions with fewer requirements for fine mathematical properties. Taking into account the above concerns, GA based heuristics is proposed to evolve optimal or near optimal transaction quantity 'x ijopt ' (for ∀i, ∀j) for maximum channel profit to the MV_MBO model.…”
Section: Ga Based Heuristics For Mv_mbomentioning
confidence: 99%