We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Iterated local search algorithms for the Euclidean Steiner tree problem in n dimensions.
- Authors
do Forte, Vinícius Leal; Montenegro, Flávio Marcelo Tavares; Brito, José André de Moura; Maculan, Nelson
- Abstract
We propose algorithmic frameworks based on the iterated local search (ILS) metaheuristic to obtain good-quality solutions for the Euclidean Steiner tree problem (ESTP) in n dimensions. This problem consists in finding a tree with minimal total length that spans p points given in an n-dimensional Euclidean space and, eventually, also some additional points whose insertion contributes to reduce the total length of the tree. These ILS approaches make use of both the tree enumeration structure, called topology-describing vector, and the exact minimization step of a well-known branch-and-bound method for the ESTP. Computational results are provided.
- Subjects
SEARCH algorithms; METAHEURISTIC algorithms; STEINER systems; EUCLIDEAN distance; BRANCH &; bound algorithms
- Publication
International Transactions in Operational Research, 2016, Vol 23, Issue 6, p1185
- ISSN
0969-6016
- Publication type
Article
- DOI
10.1111/itor.12168