Power generation investmen : An algorithm to get a good feasible solution from operation simulations.
Supervisor(es): Jofré, Alejandro
Resumen:
The algorithm we present here is able to give an optimal solution for the power generation expansion problem if there is no dynamical links between time steps (normally years). In other case, it gives a good approximation to the optimal solution. It uses as input an estimation of the expected operation cost with fixed generation equipment. This kind of data is normally available in Power Utilities, frequently from operation models. For the general problem (solved with more involved methods), this algorithm can give a good feasible solution that can be useful in the search for the optimum.
| 2002 | |
|
GENERACION DE ENERGIA OPTIMIZACION PROBABILIDAD ALGORITMOS |
|
| Inglés | |
| Universidad de la República | |
| COLIBRI | |
| https://hdl.handle.net/20.500.12008/24376 | |
| Acceso abierto | |
| Licencia Creative Commons Atribución - No Comercial - Sin Derivadas (CC - By-NC-ND 4.0) |
Resultados similares
-
A fast genetic algorithm for the Maximum Cut-Clique problem.
Autor(es):: Fortez Hitateguy, Giovanna Elizabeth
Fecha de publicación:: (2019) -
On digital colonialism: Data, algorithms and technological coloniality of power in the global south
Autor(es):: Tello, Andrés
Fecha de publicación:: (2023) -
Optimal stopping for strong Markov processes: explicit solutions and verification theorems for diffusions, multidimensional diffusions, and jump-processes
Autor(es):: Crocce, Fabián
Fecha de publicación:: (2012) -
Tree models :algorithms and information theoretic properties
Autor(es):: Martín, Alvaro
Fecha de publicación:: (2009) -
Quantum Implementation of a Genetic Algorithm
Autor(es):: Solar, Mauricio
Fecha de publicación:: (2024)