Solution of unit commitment problem using quasi-oppositional teaching learning based algorithm
Author:
Publisher
Elsevier BV
Subject
Electrical and Electronic Engineering,Energy Engineering and Power Technology
Reference69 articles.
1. A capacity based Lagrangian relaxation unit commitment with ramp rate constraints;Peterson;IEEE Trans Power Syst,1995
2. A solution to the unit-commitment problem using integer-coded genetic algorithm;Damousis;IEEE Trans Power Syst,2004
3. Fast technique for unit commitment by genetical algorithm based on unit clustering;Senjyu;IEE Proc. Gener Transm Distrib,2005
4. Large scale hydro-thermal unit commitment-method and results;Happ;IEEE Trans Power Apparat Syst,1971
5. A study of economic shutdown of generating units in daily dispatch;Baldwin;IEEE Trans Power Apparat Syst,1960
Cited by 47 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Reinforcement learning-based optimization for power scheduling in a renewable energy connected grid;Renewable Energy;2024-09
2. Expert knowledge data-driven based actor–critic reinforcement learning framework to solve computationally expensive unit commitment problems with uncertain wind energy;International Journal of Electrical Power & Energy Systems;2024-08
3. Distributed scheduling for multi-energy synergy system considering renewable energy generations and plug-in electric vehicles: A level-based coupled optimization method;Energy and AI;2024-05
4. Reinforcement Learning-Based Multi-Objective Optimization for Generation Scheduling in Power Systems;Systems;2024-03-19
5. pymops: A multi-agent simulation-based optimization package for power scheduling;Software Impacts;2024-03
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3