| 检修计划新模型与算法的研究 |
| |
| 引用本文： | 陈竟成 李小彬. 检修计划新模型与算法的研究[J]. 电网技术, 1997, 21(11): 66-69 |
| |
| 作者姓名： | 陈竟成 李小彬 |
| |
| 作者单位： | 电力部电力科学研究院!北京清河，100085，电力部电力科学研究院!北京清河，100085，电力部电力科学研究院!北京清河，100085，电力部电力科学研究院!北京清河，100085，华北电业管理局!北京，100053，华北电业管理局!北京，100053 |
| |
| 摘 要： | 本文在研究检修计划问题的内在特点基础上，建立了基于整数规划的检修计划优化模型和算法。记叙虎法直接根据约束系数矩阵Ａ中每台机组所对应元素的最小和最大值来分别消去不可行分支解和待校验约束，从而显著缩小了问题求搜索空间。本文最后给出了算例。
|
| 关 键 词： | 检修计划 整数规划 算法 电力系统 |
RESEARCH OF A NEW OPTIMIZATION MODULE AND ALGORITHM FOR MAINTENANCE SCHEDULING PROBLEM |
| |
| Chen Jingcheng, Yu Erkeng, Liu Guangyi, Zhou Jingyang, Li Xiaobin, Li Yongsheng. RESEARCH OF A NEW OPTIMIZATION MODULE AND ALGORITHM FOR MAINTENANCE SCHEDULING PROBLEM[J]. Power System Technology, 1997, 21(11): 66-69 |
| |
| Authors: | Chen Jingcheng Yu Erkeng Liu Guangyi Zhou Jingyang Li Xiaobin Li Yongsheng |
| |
| Abstract: | Based on the research of the internal features of maintenance scheduling problem, this paper establishes its integer programming based optimization module and algorithm.Using the maximum and minimum values of each unit's corresponding factors in the constraint matrix, the algorithm respectively filters out in feasible branch solutions and cancels constraints to be verified. The practicality and efficiency of the algorithm have been proved. It can serve as a general solution methed for optimal maintenance scheduling problem. |
| |
| Keywords: | Maintenance scheduling Integer programming Algorithm |
| 本文献已被 CNKI 维普 等数据库收录！ |
