Module hercules::local_search

Local Search contains all of the implemented local search algorithms

This module contains all of the implemented local search algorithms, which are:

• One step local search
• Simple local search
• Simple gain criteria search
• Simple mixed search
• Multi simple local search
• Multi simple gain criteria search
• Simple Particle Swarm Search

Functions

• multi_simple_gain_criteria_search
  Given a QUBO and a vector of initial points, run gain searches on each initial point and return all of the solutions.
• multi_simple_local_search
  Given a QUBO and a vector of initial points, run local searches on each initial point and return all of the solutions.
• particle_swarm_search
  Performs a particle swarm search on a QUBO.
• random_search
  Performs a random search on a QUBO, where points are randomly generated and the best point is returned. This to create a baseline to compare other algorithms against just random guesses.
• simple_gain_criteria_search
  Given a QUBO and a fractional or integral initial point, run a gain search until the point converges or the step limit is hit.
• simple_local_search
  Given a QUBO and an integral initial point, run simple local search until the point converges or the step limit is hit.
• simple_mixed_search
  Given a QUBO and a fractional or integral initial point, run a mixed search until the point converges or the step limit is hit. This is a combination of local search and gain criteria search, where the gain criteria search is run on the local search.