Advertisement
Published in:
2005 | OriginalPaper | Chapter
Multi-objective Go with the Winners Algorithm: A Preliminary Study
Authors : Carlos A. Brizuela, Everardo Gutiérrez
Published in: Evolutionary Multi-Criterion Optimization
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
This paper introduces a new algorithm to deal with multi-objective combinatorial and continuous problems. The algorithm is an extension of a previous one designed to deal with single objective combinatorial problems. The original purpose of the single objective version was to study in a rigorous way the properties the search graph of a particular problem needs to hold so that a randomized local search heuristic can find the optimum with high probability. The extension of these results to better understand multi-objective combinatorial problems seems to be a promising line of research. The work presented here is a first small step in this direction. A detailed description of the multi-objective version is presented along with preliminary experimental results on a well known combinatorial problem. The results show that the algorithm has the desired characteristics.