Abstract
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.
Chapter PDF
Similar content being viewed by others
References
C. Blum, and A. Roli, Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison, ACM Computing Surveys (CSUR), 35(3), 268–308 (2003).
P.C. Borges, and P.H. Hansen, A Study of Global Convexity for a Multiple Objective Traveling Salesman Problem, edited by C.C. Ribeiro and P. Hansen, (Essays and Surveys in Metaheuristics, Kluwer, 2000), pp. 129–150.
K. Boese, A. Kahng, and S. Muddu, A new Adaptive Multi-Start Technique for Combinatorial Global Optimization, Operations Research Letters, 16, 101–113 (1994).
K. Boese, Cost versus Distance in the Traveling Salesman Problem, Computer Science Department, University of California, Technical Report No. 950018, 1995.
T. Stützle, and H.H. Hoos, Max-Min Ant System, Future Generation Computer Systems, 16(8), 889–914 (2000).
B. Barán, P. Gardel, and O. Gómez, Estudio del Espacio de Soluciones del Problema del Cajero Viajante, edited by M. Solar, D. Fernández and E. Cuadros-Vargas, (CLEI 2004, Arequipa, Perú, 2004), pp. 745–756.
O. Gómez, and B. Barán, Reasons of ACO’s Success in TSP, edited by M. Dorigo, M. Birattari, C. Blum, L. Gambardella, F. Mondada and T. Stüzle, (Ant Colony Optimization and Swarm Intelligence, 4th International Workshop, ANTS 2004), pp. 226–237.
L. Paquete, M. Chiarandini, and T. Stützle, A Study of Local Optima in the Biobjective Travelling Salesman Problem, Computer Science Department, Darmstadt University of Technology, Technical Report No. AIDA-02-07, 2002 (Presented at the Multi-Objective Metaheuristics Workshop, MOMH 2002).
M. Villagra, B. Barán, and O. Gómez, Convexidad Global en el Problema del Cajero Viajante Bi-Objetivo, Centro Nacional de Computación, Universidad Nacional de Asuncion. Technical Report No. 001/05, 2005 (unpublished); http://www.cnc.una.py.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Villagra, M., Barán, B., Gómez, O. (2006). Global Convexity in the Bi-Criteria Traveling Salesman Problem. In: Bramer, M. (eds) Artificial Intelligence in Theory and Practice. IFIP AI 2006. IFIP International Federation for Information Processing, vol 217. Springer, Boston, MA . https://doi.org/10.1007/978-0-387-34747-9_23
Download citation
DOI: https://doi.org/10.1007/978-0-387-34747-9_23
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34654-0
Online ISBN: 978-0-387-34747-9
eBook Packages: Computer ScienceComputer Science (R0)