首页> 外文会议>International conference on artificial intelligence >Solving Unit Commitment Problem Based on New Stochastic Search Algorithm
【24h】

Solving Unit Commitment Problem Based on New Stochastic Search Algorithm

机译:基于新的随机搜索算法解决单位承诺问题

获取原文

摘要

Unit commitment problem is one of the large scale nonlinear hybrid integer programming problems which is considered in this paper. Thus, a new stochastic search algorithm has been implemented for solving the mentioned problem. For this purpose, Modified Invasive Weed Optimization (MIWO) has been proposed which is a bio-inspired numerical technique and inspired from weed colonization and motivated by a common phenomenon in agriculture that is colonization of invasive weeds. The proposed algorithm is tested on the power systems in the range of 10-140 generating units for a 24-hours scheduling period and compared to Quantum inspired Evolutionary Algorithm (QEA), Improved Binary Particle Swarm Optimization (IBPSO) and Mixed Integer Programming (MIP).
机译:单位承诺问题是本文考虑的大规模非线性混合整数规划问题之一。因此,已经实现了一种新的随机搜索算法来解决所提到的问题。为此目的,提出了改进的侵入性杂草优化(MIWO),这是一种生物启发的数值技术,并激发了杂草定植的激励,并受到侵袭性杂草的殖民化的农业中常见现象的激励。该算法在电力系统上测试了24小时调度周期的10-140个生成单元的范围,并与量子启发的进化算法(QEA)相比,改进的二进制粒子群优化(IBPSO)和混合整数编程(MIP )。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号