Power distribution network expansion scheduling using dynamic programming genetic algorithm

A genetic algorithm that is dedicated to the expansion planning of electric distribution systems is presented, with incremental expansion scheduling along a time horizon of several years and treated as a dynamic programming problem. Such a genetic algorithm (called dynamic programming genetic algorithm) is endowed with problem-specific crossover and mutation operators, dealing with the problem through a heuristic search in the space of dynamic programming variables. Numerical tests have shown that the proposed algorithm has found good solutions that considerably enhance the solutions found by non-dynamic programming methods. The algorithm has also shown to work for problem sizes that would be computationally infeasible for exact dynamic programming techniques.