Constrained Unit Commitment and Dispatch Optimization

dc.contributor.author Manuel Matos en
dc.contributor.author Ana Viana en
dc.contributor.author Bogdan Lucus en
dc.contributor.author Jorge Correia Pereira en
dc.date.accessioned 2017-11-16T12:20:09Z
dc.date.available 2017-11-16T12:20:09Z
dc.date.issued 2006 en
dc.description.abstract In this paper we propose an algorithm that solves the Unit Commitment and an Economic Dispatch problems at once. The Unit Commitment problem considers the load forecasts to determine the operating schedule of the power units for the next planning period, and it is solved using a metaheuristic with Constraint Oriented Neighbourhoods. The Economic Dispatch problem consists on the optimization of operating costs under the general constraints of the power system including network constraints. In this work it is solved by an integrated methodology using a simplex method applied to the linearized problem. en
dc.identifier.uri http://repositorio.inesctec.pt/handle/123456789/1420
dc.language eng en
dc.relation 1809 en
dc.relation 3708 en
dc.relation 214 en
dc.rights info:eu-repo/semantics/openAccess en
dc.title Constrained Unit Commitment and Dispatch Optimization en
dc.type conferenceObject en
dc.type Publication en
Files