×

zbMATH — the first resource for mathematics

Algorithm for cataloging topologies in the common information model (CIM). (English) Zbl 1217.90003
Summary: This paper presents a novel algorithm for finding the catalog of topologies in a power system’s model in the common information model (CIM) format. The algorithm prepares the models of complex, large-scale power systems (e.g., Smart Grids with renewable energy sources) and allows analytic distribution management system (DMS) functions to achieve high performance and optimize the power system operation in real time. It utilizes the Ullmann graph isomorphism algorithm to find unique topologies. In addition, it is optimized for parallel execution on 64-bit, multi-processor computers. Its ability to handle large amounts of data was verified on detailed, real-life electric power system data.
MSC:
90-04 Software, source code, etc. for problems pertaining to operations research and mathematical programming
90B18 Communication networks in operations research
90B10 Deterministic network models in operations research
05C90 Applications of graph theory
Software:
VFLib
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Santacana, E.; Rackliffe, G.; Tang, L.; Feng, X., Getting smart, IEEE power and energy magazine, 8, 41-48, (2010)
[2] Srinivasa Rao, R.; Narasimham, S.V.L.; Ramalinga Raju, M.; Srinivasa Rao, A., Optimal network reconfiguration of large-scale distribution system using harmony search algorithm, IEEE transactions on power systems, 99, (2010)
[3] Popović, D.S.; Čalović, M.S.; Levi, V.A., Voltage reactive security analysis in power systems with automatic secondary voltage control, IEE Proceedings generation, transmission and distribution, 141, 177-183, (1994)
[4] Popović, D.S.; Popović, Z.N., A risk management procedure for supply restoration in distribution networks, IEEE transactions on power systems, 19, 221-228, (2004)
[5] IEC task group 13. Energy management system application program interface (EMS-API)—part 301, Common Information Model, CIM, Base—Revision 4, 2006.
[6] Popović, D.S.; Varga, E.; Perlić, Z., Extension of the common information model with a catalog of topologies, IEEE transactions on power systems, 22, 770-777, (2007)
[7] Ullmann, J.R., An algorithm for subgraph isomorphism, Journal of the association for computing machinery, 23, 31-42, (1976) · Zbl 0323.05138
[8] Fujisawa, J., Weighted degrees and heavy cycles in weighted graphs, Discrete mathematics, 309, 217-229, (2009)
[9] Barbay, J.; Aleardi, L.C.; Hel, M.; Munro, J.I., Algorithms and computation, (2007), Springer Berlin, Heidelberg
[10] P. Foggia, C. Sansone, M. Vento, A performance comparison of five algorithms for graph isomorphism, in: Workshop on Graph-Based Representations in Pattern Recognition, Ischia, Italy, 2001.
[11] Cordella, L.P.; Foggia, P.; Sansone, C.; Vento, M.A., (sub) graph isomorphism algorithm for matching large graphs, IEEE transactions on pattern analysis and machine intelligence, 26, 1367-1372, (2004)
[12] The VFLib graph matching library, version 2.0. http://amalfi.dis.unina.it/graph/ (accessed of 06.10.10).
[13] Umeyama, S., An eigendecomposition approach to weighted graph matching problems, IEEE transactions on pattern analysis and machine intelligence, 10, 695-703, (1988) · Zbl 0678.05049
[14] G.M. Amdahl, Validity of the single processor approach to achieving large scale computing capabilities, in: AFIPS, American Federation of Information Processing Societies, Spring Joint Computer Conference, Atlantic City, USA, 1967.
[15] H. Blaar, M. Karnstedt, T. Lange, R.A. Winter, Metalevel component-based framework for distributed computing applications, in: Fourth Annual ACIS International Conference on Computer and Information Science, Jeju Island, South Korea, 2005.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.