Efficient Hill Climber for Multi-Objective Pseudo-Boolean Optimization

Local search algorithms and iterated local search algorithms are a basic technique. Local search can be a stand-alone search method, but it can also be hybridized with evolutionary algorithms. Recently, it has been shown that it is possible to identify improving moves in Hamming neighborhoods for k-bounded pseudo-Boolean optimization problems in constant time. This means that local search does not need to enumerate neighborhoods to find improving moves. It also means that evolutionary algorithms do not need to use random mutation as a operator, except perhaps as a way to escape local optima. In this paper, we show how improving moves can be identified in constant time for multiobjective problems that are expressed as k-bounded pseudo-Boolean functions. In particular, multiobjective forms of NK Landscapes and Mk Landscapes are considered.

[1]  Éric D. Taillard,et al.  Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..

[2]  R. Otter The Number of Trees , 1948 .

[3]  Thomas Stützle,et al.  Anytime Pareto local search , 2015, Eur. J. Oper. Res..

[4]  Joshua D. Knowles A summary-attainment-surface plotting method for visualizing the performance of stochastic multiobjective optimizers , 2005, 5th International Conference on Intelligent Systems Design and Applications (ISDA'05).

[5]  Thomas Stützle,et al.  Stochastic Local Search: Foundations & Applications , 2004 .

[6]  Doug Hains,et al.  Second order partial derivatives for NK-landscapes , 2013, GECCO '13.

[7]  Pierre Hansen,et al.  The basic algorithm for pseudo-Boolean programming revisited , 1988, Discret. Appl. Math..

[8]  William F. Punch,et al.  Gray-Box Optimization using the Parameter-less Population Pyramid , 2015, GECCO.

[10]  Andrew M. Sutton,et al.  Efficient identification of improving moves in a ball for pseudo-boolean problems , 2014, GECCO.

[11]  Thomas Stützle,et al.  On local optima in multiobjective combinatorial optimization problems , 2007, Ann. Oper. Res..

[12]  L. Darrell Whitley Mk Landscapes, NK Landscapes, MAX-kSAT: A Proof that the Only Challenging Problems are Deceptive , 2015, GECCO.

[13]  L. Darrell Whitley,et al.  Constant time steepest descent local search with lookahead for NK-landscapes and MAX-kSAT , 2012, GECCO '12.

[14]  L. Darrell Whitley,et al.  Test Function Generators as Embedded Landscapes , 1998, FOGA.

[15]  Doug Hains,et al.  Greedy or Not? Best Improving versus First Improving Stochastic Local Search for MAXSAT , 2013, AAAI.

[16]  Kiyoshi Tanaka,et al.  Insights on properties of multiobjective MNK-landscapes , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).