Abstract

This paper deals with generation unit scheduling, well known as unit commitment (UC). Rather than using quadratic generation cost function, this paper utilizes non-smooth generation cost function (NSGCF). As NSGCF is difficult to handle using conventional technique such as quadratic programming, the metaheuristic technique, particle swarm optimization in this case, is used to solve the economic dispatch which is part of UC. In this UC, minimum up time, minimum down time, start up cost and shunt down cost are considered. In addition, spinning reserve is taken into account. Because UC is mix-integer optimization problem, Binary Particle Swarm Optimization (BPSO) is applied to complete UC. To show the effectiveness of the approach, system with 6 generators is utilized.

Original languageEnglish
Title of host publicationProceeding - 2016 International Seminar on Intelligent Technology and Its Application, ISITIA 2016
Subtitle of host publicationRecent Trends in Intelligent Computational Technologies for Sustainable Energy
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages571-576
Number of pages6
ISBN (Electronic)9781509017096
DOIs
Publication statusPublished - 20 Jan 2017
Event2016 International Seminar on Intelligent Technology and Its Application, ISITIA 2016 - Lombok, Indonesia
Duration: 28 Jul 201630 Jul 2016

Publication series

NameProceeding - 2016 International Seminar on Intelligent Technology and Its Application, ISITIA 2016: Recent Trends in Intelligent Computational Technologies for Sustainable Energy

Conference

Conference2016 International Seminar on Intelligent Technology and Its Application, ISITIA 2016
Country/TerritoryIndonesia
CityLombok
Period28/07/1630/07/16

Keywords

  • Binary Particle Swarm Optimization
  • Non-Smooth generation cost function
  • Spinning Reserve
  • Unit Commitment

Fingerprint

Dive into the research topics of 'Unit commitment with non-smooth generation cost function using binary particle swarm optimization'. Together they form a unique fingerprint.

Cite this