Global Convexity in the Bi-Criteria Traveling Salesman Problem Export

@incollection{citeulike:4834515, 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.}, author = {Villagra, Marcos and Bar\'{a}n, Benjam\'{\i}n and G\'{o}mez, Osvaldo}, citeulike-article-id = {4834515}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/978-0-387-34747-9_23}, citeulike-linkout-1 = {http://www.springerlink.com/content/h669100gp4858546}, doi = {10.1007/978-0-387-34747-9_23}, journal = {Artificial Intelligence in Theory and Practice}, keywords = {convexity, global, multi-objective, optimization, problem, salesman, traveling}, pages = {217--226}, posted-at = {2009-06-13 09:23:54}, priority = {0}, title = {Global Convexity in the Bi-Criteria Traveling Salesman Problem}, url = {http://dx.doi.org/10.1007/978-0-387-34747-9_23}, year = {2006} }

TY - CHAP ID - citeulike:4834515 L3 - citeulike-article-id:4834515 N2 - 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. JF - Artificial Intelligence in Theory and Practice EP - 226 TI - Global Convexity in the Bi-Criteria Traveling Salesman Problem SP - 217 KW - convexity KW - global KW - multi-objective KW - optimization KW - problem KW - salesman KW - traveling AU - Villagra, Marcos AU - Barán, Benjamín AU - Gómez, Osvaldo PY - 2006/// UR - http://dx.doi.org/10.1007/978-0-387-34747-9_23 ER -