...
首页> 外文期刊>IEEE Transactions on Power Systems >A parallel genetic algorithm approach to solving the unit commitment problem: implementation on the transputer networks
【24h】

A parallel genetic algorithm approach to solving the unit commitment problem: implementation on the transputer networks

机译:解决单元承诺问题的并行遗传算法方法:在晶片机网络上的实现

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

摘要

Through a constraint handling technique, this paper proposes a parallel genetic algorithm (GA) approach to solving the thermal unit commitment (UC) problem. The developed algorithm is implemented on an eight-processor transputer network, processors of which are arranged in master-slave and dual-direction ring structures, respectively. The proposed approach has been tested on a 38-unit thermal power system over a 24-hour period. Speed-up and efficiency for each topology with different number of processor are compared to those of the sequential GA approach. The proposed topology of dual-direction ring is shown to be well amenable to parallel implementation of the GA for the UC problem.
机译:通过约束处理技术,本文提出了一种并行遗传算法(GA)方法来解决热机组承诺(UC)问题。所开发的算法在八处理器晶片机网络上实现,该处理器的处理器分别以主从和双向环形结构排列。该提议的方法已经在24小时的38单元火力系统上进行了测试。将具有不同处理器数量的每种拓扑的速度和效率与顺序GA方法的速度和效率进行了比较。所提出的双向环形拓扑被证明非常适合并行解决UC问题的GA。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号