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

Ejemplares similares

Ejemplares similares