scholarly journals Hybrid greedy genetic algorithm for the Euclidean Steiner tree problem

2019 ◽  
Author(s):  
Andrey Oliveira ◽  
Danilo Sanches ◽  
Bruna Osti
Keyword(s):  
Genetic Algorithm ◽  
Steiner Tree ◽  
Optimization Problem ◽  
Spanning Trees ◽  
Evolutionary Strategies ◽  
Steiner Tree Problem ◽  
Minimum Length ◽  
Genetic Operators ◽  
Steiner Points ◽  
Euclidean Steiner Tree Problem

This paper presents a genetic algorithm for the Euclidean Steiner tree problem. This is an optimization problem whose objective is to obtain a minimum length tree to interconnect a set of fixed points, and for this purpose to be achieved, new auxiliary points, called Steiner points, can be added. The proposed heuristic uses a genetic algorithm to manipulate spanning trees, which are then transformed into Steiner trees by inserting and repositioning the Steiner points. Greedy genetic operators and evolutionary strategies are tested. Results of numerical experiments for benchmark library problem (OR-Library) are presented and discussed.This paper presents a genetic algorithm for the Euclidean Steiner tree problem. This is an optimization problem whose objective is to obtain a minimum length tree to interconnect a set of fixed points, and for this purpose to be achieved, new auxiliary points, called Steiner points, can be added. The proposed heuristic uses a genetic algorithm to manipulate spanning trees, which are then transformed into Steiner trees by inserting and repositioning the Steiner points. Greedy genetic operators and evolutionary strategies are tested. Results of numerical experiments for benchmark library problem (OR-Library) are presented and discussed.

A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem

2006 ◽  
Vol 33 (5) ◽  
pp. 1274-1288 ◽  
Author(s):  
Mohamed Haouari ◽  
Jouhaina Chaouachi Siala
Keyword(s):  
Genetic Algorithm ◽  
Steiner Tree ◽  
Steiner Tree Problem ◽  
Prize Collecting
Sign in / Sign up

Export Citation Format

Share Document