2012 · 19 citations · 9 references
Natural SciencesMathematicsAlgorithmsDecision TheoryOptimizationAssignment ProblemsCombinatorial OptimizationEvolutionary ComputationExploration-exploitation TradeoffHeuristic SearchMetaheuristic OptimizationAdaptive Operator SelectionEvolutionary AlgorithmsEvolutionary SearchExploration-exploitation Trade-offLocal SearchLocal Search AlgorithmsOperatorsPareto Dominance
This paper deals with the adaptive selection of operators in the context of local search (LS). In evolutionary algorithms, diversity is a key concept. We consider a related idea: the similarity between the candidate solution and the solutions in the search trajectory. This notion, together with the solution quality, is used to evaluate the performance of each operator. A new utility measure for LS operators, evaluating relative distances between the operators, is introduced. It is compared with an existing measure based on the Pareto dominance relationship using some basic selection schemes. An adaptive version of the algorithm is also examined. The proposed methods are tested on the Quadratic Assignment Problem and Asymmetric Traveling Salesman Problem.
9
TSPLIB—A Traveling Salesman Problem Library
Gerhard Reinelt · INFORMS Journal on Computing · 1991 · 2.6K citations
Robust taboo search for the quadratic assignment problem
Éric D. Taillard · Parallel Computing · 1991 · 830 citations
Roberto Battiti, Giampietro Tecchiolli · INFORMS Journal on Computing · 1994 · 806 citations · Full text
An adaptive pursuit strategy for allocating operator probabilities
Dirk Thierens · 2005 · 217 citations