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

Podrobná bibliografia

Vydané v:	2024 4th International Conference on Computer Science and Blockchain (CCSB) s. 417 - 422
Hlavní autori:	Cao, Shuxian, Chen, Jingrong, Gou, Jiaojiao
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 06.09.2024
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!