A simulated annealing algorithm for unit commitment

A. H. Mantawy

doi:10.1109/59.651636

A simulated annealing algorithm for unit commitment

A. H. Mantawy^*

^*Corresponding author for this work

King Fahd University of Petroleum & Minerals

Research output: Contribution to journal › Article › peer-review

286 Scopus citations

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 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.

Original language	English
Pages (from-to)	197-204
Number of pages	8
Journal	IEEE Transactions on Power Systems
Volume	13
Issue number	1
DOIs	https://doi.org/10.1109/59.651636
State	Published - 1998

ASJC Scopus subject areas

Energy Engineering and Power Technology
Electrical and Electronic Engineering

Access to Document

10.1109/59.651636

Cite this

@article{2de3a2651f954a939e10f9a3115854dc,

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 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.",

author = "Mantawy, \{A. H.\}",

year = "1998",

doi = "10.1109/59.651636",

language = "English",

volume = "13",

pages = "197--204",

journal = "IEEE Transactions on Power Systems",

issn = "0885-8950",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "1",

}

TY - JOUR

T1 - A simulated annealing algorithm for unit commitment

AU - Mantawy, A. H.

PY - 1998

Y1 - 1998

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0031999302

U2 - 10.1109/59.651636

DO - 10.1109/59.651636

M3 - Article

AN - SCOPUS:0031999302

SN - 0885-8950

VL - 13

SP - 197

EP - 204

JO - IEEE Transactions on Power Systems

JF - IEEE Transactions on Power Systems

IS - 1

ER -

A simulated annealing algorithm for unit commitment

Abstract

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this