Advertisement

Efficient Hill Climber for Multi-Objective Pseudo-Boolean Optimization

  • Francisco Chicano
  • Darrell Whitley
  • Renato Tinós
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9595)

Abstract

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.

Keywords

Hamming Ball Hill Climber Delta evaluation Multi-objective optimization Local search 

References

  1. 1.
    Aguirre, H.E., Tanaka, K.: Insights on properties of multiobjective MNK-landscapes. In: Proceedings of the Congress on Evolutionary Computation, vol. 1, pp. 196–203, June 2004Google Scholar
  2. 2.
    Chen, W., Whitley, D., Hains, D., Howe, A.: Second order partial derivatives for NK-landscapes. In: Proceeding of GECCO, pp. 503–510. ACM, New York (2013)Google Scholar
  3. 3.
    Chicano, F., Whitley, D., Sutton, A.M.: Efficient identification of improving moves in a ball for pseudo-boolean problems. In: Proceedings of Genetic and Evolutionary Computation Conference, pp. 437–444. ACM, New York (2014)Google Scholar
  4. 4.
    Crama, Y., Hansen, P., Jaumard, B.: The basic algorithm for pseudo-boolean programming revisited. Discrete Appl. Math. 29(2–3), 171–185 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Dubois-Lacoste, J., López-Ibáñez, M., Stützle, T.: Anytime pareto local search. Eur. J. Oper. Res. 243(2), 369–385 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Goldman, B.W., Punch, W.F.: Gray-box optimization using the parameter-less population pyramid. In: Proceedings of Genetic and Evolutionary Computation Conference, pp. 855–862. ACM, New York (2015)Google Scholar
  7. 7.
    Heckendorn, R., Rana, S., Whitley, D.: Test function generators as embedded landscapes. In: Foundations of Genetic Algorithms, pp. 183–198. Morgan Kaufmann (1999)Google Scholar
  8. 8.
    Hoos, H.H., Stützle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufman, San Francisco (2004)zbMATHGoogle Scholar
  9. 9.
    Knowles, J.: A summary-attainment-surface plotting method for visualizing the performance of stochastic multiobjective optimizers. In: Proceedings of Intelligent Systems Design and Applications, pp. 552–557, September 2005Google Scholar
  10. 10.
    Otter, R.: The number of trees. Ann. Math. 49(3), 583–599 (1948)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Paquete, L., Schiavinotto, T., Stützle, T.: On local optima in multiobjective combinatorial optimization problems. Ann. Oper. Res. 156(1), 83–97 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Rosenberg, I.G.: Reduction of bivalent maximization to the quadratic case. Cahiers Centre Etudes Rech. Oper. 17, 71–74 (1975)MathSciNetzbMATHGoogle Scholar
  13. 13.
    Taillard, E.: Robust taboo search for the quadratic assignment problem. Parallel Comput. 17(4–5), 443–455 (1991)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Whitley, D., Howe, A., Hains, D.: Greedy or not? best improving versus first improving stochastic local search for MAXSAT. In: Proceedings of the AAAI-2013 (2013)Google Scholar
  15. 15.
    Whitley, D.: Mk landscapes, NK landscapes, MAX-kSAT: a proof that the only challenging problems are deceptive. In: Proceedings of Genetic and Evolutionary Computation Conference, pp. 927–934. ACM, New York (2015)Google Scholar
  16. 16.
    Whitley, D., Chen, W.: Constant time steepest descent local search with lookahead for NK-landscapes and MAX-kSAT. In: Soule, T., Moore, J.H. (eds.) GECCO, pp. 1357–1364. ACM (2012)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Francisco Chicano
    • 1
  • Darrell Whitley
    • 2
  • Renato Tinós
    • 3
  1. 1.Dept. de Lenguajes y Ciencias de la ComputaciónUniversity of MálagaMálagaSpain
  2. 2.Department of Computer ScienceColorado State UniversityFort CollinsUSA
  3. 3.Department of Computing and MathematicsUniversity of São PauloRibeirão PretoBrazil

Personalised recommendations