Finding pareto-optimal set by merging attractors for a bi-objective traveling salesmen problem

Authors:
Weiqi Li
Affiliations:
School of Management, University of Michigan-Flint, Flint, Michigan
Venue:
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
Year:
2005

Citing 7
Cited 0

Algorithms for solving the two-criterion large-scale travelling salesman problem

Computational Mathematics and Mathematical Physics
Use of Substitute Scalarizing Functions to Guide a Local Search Based Heuristic: The Case of moTSP

Journal of Heuristics
Evolutionary Algorithms for Multi-Objective Optimization: Performance Assessments and Comparisons

Artificial Intelligence Review
On Weight-Biased Mutation for Graph Problems

PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Multicriteria Optimization

Multicriteria Optimization
A new MOEA for multi-objective TSP and Its convergence property analysis

EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
A two-phase local search for the biobjective traveling salesman problem

EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new search procedure to tackle multi-objective traveling salesman problem (TSP). This procedure constructs the solution at-tractor 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 infor-mation about these solutions that will allow a decision-maker to choose a good compromise solution.