Binary Particle Swarm Optimization Algorithm for Euclidean Steiner Tree
The Euclidean Steiner tree problem is a well-known combinatorial optimization problem and also an NP hard problem. This article focuses on the problem of using Euclidean distance to solve the Steiner tree problem using binary particle swarm optimization algorithm. The algorithm first extracts the se...
Uloženo v:
| Vydáno v: | 2024 4th International Conference on Computer Science and Blockchain (CCSB) s. 417 - 422 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
06.09.2024
|
| Témata: | |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | The Euclidean Steiner tree problem is a well-known combinatorial optimization problem and also an NP hard problem. This article focuses on the problem of using Euclidean distance to solve the Steiner tree problem using binary particle swarm optimization algorithm. The algorithm first extracts the selected Steiner points from the global optimal solution and converts them into corresponding original node numbers. Then use binary encoding to indicate whether each particle has selected the corresponding Steiner point. Finally, the effectiveness and feasibility of the algorithm were verified through the problem of setting up a communication network, and the test results showed that the algorithm has good solving performance. |
|---|---|
| AbstractList | The Euclidean Steiner tree problem is a well-known combinatorial optimization problem and also an NP hard problem. This article focuses on the problem of using Euclidean distance to solve the Steiner tree problem using binary particle swarm optimization algorithm. The algorithm first extracts the selected Steiner points from the global optimal solution and converts them into corresponding original node numbers. Then use binary encoding to indicate whether each particle has selected the corresponding Steiner point. Finally, the effectiveness and feasibility of the algorithm were verified through the problem of setting up a communication network, and the test results showed that the algorithm has good solving performance. |
| Author | Cao, Shuxian Gou, Jiaojiao Chen, Jingrong |
| Author_xml | – sequence: 1 givenname: Shuxian surname: Cao fullname: Cao, Shuxian email: 2401145362@qq.com organization: Lanzhou Jiaotong University, School of Mathematics and Physics,Lanzhou,P.R. China – sequence: 2 givenname: Jingrong surname: Chen fullname: Chen, Jingrong email: chenjr@mail.lzjtu.cn organization: Lanzhou Jiaotong University, School of Mathematics and Physics,Lanzhou,P.R. China – sequence: 3 givenname: Jiaojiao surname: Gou fullname: Gou, Jiaojiao email: 2208917690@qq.com organization: Lanzhou Jiaotong University, School of Mathematics and Physics,Lanzhou,P.R. China |
| BookMark | eNo1j1FLwzAUhSPog879A8H8gdab5DZtHrcypzCY0L6PtL3RQJuOGBH99RbUp8OBj8N3bthlmAMxdi8gFwLMQ103W61Qq1yCxFxAqQqNeMHWpjSVKmCpBchrtt_6YOMXf7Ex-X4k3nzaOPHjOfnJf9vk58A34-scfXqbuJsj3330ox_IBt4k8oEibyPRLbtydnyn9V-uWPu4a-un7HDcP9ebQ-aNSJnBngR2IAo1GJK9Gww4NFUxVEhQElFXSddpEoAGtHFaukFj5WSJpQJSK3b3O-sX9nSOflrkT__31A-BzUo7 |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/CCSB63463.2024.10735644 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) 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 | 9798350356502 |
| EndPage | 422 |
| ExternalDocumentID | 10735644 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IL CBEJK RIE RIL |
| ID | FETCH-LOGICAL-i91t-94ce14b0153d9e2cfd90f4985d84e07eeeb82fb6e1049069f62fd648f274730e3 |
| IEDL.DBID | RIE |
| IngestDate | Wed Jan 15 06:21:32 EST 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i91t-94ce14b0153d9e2cfd90f4985d84e07eeeb82fb6e1049069f62fd648f274730e3 |
| PageCount | 6 |
| ParticipantIDs | ieee_primary_10735644 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-Sept.-6 |
| PublicationDateYYYYMMDD | 2024-09-06 |
| PublicationDate_xml | – month: 09 year: 2024 text: 2024-Sept.-6 day: 06 |
| PublicationDecade | 2020 |
| PublicationTitle | 2024 4th International Conference on Computer Science and Blockchain (CCSB) |
| PublicationTitleAbbrev | CCSB |
| PublicationYear | 2024 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| Score | 1.882141 |
| Snippet | The Euclidean Steiner tree problem is a well-known combinatorial optimization problem and also an NP hard problem. This article focuses on the problem of using... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 417 |
| SubjectTerms | Approximation algorithms Binary Communication networks component Encoding Euclidean distance Layout NP-hard problem Optimization Particle swarm optimization Particle Swarm Optimization Algorithm Steiner tree Steiner trees Transforms |
| Title | Binary Particle Swarm Optimization Algorithm for Euclidean Steiner Tree |
| URI | https://ieeexplore.ieee.org/document/10735644 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwIxEG6EePCkRozv9OB1sdstfRyFgJ6QBA7cyG47VRJYzAL6952WRePBg5emaZo-034znfk6hNzrjBmruUsKhYngBd6DHW4Sbm1qC2lRAmcx2IQaDvV0akY1WT1yYQAgOp9BO2SjLd-t7DY8leEJV1kHAbxBGkrJHVmr9tlKmXno9cZdmQmZodrHRXtf-1fclAgbg-N_dnhCWj8EPDr6hpZTcgDlGXnqRu4sHdW7TcefebWkL3jolzWbkj4uXleo7r8tKQqjtL-1i7mDvKTjENQSKjqpAFpkMuhPes9JHQchmZt0kxhhIRUF4nbmDHDrnWFeGN1xWgBTOOhCc19ISIMVTxovuXdSaB8UzoxBdk6a5aqEC0IFyoe5cdI6m4vcAjYEiiEiSS1zYfwlaYVFmL3vfrqY7ed_9Uf5NTkKSx19ruQNaW6qLdySQ_uxma-ru7g_X6DIkqs |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwIxEG4UTfSkRoz47MHrYrftdtujEBAjIgl74EZ221klgcWsoH_ftiwaDx68NE3T9Jn2m-nM10HoRjKitKQmyGKbcJrZezCiKqBahzoT2krgxAebiAcDOR6rYUVW91wYAPDOZ9B0WW_LNwu9ck9l9oTHLLIAvo12Is4pWdO1Kq-tkKjbdnvUEowLZhU_ypub-r8ip3jg6B78s8tDVP-h4OHhN7gcoS0ojtF9y7Nn8bDabzz6TMs5frbHfl7xKfHd7GVhFf7XObbiKO6s9GxqIC3wyIW1hBInJUAdJd1O0u4FVSSEYKrCZaC4hpBnFrmZUUB1bhTJuZKRkRxIbAedSZpnAkJnxxMqFzQ3gsvcqZyMADtBtWJRwCnC3EqIqTJCG53yVINtCGJiMUlIkXKVN1DdLcLkbf3XxWQz_7M_yq_RXi956k_6D4PHc7Tvlt17YIkLVFuWK7hEu_pjOX0vr_xefQFxxpXy |
| 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=2024+4th+International+Conference+on+Computer+Science+and+Blockchain+%28CCSB%29&rft.atitle=Binary+Particle+Swarm+Optimization+Algorithm+for+Euclidean+Steiner+Tree&rft.au=Cao%2C+Shuxian&rft.au=Chen%2C+Jingrong&rft.au=Gou%2C+Jiaojiao&rft.date=2024-09-06&rft.pub=IEEE&rft.spage=417&rft.epage=422&rft_id=info:doi/10.1109%2FCCSB63463.2024.10735644&rft.externalDocID=10735644 |