【作者】 莫小燕；

【导师】 张粒子；

【作者基本信息】 华北电力大学（北京） ， 电力系统及其自动化， 2006， 硕士

【摘要】 在制定日检修计划时,为尽量保证负荷不停电,需要确定出相应的负荷转移路径。在实际的检修计划制定工作中,转移路径是根据运行经验选择的,但是,由于配电网接线复杂、检修任务多,人为凭借经验确定的转移路径很可能只是可行路径,而非最优路径。本文从配电网日检修计划编制的实际需要出发,建立了考虑多种约束条件下,以提高配电网经济性为目标的配电网检修负荷转移路径的优化模型,并针对该模型的求解,提出了一种改进的遗传算法;该算法以遗传算法为主优化算法获取最优的联络开关组合,以启发式算法为辅助算法获取对应于某种联络开关组合下的分段开关组合,避免了简单遗传算法在求解过程中产生大量不可行解的弊端。最后通过算例分析验证了本文所提出的模型和算法的正确性。更多还原

【Abstract】 Distribution networks daily maintenance includes transferring de-energizedloads to other supporting distribution feeders by load transfer paths. The paths thatcome out from experience may be feasible, but not always optimum.A distribution network maintenance scheduling load transfer path optimalmodel has been proposed in this paper in need of framing distribution network dailymaintenance schedule from the respective of enhancing economical performanceand not violating multiple constraints. Besides, a new algorithm has been putforwarded. It adopted genetic algorithm as main optimal algorithm to find the bestcombination of tie-line switches and applied heuristic search as supportingalgorithm to get the combination of the sectionalizing switches in case of a settledcombination of tie-line switches. The new algorithm overcomes the weakness ofsimple genetic algorithm such as generating mass unfeasible outcomes. Thefeasibility of the presented model and algorithm is verified by practical examples.更多还原