2005 | OriginalPaper | Buchkapitel
Finding Pareto-Optimal Set by Merging Attractors for a Bi-objective Traveling Salesmen Problem
verfasst von : Weiqi Li
Erschienen in: Evolutionary Multi-Criterion Optimization
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.