The search for an optimal configuration for a distribution network can be viewed by three different approaches based on the implicit enumeration of solutions. The approach called branch exchange seems to avoid the disadvantages of the two others. This approach has allowed the authors to imagine and develop, initially, two descent search strategies. Thereafter, to improve these strategies, they have been transformed to include the principles of an optimization method, called TABU. All strategies have finally been tested in the case of a real network to find a feasible configuration with minimal losses