Authors:
Luís A. C. Roque
1
;
Fernando A.C.C. Fontes
2
and
Dalila B.M.M. Fontes
2
Affiliations:
1
Instituto Superior de Engenharia do Porto, Portugal
;
2
Universidade do Porto, Portugal
Keyword(s):
Unit Commitment, Switching Time Problem, Optimal Control, Electrical Power Systems.
Related
Ontology
Subjects/Areas/Topics:
Artificial Intelligence
;
Evolutionary Computation and Control
;
Formal Methods
;
Informatics in Control, Automation and Robotics
;
Intelligent Control Systems and Optimization
;
Optimization Algorithms
;
Planning and Scheduling
;
Simulation and Modeling
;
Symbolic Systems
Abstract:
The Unit Commitment Problem (UCP) is a well-known combinatorial optimization problem in power systems.
The main goal in the UCP is to schedule a subset of a given group of electrical power generating units and also
to determine their production output in order to meet energy demands at minimum cost. In addition, a set of
technological and operational constraints must be satisfied. A large variety of optimization methods addressing
the UCP is available in the literature. This panoply of methods includes exact methods (such as dynamic
programming, branch-and-bound) and heuristic methods (tabu search, simulated annealing, particle swarm,
genetic algorithms). This paper proposes two non-traditional formulations. First, the UCP is formulated as
a mixed-integer optimal control problem with both binary-valued control variables and real-valued control
variables. Then, the problem is formulated as a switching time dynamic optimization problem involving only
real-valued controls.