Title :
A new metaheuristic and its application to the Steiner problems in graphs
Author :
Urrutia, Sebastián ; Loiseau, Irene
Author_Institution :
Departamento de Computacion, Buenos Aires Univ., Argentina
Abstract :
Metaheuristics are a set of related ideas that provide a general framework to obtain the approximated solution of combinatorial optimization problems. We present ideas for a new method that we call SN. SN is based on the idea of dividing a given optimization problem into decision subproblems which are easier to solve heuristically. In order to verify the effectiveness of this metaheuristic approach, we developed an algorithm to solve a classic graph theory problem, the Steiner Problem in Graphs. Preliminary results show that the new algorithm is competitive when compared with the best heuristic algorithms known for this problem
Keywords :
function approximation; graph theory; heuristic programming; optimisation; SN; Steiner problems; approximated solution; combinatorial optimization problems; decision subproblems; graph theory; iterative processes; metaheuristic; optimization problem; Genetic algorithms; Graph theory; Heuristic algorithms; Iterative algorithms; Optimization methods; Tin;
Conference_Titel :
Computer Science Society, 2001. SCCC '01. Proceedings. XXI Internatinal Conference of the Chilean
Conference_Location :
Punta Arenas
Print_ISBN :
0-7695-1396-4
DOI :
10.1109/SCCC.2001.972657
