2018
DOI: 10.1609/aaai.v32i1.11347
|View full text |Cite
|
Sign up to set email alerts
|

Efficiently Approximating the Pareto Frontier: Hydropower Dam Placement in the Amazon Basin

Abstract: Real-world problems are often not fully characterized by a single optimal solution, as they frequently involve multiple competing objectives; it is therefore important to identify the so-called Pareto frontier, which captures solution trade-offs. We propose a fully polynomial-time approximation scheme based on Dynamic Programming (DP) for computing a polynomially succinct curve that approximates the Pareto frontier to within an arbitrarily small epsilon > 0 on tree-structured networks. Given a set of object… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 10 publications
(8 citation statements)
references
References 16 publications
0
7
0
Order By: Relevance
“…Previous work framed the problem of selecting which dams to build in the Amazon basin as a tree-structured MO-COP arising from converting the underlying river network to a rooted, directed tree network (Gomes-Selman et al 2018;Wu et al 2018). The goal is to find the Pareto frontier: the set of all solutions such that no solution is dominated by any other feasible solution.…”
Section: Curbing Climatementioning
confidence: 99%
See 3 more Smart Citations
“…Previous work framed the problem of selecting which dams to build in the Amazon basin as a tree-structured MO-COP arising from converting the underlying river network to a rooted, directed tree network (Gomes-Selman et al 2018;Wu et al 2018). The goal is to find the Pareto frontier: the set of all solutions such that no solution is dominated by any other feasible solution.…”
Section: Curbing Climatementioning
confidence: 99%
“…In other words, for a given solution, there is no way to simultaneously improve upon some objective without compromising another. Due to the tree structure, Dynamic Programming (DP) may be used to compute the exact Pareto frontier (Wu et al 2018). In addition, a rounding technique applied to the exact DP algorithm provides a fully polynomial-time approximation scheme (FPTAS) (Wu et al 2018;Wu, Sheldon, and Zilberstein 2014a).…”
Section: Curbing Climatementioning
confidence: 99%
See 2 more Smart Citations
“…This optimization problem is computationally intensive because it requires accounting for 2 509 (~10 153 ) possible combinations of the 509 current and proposed dams in the Amazon basin. To overcome this challenge, we developed a fully polynomial-time approximation algorithm based on dynamic programming that, unlike previous heuristic approaches, can quickly approximate the Pareto frontier for multiple environmental criteria simultaneously and with guarantees of theoretical optimality ( 27 29 ). Given the vast number of Pareto-optimal solutions and the limitations of human cognition to visualize high-dimensional spaces such as a six-dimensional Pareto frontier, we developed an interactive graphical user interface (GUI) to navigate the high-dimensional solution space for Amazon dams (see materials and methods section 2.5 in the supplementary materials) ( 30 ).…”
Section: A Multiobjective Optimization Frameworkmentioning
confidence: 99%