Title: A simulated annealing algorithm for unit commitment
Abstract:This paper presents a simulated annealing algorithm (SAA) to solve the unit commitment problem (UCP). New rules for randomly generating feasible solutions are introduced. The problem has two subproble...This paper presents a simulated annealing algorithm (SAA) to solve the unit commitment problem (UCP). New rules for randomly generating feasible solutions are introduced. The problem has two subproblems: a combinatorial optimization problem; and a nonlinear programming problem. The former is solved using the SAA while the latter problem is solved via a quadratic programming routine. Numerical results showed an improvement in the solutions costs compared to previously obtained results.Read More
Publication Year: 1998
Publication Date: 1998-01-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 301
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot