Paper Info
Title
Solving Euclidean Steiner Tree Problems with Multi Swarm Optimization
Abstract
A new iterative heuristic algorithm, based on Multi Swarm Optimization, is presented for Steiner Tree Problems (STP) in the 2-dimensional Euclidean plane. The basic algorithm is made practical for large instances by applying a result from graph theory, and a well-informed approximation. The algorithm's performance is compared to perfect solutions for the classic Steiner Tree Problem and to a deterministic heuristic for the k-bottleneck STP, a variant of STP. The algorithm often produces near optimal solutions with limited resources. The approach can be applied to higher dimensions and to other variants of the Steiner Tree Problem.
Year
DOI
Venue
2015
10.1145/2739482.2764676
GECCO (Companion)
Field
DocType
Citations 
Graph theory,Heuristic,Mathematical optimization,Heuristic (computer science),Steiner tree problem,Computer science,Depth-first search,Multi-swarm optimization,Euclidean geometry
Conference
0
PageRank 
References 
Authors
0.34
2
3
Name
Order
Citations
PageRank
Tom Decroos1133.31
Patrick De Causmaecker2111.37
bart demoen395677.58