基于最优效用的配电网多故障抢修任务分配策略

A Task Allocation Strategy of Multi-fault Rush Repair for Distribution Network Based on Optimum Utility

配电网多故障抢修不只是优化故障抢修顺序的问题,多小队协同抢修时,故障任务的合理分配才是抢修工作顺利、高效完成的前提。本文同时考虑抢修小队初始位置不同及负荷本身故障,定义了抢修小队偏好、抢修小队能力向量和故障任务需求向量,然后基于属性向量建立了可解决小队协作问题的效用函数模型,形成效用函数矩阵;最后结合轮盘赌选择方法得到基于最优效用的故障任务分配方案集。采用属性向量的形式量化抢修信息,可以随时改变属性向量维数,解决抢修资源以及现场故障需求的不确定性问题,实现故障任务的动态分配。仿真结果给出了10种任务分配方案,并用改进的细菌群体趋药性(BCC)算法优化得到最优方案及最佳抢修顺序,验证了所提方法的有效性和正确性。

To study the distribution network multi-fault rush repair problem with multiple repair squads, rational allocation of the repair tasks is the premise to complete the repair work smoothly and efficiently before the repair sequence optimization. Considering both the multiple repair squads with different initial positions and load itself failure, this paper defines such attribute vectors as the repair preference and ability vector of the repair squad and the fault demand vector, based on which the utility function model that can solve the collaboration problem is built and the utility function matrix is formed. Then via the roulette wheel selection method, the task allocation scheme set based on optimum utility is obtained. By quantizing the repair information in the form of the attribute vector and changing the attribute vector dimension, the uncertainty problem of the repair resources and fault demand can be resolved and realizing the dynamic allocation. Ten allocation schemes are given in the simulation result and the optimal one is obtained via the improved bacterial colony chemotaxis(BCC) algorithm, together with its corresponding optimal repair sequence, which proved the effectiveness and correctness of the proposed method.