{"title":"自适应发电厂启动调度:模拟测试结果","authors":"A. Kamiya, K. Kawai, I. Ono, S. Kobayashi","doi":"10.1109/SMCIA.2001.936724","DOIUrl":null,"url":null,"abstract":"Power plant start-up scheduling is aimed at minimizing the start-up time while limiting maximum turbine-rotor stresses. A shorter start-up time not only reduces fuel and electricity consumption during the start-up process, but also increases its capability of adapting to changes in electricity demand. This scheduling problem is, however, highly nonlinear with a number of local optima within a wide search space. In our previous research, we proved that the optimal schedule stays on the edge of the feasible space, and provided an adaptive enforcement operation based on a theoretical setting equation. The adaptive enforcement operation used with GA is applied to compel the search along the edge of the feasible space, so as to increase the search efficiency. We give a brief description of the theoretical proof and present simulation test results with a range of hard-to-search stress limit sets to verify the search efficiency of the theoretically-proved search model.","PeriodicalId":104202,"journal":{"name":"SMCia/01. Proceedings of the 2001 IEEE Mountain Workshop on Soft Computing in Industrial Applications (Cat. No.01EX504)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Adaptive power plant start-up scheduling: simulation test results\",\"authors\":\"A. Kamiya, K. Kawai, I. Ono, S. Kobayashi\",\"doi\":\"10.1109/SMCIA.2001.936724\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Power plant start-up scheduling is aimed at minimizing the start-up time while limiting maximum turbine-rotor stresses. A shorter start-up time not only reduces fuel and electricity consumption during the start-up process, but also increases its capability of adapting to changes in electricity demand. This scheduling problem is, however, highly nonlinear with a number of local optima within a wide search space. In our previous research, we proved that the optimal schedule stays on the edge of the feasible space, and provided an adaptive enforcement operation based on a theoretical setting equation. The adaptive enforcement operation used with GA is applied to compel the search along the edge of the feasible space, so as to increase the search efficiency. We give a brief description of the theoretical proof and present simulation test results with a range of hard-to-search stress limit sets to verify the search efficiency of the theoretically-proved search model.\",\"PeriodicalId\":104202,\"journal\":{\"name\":\"SMCia/01. Proceedings of the 2001 IEEE Mountain Workshop on Soft Computing in Industrial Applications (Cat. No.01EX504)\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SMCia/01. Proceedings of the 2001 IEEE Mountain Workshop on Soft Computing in Industrial Applications (Cat. No.01EX504)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SMCIA.2001.936724\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SMCia/01. Proceedings of the 2001 IEEE Mountain Workshop on Soft Computing in Industrial Applications (Cat. No.01EX504)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SMCIA.2001.936724","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
发电厂启动调度的目的是在限制涡轮机转子最大应力的同时,尽量缩短启动时间。缩短启动时间不仅能减少启动过程中的燃料和电力消耗,还能提高适应电力需求变化的能力。然而,这个调度问题是一个高度非线性的问题,在广阔的搜索空间内存在许多局部最优。在之前的研究中,我们证明了最优调度停留在可行空间的边缘,并提供了基于理论设定方程的自适应执行操作。与 GA 配合使用的自适应执行操作用于强制沿可行空间边缘搜索,从而提高搜索效率。我们简要介绍了理论证明,并给出了一系列难搜索压力极限集的仿真测试结果,以验证理论证明的搜索模型的搜索效率。
Adaptive power plant start-up scheduling: simulation test results
Power plant start-up scheduling is aimed at minimizing the start-up time while limiting maximum turbine-rotor stresses. A shorter start-up time not only reduces fuel and electricity consumption during the start-up process, but also increases its capability of adapting to changes in electricity demand. This scheduling problem is, however, highly nonlinear with a number of local optima within a wide search space. In our previous research, we proved that the optimal schedule stays on the edge of the feasible space, and provided an adaptive enforcement operation based on a theoretical setting equation. The adaptive enforcement operation used with GA is applied to compel the search along the edge of the feasible space, so as to increase the search efficiency. We give a brief description of the theoretical proof and present simulation test results with a range of hard-to-search stress limit sets to verify the search efficiency of the theoretically-proved search model.