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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2024 4th International Conference on Computer Science and Blockchain (CCSB) s. 417 - 422
Hlavní autoři: Cao, Shuxian, Chen, Jingrong, Gou, Jiaojiao
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 06.09.2024
Témata:
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
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!
Popis
Shrnutí: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.
DOI:10.1109/CCSB63463.2024.10735644