Global convexity in the bi-criteria Traveling Salesman problem

This work studies the solution space topology of the Traveling Salesman Problem or TSP, as a bi-objective optimization problem. The concepts of category and range of a solution are introduced for the first time in this analysis. These concepts relate each solution of a population to a Pareto set, p...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Barán, Benjamín, Gómez, Osvaldo, Villagra, Marcos
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2006
Materias:
Ciencias Informáticas
Heuristic methods
traveling salesman problem
multi-objective optimization
global convexity
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/23912
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-23912
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Heuristic methods
traveling salesman problem
multi-objective optimization
global convexity
spellingShingle Ciencias Informáticas
Heuristic methods
traveling salesman problem
multi-objective optimization
global convexity
Barán, Benjamín
Gómez, Osvaldo
Villagra, Marcos
Global convexity in the bi-criteria Traveling Salesman problem
topic_facet Ciencias Informáticas
Heuristic methods
traveling salesman problem
multi-objective optimization
global convexity
description This work studies the solution space topology of the Traveling Salesman Problem or TSP, as a bi-objective optimization problem. The concepts of category and range of a solution are introduced for the first time in this analysis. These concepts relate each solution of a population to a Pareto set, presenting a more rigorous theoretical framework than previous works studying global convexity for the multi-objective TSP. The conjecture of a globally convex structure for the solution space of the bi-criteria TSP is confirmed with the results presented in this work. This may support successful applications using state of the art metaheuristics based on Ant Colony or Evolutionary Computation.
format Objeto de conferencia
Objeto de conferencia
author Barán, Benjamín
Gómez, Osvaldo
Villagra, Marcos
author_facet Barán, Benjamín
Gómez, Osvaldo
Villagra, Marcos
author_sort Barán, Benjamín
title Global convexity in the bi-criteria Traveling Salesman problem
title_short Global convexity in the bi-criteria Traveling Salesman problem
title_full Global convexity in the bi-criteria Traveling Salesman problem
title_fullStr Global convexity in the bi-criteria Traveling Salesman problem
title_full_unstemmed Global convexity in the bi-criteria Traveling Salesman problem
title_sort global convexity in the bi-criteria traveling salesman problem
publishDate 2006
url http://sedici.unlp.edu.ar/handle/10915/23912
work_keys_str_mv AT baranbenjamin globalconvexityinthebicriteriatravelingsalesmanproblem
AT gomezosvaldo globalconvexityinthebicriteriatravelingsalesmanproblem
AT villagramarcos globalconvexityinthebicriteriatravelingsalesmanproblem
bdutipo_str Repositorios
_version_ 1764820466393939969

Ejemplares similares