ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

Optimizing a unit commitment problem using an evolutionary algorithm and a plurality of priority lists

Tsalavoutis, Vasilios A.*; Vrionis, Constantinos G.; Tolis, Athanasios I.
Operational Research2021-3DOI: 10.1007/s12351-018-0442-x
5被引6阅读
引用收藏
分享

摘要

The Unit Commitment Problem (UCP) is an operational research problem commonly encountered in energy management. It refers to the optimum scheduling of the generating units in a power system to efficiently meet the electricity demand. UCP comprises two interrelated sub-problems: the Unit Commitment for deciding the operating state of the units at each scheduling period and the Economic Dispatch (ED) for allocating the demand among them. Various Evolutionary Algorithms (EA) have been adopted for solving UCP, commonly assisted by the Lambda iteration method for solving the ED. In this study, an EA-based method is proposed for dealing with both sub-problems, avoiding binary variables through a simple transformation function. The method takes advantage of a repair mechanism utilizing the Priority List (PL) to steer the search towards adequate generating schedules. The impact of the cost metric chosen for creating the PL on the computational results is investigated and the use of a Plurality of PL is suggested to alleviate the biases introduced by employing constant cost metrics. Furthermore, an Elitist Mutation strategy is developed to enhance the performance of the proposed EA-based method. Simulation results on various power systems validate the beneficial effect of the proposed modifications. Compared to state of the art, the algorithm proposed has been at least equivalent, exhibiting consistently solutions of lower or competitive costs in all systems examined.

学科与关键词

关键词
Unit Commitment ProblemPriority ListRamp rate constraintsDifferential EvolutionFeasibility RulesEvolutionary Algorithms
相关
加载中…
  • A Comprehensive Review on Evolutionary Optimization Techniques Applied for Unit Commitment Problem
    Muralikrishnan, Narayanasamy; Jebaraj, Luke*; Rajan, Charles Christober AsirIEEE Access, 2020, 8: 132980-133014.被引 29
  • A Review on the Unit Commitment Problem: Approaches, Techniques, and Resolution Methods
    Montero, Luis*; Bello, Antonio; Reneses, JavierEnergies, 2022, 15(4): 1296.被引 31
  • Modified Binary Differential Evolution Algorithm to Solve Unit Commitment Problem
    Dhaliwal, Jatinder Singh*; Dhillon, Jaspreet SinghELECTRIC POWER COMPONENTS AND SYSTEMS, 2018, 46(8): 900-918.被引 16
查看全部 →

发表信息

论文状态
公开发表
期刊
Operational Research
发表日期
2021-03
卷期
第 21 卷, 第 1 期
页码
1-54
DOI
10.1007/s12351-018-0442-x
语言
ENGLISH
期刊收录
NSL
期刊等级
4区
成果收录
SCIE
资助标注
Alexander S. Onassis Public Benefit Foundation [G ZL 074-1/2015-2016]; Eugenides Foundation [2356]; State Scholarships Foundation [MIS-5000432]

作者

  • T

    Tsalavoutis, Vasilios A. (通讯) (第一作者)

  • V

    Vrionis, Constantinos G.

查看全部 3 位作者收起作者
  • T

    Tolis, Athanasios I.

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417