摘要： 为保证电力系统运行的安全性和可靠性，建立一种基于单组维修输电线路检修计划的时间约束旅行商问题模型。考虑线路重要性，同时保证线路检修时段始终控制在可选范围内，以可靠性理论中故障率为基础的经济损失风险最小为目标，设计出一种新的改进蚁群算法对模型进行求解，以便改善基本蚁群算法易于陷入局部最优解的缺点。实验结果表明，应用该算法的模型能够较好地解决输电线路检修计划的制定问题。
关键词:
蚁群算法,
自适应,
单组检修,
检修计划,
输电线路,
故障率
Abstract: Aiming at the difficult problem of making transmission lines maintenance scheduling, a model based on time restrains Travelling Salesman Problem(TSP) for transmission lines maintenance scheduling is presented. Taking account of importance of lines, and all line’s maintenance time is in the range of its maintenance time-choice during the search, the target in searching for the best maintenance scheduling is the minimal economic loss that bases on failure rate. The scheduling is made by a novel improved ant colony algorithm, which can improve the ability of escaping from local optimal solution. Results show that the model and the algorithm are suitable for solving transmission lines maintenance problem.
Key words:
ant colony algorithm,
adaptive,
single-group maintenance,
maintenance scheduling,
transmission line,
failure rate
中图分类号:
于宏涛, 高立群, 李丽霞. 输电线路单组检修计划模型及求解[J]. 计算机工程, 2012, 38(10): 260-262.
XU Hong-Chao, GAO Li-Qun, LI Li-Xia. Model and Solution for Single-group Maintenance Scheduling of Transmission Lines[J]. Computer Engineering, 2012, 38(10): 260-262.