2012
DOI: 10.1007/978-3-642-31125-3_48
|View full text |Cite
|
Sign up to set email alerts
|

Comparison between Genetic Algorithms and Differential Evolution for Solving the History Matching Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(6 citation statements)
references
References 7 publications
0
6
0
Order By: Relevance
“…We will use a differential evolution (DE) algorithm to achieve Multi-Objectives optimization of cost, response time and SLA violation. Using a DE algorithm will provide better outcomes than the genetic algorithm (GA) (CDOXplorer) [5] that used the same CloudMIG tool of cloud migration optimization for many reasons; DE is more efficient than GA in exploring the decision space of Multi-Objectives optimization [34] , [35], and DE offers more accuracy and stability and better convergence speed than GA for solving various optimization problems of applications [36], [37].…”
Section: The Proposed Frameworkmentioning
confidence: 98%
“…We will use a differential evolution (DE) algorithm to achieve Multi-Objectives optimization of cost, response time and SLA violation. Using a DE algorithm will provide better outcomes than the genetic algorithm (GA) (CDOXplorer) [5] that used the same CloudMIG tool of cloud migration optimization for many reasons; DE is more efficient than GA in exploring the decision space of Multi-Objectives optimization [34] , [35], and DE offers more accuracy and stability and better convergence speed than GA for solving various optimization problems of applications [36], [37].…”
Section: The Proposed Frameworkmentioning
confidence: 98%
“…DE performs the mutation by creating a mutant vector of three randomly selected vectors and performs the crossover by creating a trial vector of the mutant vector and target vector [118]. Then, the fitness of the trial and target vectors is evaluated, and the best is kept for the next generation [119]. In DE, the selection of the parent solution is not based on fitness.…”
Section: Optimizationmentioning
confidence: 99%
“…It has some distinguishing properties like simple structure, speed, ease of use, and robustness [34]. Differential evolution mainly relies on mutation while GAs rely on both crossover and mutation [35,36].…”
Section: Problem Formulationmentioning
confidence: 99%