Genetic Engine
refactor2
  • Tutorial
  • Sklearn-compatible API
  • Grammars
  • Introduction to Metahandlers
  • MetaHandlers Library
  • Create your own metahandler
  • Problems
  • Algorithms
  • Stopping Criteria
  • Individual representations
  • Genetic operators
  • Optimizations
  • Sub-tree caching
  • API Reference
    • geneticengine
      • Subpackages
        • geneticengine.algorithms
        • geneticengine.evaluation
        • geneticengine.grammar
        • geneticengine.problems
        • geneticengine.random
        • geneticengine.representations
        • geneticengine.solutions
        • geneticengine.visualization
      • Submodules
Genetic Engine
  • API Reference
  • geneticengine
  • geneticengine.algorithms
  • geneticengine.algorithms.random_search
  • Edit on GitHub

geneticengine.algorithms.random_search

Module Contents

Classes

RandomSearch

Randomly generates new solutions and keeps the best one.

class geneticengine.algorithms.random_search.RandomSearch(problem, budget, representation, random=None, recorder=None)

Bases: geneticengine.algorithms.heuristics.HeuristicSearch

Randomly generates new solutions and keeps the best one.

Parameters:
  • problem (geneticengine.problems.Problem) –

  • budget (geneticengine.evaluation.budget.SearchBudget) –

  • representation (geneticengine.representations.api.Representation) –

  • random (geneticengine.random.sources.RandomSource) –

  • recorder (geneticengine.evaluation.tracker.ProgressTracker | None) –

search()
Return type:

geneticengine.solutions.individual.Individual

Previous Next

© Copyright 2022, Alcides Fonseca et al.. Revision ad1c13aa.

Built with Sphinx using a theme provided by Read the Docs.