Improved PSO Approach for The Solution of Unit Commitment Problem

DOI

10.2991/aiie-15.2015.137How to use a DOI?

Keywords

unit commitment problem; particle swarm optimization; time order; priority list

Abstract

Unit commitment problem (UCP) is a large scale nonlinear hybrid integer programming problem and it involves determining on/off states of units and generations of units. This paper proposes an improved particle swarm optimization (IPSO) for the solution of UCP. In the proposed approach, the on/off states of units are limited into feasible schedules by providing a new method related to a time order at first. After that, the problem is transformed into a simple economic load dispatch problem. Then this dispatch problem is solved by an improved priority list technique instead of the classical equal lambda-iteration method. All the above improvements are embedding into the framework of PSO approach for UCP. It is seen from the numerical results that the presented algorithm surely possesses a high quality and a high convergence speed.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Y.R. Guo
AU  - Y.H. Wu
AU  - J.R. Zhang
AU  - J.D. Ren
PY  - 2015/07
DA  - 2015/07
TI  - Improved PSO Approach for The Solution of Unit Commitment Problem
BT  - Proceedings of the 2015 International Conference on Artificial Intelligence and Industrial Engineering
PB  - Atlantis Press
SP  - 510
EP  - 513
SN  - 1951-6851
UR  - https://doi.org/10.2991/aiie-15.2015.137
DO  - 10.2991/aiie-15.2015.137
ID  - Guo2015/07
ER  -