摘要
本文在研究检修计划问题的内在特点基础上，建立了基于整数规划的检修计划优化模型和算法。该算法直接根据约束系数矩阵A中每台机组所对应元素的最小值和最大值来分别消去不可行分支解和待校验约束，从而显著缩小了问题求解搜索空间。本文最后给出了算例。
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.
出处
《电网技术》
EI
CSCD
北大核心
1997年第11期66-69,共4页
Power System Technology
关键词
检修计划
整数规划
算法
电力系统
Maintenance scheduling Integer programming Algorithm
