Application of Enhanced Particle Swarm Optimization in Euclidean Steiner Tree Problem Solving in R N

Abstract

Given a fixed set of points in a N-dimensional space (N ≥ 3) with Euclidean metrics, the Euclidean Steiner Tree Problem in RN consists of finding a minimum length tree that spans all these points using, if necessary, extra points (Steiner points). The finding of such solution is a NP-hard problem. This paper presents a modified metaheuristic based on Improved Particle Swarm Optimization to the problem considered. Finally, computational experiments compare the performance of the proposed heuristic, considering solution’s quality and computational time, in regard to previous works in the literature.