Approximating the Pareto Curve with Local Search for the Bicriteria TSP (1, 2) Problem (extended abstract)

Local search has been widely used in combinatorial optimization [3], however in the case of multicriteria optimization almost no results are known concerning the ability of local search algorithms to generate “good” solutions with performance guarantee. In this paper, we introduce such an approach for the classical traveling salesman problem (TSP) problem [13]. We show that it is possible to get in linear time, a \frac3223-approximate Pareto curve using an original local search procedure based on the 2-opt neighborhood, for the bicriteria TSP(1,2) problem where every edge is associated to a couple of distances which are either 1 or 2 [12].ou