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. © 2006 International Federation for Information Processing.
CITATION STYLE
Villagra, M., Barán, B., & Gómez, O. (2006). Global convexity in the bi-criteria Traveling Salesman Problem. IFIP International Federation for Information Processing, 217, 217–226. https://doi.org/10.1007/978-0-387-34747-9_23
Mendeley helps you to discover research relevant for your work.