Simulated Annealing for the Unit Commitment problem

• Tipo: Artigo em Livro de Atas de Conferência Internacional
• Data: 2001

Autores

Viana, A (Autor) Outra; Jorge Pinho de Sousa (Autor) FEUP; Manuel Matos (Autor) FEUP

Ata de Conferência Internacional

Título: 2001 IEEE Porto Power Tech Proceedings

Páginas: 229-233

2001 IEEE Porto Power Tech Conference

Porto, 10 September 2001 through 13 September 2001

Indexação

Scopus - 24 Citações

Outras Informações

ID Authenticus: P-007-F5M

DOI: 10.1109/ptc.2001.964747

Abstract (EN): Due to their efficiency and their interesting design and implementation features, metaheuristics have been used for a long time with success, in dealing with combinatorial problems. In recent years they have been applied to the Unit Commitment problem with rather interesting results that justify further research in the area. In this paper we present a Simulated Annealing approach to the Unit Commitment problem. Two coding schemes are compared, new neighbourhood structures are presented and some searching strategies are discussed. Preliminary computational experience, performed on some test instances, shows that this approach is flexible, effective and able to handle variations on the problem structure. © 2001 IEEE.

Idioma: Inglês

Tipo (Avaliação Docente): Científica