基于蚁群算法的配电网网络重构-电力系统及其自动化专业论文.docxVIP

英文摘要Title：Ant 英文摘要 Title：Ant Colony System Algorithm For Distribution Network Reconfiguration Major=Electric power system and Automation Name；Yannan Ren Signatu陀：2丛塑幽 Supervisor：Pmf．Lixiao YAO Signatu Abstract Distribution system reconfigurafion is a complicated combinatorial optimization problem, which is characterized by multi-constrains，non—linearity and discreteness．Because of NP—hard，WC cannot find the polynomial algorithm which call achieve the best solution to the reconfiguration problem．For satisfying the requirements ofthe time and space，it iS reasonable and natlLral to compute certain s蜘ptimal feasible solution,and heuristic methods arc designed based on such an idea． The traditional optimal methods usually only compute the local optimal best solutions to the distribution reconfiguration problem．In recent years，the modem heuristic and intelligent methods call effciently solve such complicated discrete problem，and these algorithms are characterized by global optimization and generalization．This paper employs a new type of simulated evolutionary algorithm，Ant Colony Algorithm(ACA)，to solve the distribution reconfiguration problem．Many combinatorial optimization problems have been effciently solved by ACA．In the algorithm，in order to make the ant colony show an intelligent behavior, the ants cooperate by exchanging the pheromone．Through changing the pheromone of the feeders，the algorithm gradually achieves the better solutions． But most of these algorithms have not find a good method to represent the solution of distribution recortfiguration problem．so that many unfeasible solutions are searched during computation process．According to the radial ofdistribution system，a new representation ofthe solution is suggesP．xl。This paper uses the spanning tree of Graph Theory to represent the solution so that radial checking procedure is avoided．In addition，because this kind of solution representation makes the searching process confined to only feasible solu