An efficient brute-force solution to the network reconfiguration problem

By A. Morton, Iven M. Y. Mareels. 2000

214 citations recorded by the source corpus.

Subfields: Control and Systems Engineering, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/28256ecfd04c3fb5a02e5a3faed9ce748cfe2614

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Control and Systems Engineering

1. Jorge Pereira
2. Manuel A. Matos
3. Hussein M. Khodr
4. Jorge Martínez-Crespo
5. Alberto Borghetti
6. Hamed Ahmadi
7. José Ramon Martí
8. Franz S. Hover

In Electrical and Electronic Engineering

1. Jorge Pereira
2. Manuel A. Matos
3. Andreas Sumper
4. Hussein M. Khodr
5. Jorge Martínez-Crespo
6. Alberto Borghetti
7. Hamed Ahmadi
8. José Ramon Martí

Citations in the corpus

• Path-based distribution network modeling: application to reconfiguration for loss reduction (2005, background): “On the one hand, the safest way to solve the reconfiguration problem consists of trying all possible trees for the system in hand, as done in [2].”
• Pareto Optimal Reconfiguration of Power Distribution Systems Using a Genetic Algorithm Based on NSGA-II (2013, methodology): “, ―brute force‖ [10]) method which generates the entire space of candidate solutions in order to choose the best one, requires a prohibitive execution time.”
• Distribution Systems Reconfiguration Based on OPF Using Benders Decomposition (2009, methodology): “Finally, it should be noted that the configuration obtained by the proposed algorithm is equal to the results obtained by [38]–[40] and seems to represent the optimum by obtaining”