Application of evolutionary algorithms for the planning of urban distribution networks of medium voltage

Currently, an important issue in power distribution is the need to optimize medium voltage (mv) networks serving urban areas. This paper shows how an evolutionary algorithm can be used as the basis for the type of efficient algorithm such optimization demands. The search for optimal network solution will be restricted to a graph defined from the urban map, so each graph branch represents a trench. The solution space (networks) is assumed with "loop feeder circuits": networks with two electrical paths from the high voltage/medium voltage (hv/mv) substations to the customers. In the optimization process, the investment and loss load costs are considered taking into account the constraints of conductor capacities and voltage drop. The investment costs will take into account that some cables can be lying in the same trench. The process was applied for a Spanish city of 200 000 inhabitants.