Join%20Chat

logo

The tutorials in this directory cover many optimization domains. Together they show how fcmaes can be used for practical gradient-free problems in engineering, science, planning, simulation, and machine learning.

Dimensional Analysis

Quality Diversity

  • Quality Diversity Run a multi-algorithm improvement emitter in parallel with CVT MAP-Elites.

  • Map Elites Combine CVT MAP-Elites with an adapted CMA-ES.

  • Map Elites 2 Apply quality diversity to ODE-based control problems.

Space Flight Trajectory Design

Quantum Computing

  • Variational Qubit Optimize a variational qubit and a variational quantum eigensolver.

Service - Demand Network Planning (p-center problem)

Scheduling

  • Employee Scheduling Optimize an employee schedule.

  • JobShop Solve the flexible job shop scheduling problem.

  • Scheduling Solve a complex scheduling problem from the GTOC11 competition.

Routing

  • One For All Work on MMKP and VRPTW problems.

  • Multi-UAV Solve a multi-UAV task assignment problem.

  • Routing Capacitated Vehicle Routing.

  • Noisy TSP Solve the noisy Traveling Salesman Problem.

Trading

Water Management

Social Media

Game Design

Simulation

Machine Learning

Miscellaneous

fcmaes-Details

Log output of the parallel retry

The log output of the parallel retry contains the following rows:

Parallel retry

  • time (in sec)

  • evaluations / sec

  • number of retries - optimization runs

  • total number of evaluations in all retries

  • best value found so far

  • mean of the values found by retries below the defined threshold

  • standard deviation of the values found by retries below the defined threshold

  • list of the best 20 function values in the retry store

  • best solution (x-vector) found so far

Mean and standard deviation would be misleading when using coordinated retry because some retries are initiated by crossover. Therefore, the rows in the log output differ slightly:

Smart retry

  • time (in sec)

  • evaluations / sec

  • number of retries - optimization runs

  • total number of evaluations in all retries

  • best value found so far

  • worst value in the retry store

  • number of entries in the retry store

  • list of the best 20 function values in the retry store

  • best solution (x-vector) found so far