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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	2024 4th International Conference on Computer Science and Blockchain (CCSB) S. 417 - 422
Hauptverfasser:	Cao, Shuxian, Chen, Jingrong, Gou, Jiaojiao
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 06.09.2024
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!