Solving the short run economic dispatch problem using concurrent constraint programming
This paper shows a description of an application for solving the Short-Run Economic Dispatch Problem. This problem consists of searching the active power hourly schedule generated in electrical networks in order to meet the demand at minimum cost. The solution cost is associatted to the inmediate co...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2006
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/24232 |
| Aporte de: |
| Sumario: | This paper shows a description of an application for solving the Short-Run Economic Dispatch Problem. This problem consists of searching the active power hourly schedule generated in electrical networks in order to meet the demand at minimum cost. The solution cost is associatted to the inmediate costs of thermal units and the future costs of hydropower stations. The application was implemented using Mozart with real-domain constraints and a hybrid model among real (XRI) and finite domains (FD). The implemented tool showed promising results since the found solution costs were lower than those found in the literature for the same kind of problems. On the other hand, in order to test the tool against real problems, a system with data from real networks was implemented and the solution found was good enough in terms of time efficiency and accuracy. Also, this paper shows the usability of Mozart language to model real combinatory problems. |
|---|