A Piecewise Solution to the Reconfiguration Problem by a Minimal Spanning Tree Algorithm

References

1. SwarnkarNG. A novel codification for meta-heuristic techniques used in distribution network reconfiguration. Electric Power Syst Res Integr2011;81:1619–26.10.1016/j.epsr.2011.03.020Search in Google Scholar

2. HuY. Research on distribution network reconfiguration. In: Proceedings of the international conference on computer, mechatronics, control and electronic engineering (CMCE), volume 1, 2010:176–80.Search in Google Scholar

3. MendesA. Switch and tap-changer reconfiguration of distribution networks using evolutionary algorithms. Power Syst IEEE Trans2013;28:85–92.10.1109/TPWRS.2012.2194516Search in Google Scholar

4. AbdelazizA. Distribution system reconfiguration using a modified Tabu search algorithm. Electric Power Syst Res2010;80:943–53.10.1016/j.epsr.2010.01.001Search in Google Scholar

5. FrancoJ. An efficient implementation of Tabu search in feeder reconfiguration of distribution systems. In: Power and energy society general meeting, 2012 IEEE, 2012:1–8.10.1109/PESGM.2012.6345048Search in Google Scholar

6. Garcia-MartinezS. Reconfiguration of power systems by applying Tabu search to minimize voltage sag indexes. In: North American power symposium (NAPS), 2011:1–6.10.1109/NAPS.2011.6025100Search in Google Scholar

7. CarpanetoE. Distribution system minimum loss reconfiguration in the hyper-cube ant colony optimization framework. Electric Power Syst Res2008;78:2037–45. Special Issue Papers Presented at the 6th World Energy System Conference, 6th World Energy System Conference.10.1016/j.epsr.2008.06.009Search in Google Scholar

8. NiknamT. A new approach based on ant colony algorithm to distribution management system with regard to dispersed generation. In Proceedings of the 18th international conference and exhibition electricity distribution CIRED 2005, 2005:1–5.10.1049/cp:20051242Search in Google Scholar

9. NiknamT. A new approach based on ant colony algorithm to distribution management system with regard to dispersed generation. Energy Conversion Manage2008;49:3417–34, 1–5.Search in Google Scholar

10. NiknamT. A hybrid evolutionary algorithm for distribution feeder reconfiguration. SADHANA2010;35:135–62.10.1007/s12046-010-0023-zSearch in Google Scholar

11. ScennaF, AnautD, PassoniL, MeschinoG. Reconfiguration of electrical networks by an ant colony optimization algorithm. Latin America Trans IEEE (Revista IEEE America Latina)2013;11:538–44.10.1109/TLA.2013.6502858Search in Google Scholar

12. LiY. Multi-region distribution system reconfiguration based on an improved ant colony algorithm. In: Power and energy engineering conference (APPEEC), 2012 Asia-Pacific, 2012:1–5.10.1109/APPEEC.2012.6307703Search in Google Scholar

13. DahalanW. Network reconfiguration for loss reduction with distributed generations using PSO. In: 2012 IEEE international conference on power and energy (PECon), 2012:823–8.10.1109/PECon.2012.6450331Search in Google Scholar

14. Kiran KumarK. Global optimal solution for network reconfiguration problem using AMPSO algorithm. In: 2012 IEEE international conference on power system technology (POWERCON), 2012:1–7.10.1109/PowerCon.2012.6401322Search in Google Scholar

15. GaingZ-L. Particle swarm optimization to solving the economic dispatch considering the generator constraints. IEEE Trans Power Syst2003;18:1187–95.10.1109/TPWRS.2003.814889Search in Google Scholar

16. WuW-C. A new binary coding particle swarm optimization for feeder reconfiguration. In: Proceedings of the international conference on intelligent systems applications to power systems ISAP, 2007:1–6.10.1109/ISAP.2007.4441672Search in Google Scholar

17. HappHH. Diakoptics-the solution of system problems by tearing. Proc IEEE1974;62:930–40.10.1109/PROC.1974.9545Search in Google Scholar

18. CattersonV. Practical applications of multi-agent systems in electric power system. Eur Trans Electrical Power2012;2012:235–52.10.1002/etep.619Search in Google Scholar

19. CattersonV. Agents for active network management and condition monitoring in the smart grid. In: 9th international conference on autonomous agents and multiagent systems, Toronto, ON, Canada, 2010.Search in Google Scholar

20. JenningsNR. Intelligent agents. Cambridge, MA: The MIT Press, 1999.Search in Google Scholar

21. McArthurS. Multi-agent systems for power engineering applications-part 1: concepts, approaches and technical challenges. Power Syst IEEE Trans2007;22:1743–52.10.1109/TPWRS.2007.908471Search in Google Scholar

22. McArthurS. Multi-agent systems for power engineering applications-part 2: technologies, standards and tools for building multi-agent systems. Power Syst IEEE Trans2007;22:1753–9.10.1109/TPWRS.2007.908472Search in Google Scholar

23. CoulourisG. Distributed systems: concepts and design. International computer science series. United States of America: Addison-Wesley, 2005.Search in Google Scholar

24. KruskalJB. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc Am Math Soc1956;7:48–50.10.1090/S0002-9939-1956-0078686-7Search in Google Scholar

25. SuC-T, ChangC-F, ChiouJ-P. Distribution network reconfiguration for loss reduction by ant colony search algorithm. Electric Power Syst Res2005;75:190–9.10.1016/j.epsr.2005.03.002Search in Google Scholar

26. BalabanianN, BickartTA. Electrical network theory. New York, USA: John Wiley & Sons, 1969.Search in Google Scholar

27. ChungS. Parallel implementation of Bouvka’s minimum spanning tree algorithm. In: Proceedings of the 10th international parallel processing symposium, IPPS, 1996:302–8.Search in Google Scholar

28. DimitrijevicS. An innovative approach for solving the restoration problem in distribution networks. Electric Power Syst Res2011;81:1961–72.10.1016/j.epsr.2011.06.005Search in Google Scholar

29. FredmanML. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J Comput Syst Sci1994;48:533–51.10.1016/S0022-0000(05)80064-9Search in Google Scholar

30. BentleyJL. A parallel algorithm for constructing minimum spanning trees. J Algorithms1980;1:51–9.10.1016/0196-6774(80)90004-8Search in Google Scholar

31. CormenTH, LeisersonCE, RivestRL, SteinC. Introduction to Algorithms, 3rd ed. United States of America: MIT Press, 2009.Search in Google Scholar

32. MantovaniF. Reconfiguracao de sistemas de distribuicao radiais utilizando o critério de queda de tenscao. Controle Atomacao2000;11:150–9.Search in Google Scholar

33. CarrenoEM. An efficient codification to solve distribution network reconfiguration for loss reduction problem. IEEE Power Energy Soc Gen Meet2008;23:1542–51.10.1109/TPWRS.2008.2002178Search in Google Scholar

34. CebrianJC. Reconfiguration of distribution networks to minimize loss and disruption costs using genetic algorithms. Electric Power Syst Res2010;80:53–62.10.1016/j.epsr.2009.08.005Search in Google Scholar

35. LoboFG, GoldbergDE, PelikanM. Time complexity of genetic algorithms on exponentially scaled problems. Illinois Genetic Algorithms Laboratory, Department of General Engineering, University of Illinois at Urbana-Champaign, 2000.Search in Google Scholar