...
首页> 外文期刊>Journal of heuristics >Solving Unit Commitment Problem Using Hybrid Particle Swarm Optimization
【24h】

Solving Unit Commitment Problem Using Hybrid Particle Swarm Optimization

机译:混合粒子群算法求解机组组合问题

获取原文
获取原文并翻译 | 示例

摘要

This paper presents a Hybrid Particle Swarm Optimization (HPSO) to solve the Unit Commitment (UC) problem. Problem formulation of the unit commitment takes into consideration the minimum up and down time constraints, start up cost and spinning reserve, which is defined as the minimization of the total objective function while satisfying all the associated constraints. Problem formulation, representation and the simulation results for a 10 generator-scheduling problem are presented. Results shown are acceptable at this early stage.
机译:本文提出了一种混合粒子群算法(HPSO)来解决单位承诺(UC)问题。单位承诺的问题表述考虑了最小的上下限时间限制,启动成本和旋转储备,这被定义为在满足所有相关约束的同时最小化总目标函数。给出了10个发电机计划问题的问题表述,表示形式和仿真结果。显示的结果在这个早期阶段是可以接受的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号