A new metaheuristic and its application to the Steiner problems in graphs

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 a...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Urrutia, Sebastián, Loiseau, Irene
Publicado:	2001
Materias:	Combinatorial optimization Graph theory Heuristic algorithms Approximated solutions Combinatorial optimization problems ITS applications Meta heuristics Meta-heuristic approach Metaheuristic Optimization problems Steiner problems Optimization
Acceso en línea:	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15224902_v2001-January_n_p273_Urrutia http://hdl.handle.net/20.500.12110/paper_15224902_v2001-January_n_p273_Urrutia
Aporte de:	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

id	paper:paper_15224902_v2001-January_n_p273_Urrutia
record_format	dspace
spelling	paper:paper_15224902_v2001-January_n_p273_Urrutia2023-06-08T16:19:23Z A new metaheuristic and its application to the Steiner problems in graphs Urrutia, Sebastián Loiseau, Irene Combinatorial optimization Graph theory Heuristic algorithms Approximated solutions Combinatorial optimization problems ITS applications Meta heuristics Meta-heuristic approach Metaheuristic Optimization problems Steiner problems Optimization 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. © 2001 IEEE. Fil:Urrutia, S. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Fil:Loiseau, I. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. 2001 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15224902_v2001-January_n_p273_Urrutia http://hdl.handle.net/20.500.12110/paper_15224902_v2001-January_n_p273_Urrutia
institution	Universidad de Buenos Aires
institution_str	I-28
repository_str	R-134
collection	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic	Combinatorial optimization Graph theory Heuristic algorithms Approximated solutions Combinatorial optimization problems ITS applications Meta heuristics Meta-heuristic approach Metaheuristic Optimization problems Steiner problems Optimization
spellingShingle	Combinatorial optimization Graph theory Heuristic algorithms Approximated solutions Combinatorial optimization problems ITS applications Meta heuristics Meta-heuristic approach Metaheuristic Optimization problems Steiner problems Optimization Urrutia, Sebastián Loiseau, Irene A new metaheuristic and its application to the Steiner problems in graphs
topic_facet	Combinatorial optimization Graph theory Heuristic algorithms Approximated solutions Combinatorial optimization problems ITS applications Meta heuristics Meta-heuristic approach Metaheuristic Optimization problems Steiner problems Optimization
description	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. © 2001 IEEE.
author	Urrutia, Sebastián Loiseau, Irene
author_facet	Urrutia, Sebastián Loiseau, Irene
author_sort	Urrutia, Sebastián
title	A new metaheuristic and its application to the Steiner problems in graphs
title_short	A new metaheuristic and its application to the Steiner problems in graphs
title_full	A new metaheuristic and its application to the Steiner problems in graphs
title_fullStr	A new metaheuristic and its application to the Steiner problems in graphs
title_full_unstemmed	A new metaheuristic and its application to the Steiner problems in graphs
title_sort	new metaheuristic and its application to the steiner problems in graphs
publishDate	2001
url	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15224902_v2001-January_n_p273_Urrutia http://hdl.handle.net/20.500.12110/paper_15224902_v2001-January_n_p273_Urrutia
work_keys_str_mv	AT urrutiasebastian anewmetaheuristicanditsapplicationtothesteinerproblemsingraphs AT loiseauirene anewmetaheuristicanditsapplicationtothesteinerproblemsingraphs AT urrutiasebastian newmetaheuristicanditsapplicationtothesteinerproblemsingraphs AT loiseauirene newmetaheuristicanditsapplicationtothesteinerproblemsingraphs
_version_	1768542661701009408

A new metaheuristic and its application to the Steiner problems in graphs

Ejemplares similares