Selected problems

• Problem search space has dimension 6 (D=6). Algorithms are searching vector [x1,x2,x3,x4,x5,x6] that represents the minimum of selected problem.
• Stop criteria is 10.000 evaluations (FES=10000)
• Selected algorithms (X) (default not optimized pharameters)
  • Random algorithm
  • HC Hill Climbing with RANDOM_RESTART
  • FA Firefly Algorithm (2013)
  • GWA Grey Wolf Optimizer (2014)
  • ABC Artificial Bee Colony (ABC) algorithm (2007)
  • jDE SalfAdaptiv Differental Evolution (2006)

Algorithm X search visualization for problem Sphere

• Random
• HC
• FA
• GWA
• ABC
• jDE

Algorithm X search visualization for problem Griewank

• Random
• HC
• FA
• GWA
• ABC
• jDE

Algorithm X search visualization for problem Schwefel26

• Random
• HC
• FA
• GWA
• ABC
• jDE

By LPM.