计算机工程2012,Vol.38Issue(10):260-262,3.DOI:10.3969/j.issn.1000-3428.2012.10.080
输电线路单组检修计划模型及求解
Model and Solution for Single-group Maintenance Scheduling of Transmission Lines
摘要
Abstract
Aiming at the difficult problem of making transmission lines maintenance scheduling, a mode! 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 mode! 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,3.基金项目
国家自然科学基金资助项目(60674021) (60674021)