Ordinal Optimization for Dynamic Network Reconfiguration

摘要: Abstract Motivated by the challenge of efficiently reconfiguring distribution networks for power loss reduction, this study presents an approach finding a minimum radial configuration network using ordinal optimization. Ordinal optimization relies on order comparison and goal softening to make problem solution easier computation more efficient. The successful application such complex required investigation several algorithmic parameters. algorithm was implemented in software package, where acceptable is considered good enough if it top m% solutions with probability P. Testing 33- 136-bus systems, minimal results were obtained 33-bus system that are 0.03% search space. Comparing experimental other recently published methods showed effectiveness calculations motiv...