New Formulations for the Unit Commitment Problem - Optimal Control and Switching-Time Parameterization Approaches

• Type: Article in International Conference Proceedings Book
• Date: 2017

Authors

Roque, LAC (Author) Other; Fontes, Fernando A C C (Author) FEUP; Dalila B.M.M. Fontes (Author) FEP

Conference proceedings International

Title: ICINCO 2017 - Proceedings of the 14th International Conference on Informatics in Control, Automation and Robotics

Pages: 326-331

14th International Conference on Informatics in Control, Automation and Robotics, ICINCO 2017

26 July 2017 through 28 July 2017

Indexing

ISI Web of Knowledge - 0 Citations

Scopus - 0 Citations

Other information

Authenticus ID: P-00N-131

DOI: 10.5220/0006465603260331

Abstract (EN): 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. Copyright

Language: English

Type (Professor's evaluation): Scientific