单位承诺的基因互补遗传算法

ICEMS'2001. Proceedings of the Fifth International Conference on Electrical Machines and Systems (IEEE Cat. No.01EX501) Pub Date : 2001-08-18 DOI:10.1109/ICEMS.2001.970758

Liu Maojun, Tong Tiaosheng

{"title":"单位承诺的基因互补遗传算法","authors":"Liu Maojun, Tong Tiaosheng","doi":"10.1109/ICEMS.2001.970758","DOIUrl":null,"url":null,"abstract":"This paper presents a modified genetic algorithm solution to the unit commitment problem (UCP), and constructs three kinds of genetic operators. To enhance convergence rate of the algorithm and prevent converging at a local optimal solution, a gene complementary technology is proposed and is applied to the modified genetic algorithm, which is called a gene complementary genetic algorithm (GCGA). Simulation results show that GCGA is a very efficient algorithm for solution to UCP.","PeriodicalId":143007,"journal":{"name":"ICEMS'2001. Proceedings of the Fifth International Conference on Electrical Machines and Systems (IEEE Cat. No.01EX501)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"A gene complementary genetic algorithm for unit commitment\",\"authors\":\"Liu Maojun, Tong Tiaosheng\",\"doi\":\"10.1109/ICEMS.2001.970758\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a modified genetic algorithm solution to the unit commitment problem (UCP), and constructs three kinds of genetic operators. To enhance convergence rate of the algorithm and prevent converging at a local optimal solution, a gene complementary technology is proposed and is applied to the modified genetic algorithm, which is called a gene complementary genetic algorithm (GCGA). Simulation results show that GCGA is a very efficient algorithm for solution to UCP.\",\"PeriodicalId\":143007,\"journal\":{\"name\":\"ICEMS'2001. Proceedings of the Fifth International Conference on Electrical Machines and Systems (IEEE Cat. No.01EX501)\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-08-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICEMS'2001. Proceedings of the Fifth International Conference on Electrical Machines and Systems (IEEE Cat. No.01EX501)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICEMS.2001.970758\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICEMS'2001. Proceedings of the Fifth International Conference on Electrical Machines and Systems (IEEE Cat. No.01EX501)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEMS.2001.970758","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

提出了一种改进的遗传算法求解机组承诺问题，并构造了三种遗传算子。为了提高算法的收敛速度，防止算法收敛于局部最优解，提出了一种基因互补技术，并将其应用于改进的遗传算法中，称为基因互补遗传算法(GCGA)。仿真结果表明，GCGA是一种求解UCP问题的有效算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A gene complementary genetic algorithm for unit commitment

This paper presents a modified genetic algorithm solution to the unit commitment problem (UCP), and constructs three kinds of genetic operators. To enhance convergence rate of the algorithm and prevent converging at a local optimal solution, a gene complementary technology is proposed and is applied to the modified genetic algorithm, which is called a gene complementary genetic algorithm (GCGA). Simulation results show that GCGA is a very efficient algorithm for solution to UCP.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

ICEMS'2001. Proceedings of the Fifth International Conference on Electrical Machines and Systems (IEEE Cat. No.01EX501)

自引率

0.00%

发文量