Generalized adaptive pursuit algorithm for genetic pareto local search algorithms

The standard adaptive pursuit technique (AP) shows preference for a single operator at a time but is not able to simultaneously pursue multiple operators. We generalize AP by allowing any target distribution to be pursued for operator selection probabilities. We call this the generalized adaptive pursuit algorithm (GAPA). We show that the probability matching and multi-armed bandit strategies, with particular settings, can be integrated in the GAPA framework. We propose and experimentally test two instances of GAPA. Assuming that there are multiple useful operators, the multi-operator AP pursues them all simultaneously. The multi-layer AP is intended to scale up the pursuit algorithm to a large set of operators. To experimentally test the proposed GAPA instances, we introduce the adaptive genetic Pareto local search (aGPLS) that selects on-line genetic operators to restart the Pareto local search. We show on a bi-objective Quadratic assignment problem (bQAP) instance with a large number of facilities and high correlation that aGPLSs are the algorithms with best performance tested.