2017
DOI: 10.3844/ajassp.2017.945.954
|View full text |Cite
|
Sign up to set email alerts
|

Constrained Modified Genetic Algorithm for Optimizing RICE Climate Change Model Policy

Abstract: The objective of this paper is to use evolutionary algorithm for policy making to help in decision support, the Regional Integrated ClimateEconomy (RICE) model for the dynamic climate change is used to optimize the tradeoff policy between abating of carbon dioxide emissions to reduce global climate change and in the other hand the resulting in economic damages. A Constrained Genetic Algorithms (CGAs) is modified to search for near global optimal solutions the by searching climate optimum control parameters tha… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 9 publications
0
1
0
Order By: Relevance
“…In this case, to ensure Pareto optimality, g should be maximized only over the set of Pareto-optimal outcomes, i.e., over the Pareto front. In practice, it is rarely possible to describe the Pareto front analytically, but it can be efficiently mapped using multi-objective optimization techniques or genetic algorithms [46,52]. Once the Pareto front is mapped by a sufficiently dense set of Pareto-optimal outcomes, g can be evaluated for each of them, and the outcome with the highest value of g can be picked as a Pareto-optimal solution to the problem max d t , 1≤t≤T g(U 1 , .…”
Section: Discussionmentioning
confidence: 99%
“…In this case, to ensure Pareto optimality, g should be maximized only over the set of Pareto-optimal outcomes, i.e., over the Pareto front. In practice, it is rarely possible to describe the Pareto front analytically, but it can be efficiently mapped using multi-objective optimization techniques or genetic algorithms [46,52]. Once the Pareto front is mapped by a sufficiently dense set of Pareto-optimal outcomes, g can be evaluated for each of them, and the outcome with the highest value of g can be picked as a Pareto-optimal solution to the problem max d t , 1≤t≤T g(U 1 , .…”
Section: Discussionmentioning
confidence: 99%