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

Full description

Bibliographic Details

Published in:	2024 4th International Conference on Computer Science and Blockchain (CCSB) pp. 417 - 422
Main Authors:	Cao, Shuxian, Chen, Jingrong, Gou, Jiaojiao
Format:	Conference Proceeding
Language:	English
Published:	IEEE 06.09.2024
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!