Research on Optimal Layout Formation Techniques for Dynamic Planning of Single-Line Diagrams
A method based on dynamic programming algorithm to get the optimal layout solution to realize the generation of single-line diagram of regional power grid is proposed. A topological model is constructed based on the spatial data of the grid, a breadth-first algorithm is implemented to obtain multipl...
Uložené v:
| Vydané v: | 2023 International Conference on Computer Science and Automation Technology (CSAT) s. 538 - 542 |
|---|---|
| Hlavní autori: | , , , , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
06.10.2023
|
| Predmet: | |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | A method based on dynamic programming algorithm to get the optimal layout solution to realize the generation of single-line diagram of regional power grid is proposed. A topological model is constructed based on the spatial data of the grid, a breadth-first algorithm is implemented to obtain multiple adjacency matrices and matrix traversal sequences that can form a connectivity map, and a square range that can accommodate all the equipments is computed based on the width of the adjacency matrices, and a mathematical model is established with the minimum spacing of equipments as the optimization objective. An algorithm for solving the optimal layout of dynamic programming is proposed, which is applied to solve the optimal layout array and finally orthogonalized according to the principle of least-crossing. The application example shows that the layout by the optimal solution is beautiful and efficient. |
|---|---|
| AbstractList | A method based on dynamic programming algorithm to get the optimal layout solution to realize the generation of single-line diagram of regional power grid is proposed. A topological model is constructed based on the spatial data of the grid, a breadth-first algorithm is implemented to obtain multiple adjacency matrices and matrix traversal sequences that can form a connectivity map, and a square range that can accommodate all the equipments is computed based on the width of the adjacency matrices, and a mathematical model is established with the minimum spacing of equipments as the optimization objective. An algorithm for solving the optimal layout of dynamic programming is proposed, which is applied to solve the optimal layout array and finally orthogonalized according to the principle of least-crossing. The application example shows that the layout by the optimal solution is beautiful and efficient. |
| Author | Bu, Xinlian You, Feng Zhou, Hongyu Wu, Qiang Yang, Xiao |
| Author_xml | – sequence: 1 givenname: Hongyu surname: Zhou fullname: Zhou, Hongyu email: hongyuzhou@sgepri.sgcc.com.cn organization: State Grid Corporation of China,Jiangsu,China – sequence: 2 givenname: Feng surname: You fullname: You, Feng email: fengyou@sgepri.sgcc.com.cn organization: NARI Group Corporation,Jiangsu,China – sequence: 3 givenname: Qiang surname: Wu fullname: Wu, Qiang email: qiangwu@sgepri.sgcc.com.cn organization: State Grid Jiangsu Electric Power Co.,LTD.,Jiangsu,China – sequence: 4 givenname: Xiao surname: Yang fullname: Yang, Xiao email: xiaoyang@sgepri.sgcc.com.cn organization: State Grid Jiangsu Electric Power Co.,LTD.,Jiangsu,China – sequence: 5 givenname: Xinlian surname: Bu fullname: Bu, Xinlian email: xinlianbu@sgepri.sgcc.com.cn organization: State Grid Jingjiang Power Supply Company,Jiangsu,China |
| BookMark | eNotj81Kw0AUhUfQhda-QRfzAqlz5zdZltSqEKjYuBPKJLlpB5KZmqSLvL0DdvUtzsfhnCdy74NHQlbA1gAse8kPm1KDlnrNGRdrxkCqO7LMTJYKxYQBKcwj-fnCEe1Qn2nwdH-ZXG87Wtg5XCe6C0NvJxeDEuuzd79XHGkbBrqdve1dTT87673zJxpaeojsMCmcR7p19jTYfnwmD63tRlzeuCDfu9cyf0-K_dtHvikSB5BNSdxTtSazaFojVJMqw2WtueKsklWKDUhtWtQVNFzaplZRMxylFkJFTyqxIKv_XoeIx8sQTwzzEZg0oDWIP0_3UNc |
| CODEN | IEEPAD |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/CSAT61646.2023.00145 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE Xplore IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 9798350371437 |
| EndPage | 542 |
| ExternalDocumentID | 10471661 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IL CBEJK RIE RIL |
| ID | FETCH-LOGICAL-i119t-835bf79ae7f735d85724c62520b4b8ed1467fe6b1d24adc57f772e463354c6453 |
| IEDL.DBID | RIE |
| IngestDate | Wed May 01 11:49:03 EDT 2024 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i119t-835bf79ae7f735d85724c62520b4b8ed1467fe6b1d24adc57f772e463354c6453 |
| PageCount | 5 |
| ParticipantIDs | ieee_primary_10471661 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-Oct.-6 |
| PublicationDateYYYYMMDD | 2023-10-06 |
| PublicationDate_xml | – month: 10 year: 2023 text: 2023-Oct.-6 day: 06 |
| PublicationDecade | 2020 |
| PublicationTitle | 2023 International Conference on Computer Science and Automation Technology (CSAT) |
| PublicationTitleAbbrev | CSAT |
| PublicationYear | 2023 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| Score | 1.8467742 |
| Snippet | A method based on dynamic programming algorithm to get the optimal layout solution to realize the generation of single-line diagram of regional power grid is... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 538 |
| SubjectTerms | Approximation algorithms Computational modeling dynamic programming algorithms Heuristic algorithms Layout layout optimal solutions Power system dynamics Programming regional power grids single-line diagrams Spatial databases topological models |
| Title | Research on Optimal Layout Formation Techniques for Dynamic Planning of Single-Line Diagrams |
| URI | https://ieeexplore.ieee.org/document/10471661 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NSwMxEA1aPHhSseI3OXhNu9nNR3OU1uJBaqEVehDKJpmFQt2Vdiv4752kXfXiwctmWUICE3byJpk3j5C73CFkEyZhiXOOiVR4ZqQFxiE1FoM39IxFFJvQo1FvNjPjHVk9cmEAICafQSe8xrt8X7lNOCrrhrICXIVgZ19rtSVr7ehwPDHd_uR-qkK9rE7QBA93DIGk9Es0Je4Zw6N_znZM2j_sOzr-3ldOyB6Up-S1SZGjVUmf8T9_y5f0Kf-sNjUdNgREOm0qsq4pglE62MrN00aZiFYFnWC7BIYxKNDBIg_JWes2eRk-TPuPbKeMwBacm5ohbLKFNjnoQmfS9yTa22EkkyZW2B744P4KUJb7VOTeSeymUxAqyyT2EzI7I62yKuGcUM-5dwZhGy6mKDJ03QgRlLYSx83wcUHawTTz923xi3ljlcs_vl-Rw2D9mO-mrkmrXm3ghhy4j3qxXt3GJfsCO92ZOQ |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFA4yBT2pOPG3OXjN1rRJuxxlcyjOOViFHYTRJK8wmK1sneB_70u2qhcPXppSQgrv0ZfvNe97HyE3mUHIJlTAAmMME6GwTEkNjEOoNCZvGBlzLzaRDIedyUSNNmR1z4UBAF98Bi1368_ybWlW7ldZ27UV4LFLdralEGGwpmttCHE8UO3u-DaNXcesllMFd6cMjqb0SzbF7xr9_X--74A0f_h3dPS9sxySLSiOyGtdJEfLgj7jl_6Wzekg-yxXFe3XFESa1j1ZlxThKO2tBedprU1Ey5yOcZwDwywUaG-WufKsZZO89O_S7j3baCOwGeeqYgicdJ6oDJI8iaTtSLS4wVwmDLTQHbAuAOYQa25DkVkjcVoSgoijSOI8IaNj0ijKAk4ItZxboxC4oTtFHmHwRpAQJ1riuhFeTknTmWb6vm5_Ma2tcvbH82uye58-DaaDh-HjOdlznvDVb_EFaVSLFVySHfNRzZaLK---L2PSnIA |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2023+International+Conference+on+Computer+Science+and+Automation+Technology+%28CSAT%29&rft.atitle=Research+on+Optimal+Layout+Formation+Techniques+for+Dynamic+Planning+of+Single-Line+Diagrams&rft.au=Zhou%2C+Hongyu&rft.au=You%2C+Feng&rft.au=Wu%2C+Qiang&rft.au=Yang%2C+Xiao&rft.date=2023-10-06&rft.pub=IEEE&rft.spage=538&rft.epage=542&rft_id=info:doi/10.1109%2FCSAT61646.2023.00145&rft.externalDocID=10471661 |