基于隐式枚举的0-1整数规划的发电维护调度

N. Tabari, M. Pirmoradian, S. Hassanpour
{"title":"基于隐式枚举的0-1整数规划的发电维护调度","authors":"N. Tabari, M. Pirmoradian, S. Hassanpour","doi":"10.1109/SIBIRCON.2008.4602605","DOIUrl":null,"url":null,"abstract":"This paper presents an implicit enumeration based 0-1 integer programming methodology for finding the optimum preventive maintenance schedule of generating units. The objective function is to maintain the units as earlier as possible. Various constraints such as spinning reserve, duration of maintenance and maintenance crew are being taken into account. In a case study, using the power system of the first reference with six generating units, and implying implicit enumeration, we obtain one optimum solution and seven other feasible solutions. Finally with respect to the mentioned reference, we make a conclusion.","PeriodicalId":295946,"journal":{"name":"2008 IEEE Region 8 International Conference on Computational Technologies in Electrical and Electronics Engineering","volume":"81 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Implicit enumeration based 0–1 integer programming for generation maintenance scheduling\",\"authors\":\"N. Tabari, M. Pirmoradian, S. Hassanpour\",\"doi\":\"10.1109/SIBIRCON.2008.4602605\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents an implicit enumeration based 0-1 integer programming methodology for finding the optimum preventive maintenance schedule of generating units. The objective function is to maintain the units as earlier as possible. Various constraints such as spinning reserve, duration of maintenance and maintenance crew are being taken into account. In a case study, using the power system of the first reference with six generating units, and implying implicit enumeration, we obtain one optimum solution and seven other feasible solutions. Finally with respect to the mentioned reference, we make a conclusion.\",\"PeriodicalId\":295946,\"journal\":{\"name\":\"2008 IEEE Region 8 International Conference on Computational Technologies in Electrical and Electronics Engineering\",\"volume\":\"81 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-07-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE Region 8 International Conference on Computational Technologies in Electrical and Electronics Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIBIRCON.2008.4602605\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE Region 8 International Conference on Computational Technologies in Electrical and Electronics Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIBIRCON.2008.4602605","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

摘要

本文提出了一种基于隐式枚举的0-1整数规划方法,用于寻找发电机组最优预防性维修计划。目标函数是尽可能早地维护单元。考虑到旋转储备、维修时间和维修人员等各种约束条件。在实例研究中,采用第一参考的6台发电机组的电力系统,采用隐式枚举,得到了1个最优解和7个其他可行解。最后,对上述文献进行了总结。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Implicit enumeration based 0–1 integer programming for generation maintenance scheduling
This paper presents an implicit enumeration based 0-1 integer programming methodology for finding the optimum preventive maintenance schedule of generating units. The objective function is to maintain the units as earlier as possible. Various constraints such as spinning reserve, duration of maintenance and maintenance crew are being taken into account. In a case study, using the power system of the first reference with six generating units, and implying implicit enumeration, we obtain one optimum solution and seven other feasible solutions. Finally with respect to the mentioned reference, we make a conclusion.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信