Solving the short run economic dispatch problem using concurrent constraint programming

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

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 net-works 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 us-ability of Mozart language to model real combinatory problems.

Cite

CITATION STYLE

APA

Díaz F., J. F., Romero, I. J., & Lozano, C. (2006). Solving the short run economic dispatch problem using concurrent constraint programming. In IFIP Advances in Information and Communication Technology (Vol. 218, pp. 265–274). Springer New York LLC. https://doi.org/10.1007/978-0-387-34749-3_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free