Finding Pareto-Optimal Set by Merging Attractors for a Bi-objective Traveling Salesmen Problem


This paper presents a new search procedure to tackle multi-objective traveling salesman problem (TSP). This procedure constructs the solution attractor for each of the objectives respectively. Each attractor contains the best solutions found for the corresponding objective. Then, these attractors are merged to find the Pareto-optimal solutions. The goal of this procedure is not only to generate a set of Pareto-optimal solutions, but also to provide the information about these solutions that will allow a decision-maker to choose a good compromise solution.