var searchIndex = {};
searchIndex["metaheuristics"] = {"doc":"Find approximate solutions to your optimisation problem using metaheuristics algorithms","items":[[0,"hill_climbing","metaheuristics","Find an approximate solution to your optimisation problem using Hill Climbing",null,null],[5,"solve","metaheuristics::hill_climbing","Returns an approximate solution to your optimisation problem using Hill Climbing",null,{"inputs":[{"name":"metaheuristics"},{"name":"duration"}],"output":{"name":"t"}}],[0,"random_restarts","","Find an approximate solution to your optimisation problem using Hill Climbing with random restarts",null,null],[5,"solve","metaheuristics::hill_climbing::random_restarts","Returns an approximate solution to your optimisation problem using Hill Climbing with random restarts",null,{"inputs":[{"name":"metaheuristics"},{"name":"duration"},{"name":"f64"}],"output":{"name":"t"}}],[0,"random_search","metaheuristics","Find an approximate solution to your optimisation problem using Random Search",null,null],[5,"solve","metaheuristics::random_search","Returns an approximate solution to your optimisation problem using Random Search",null,{"inputs":[{"name":"metaheuristics"},{"name":"duration"}],"output":{"name":"t"}}],[0,"simulated_annealing","metaheuristics","Find an approximate solution to your optimisation problem using Simulated Annealing",null,null],[5,"solve","metaheuristics::simulated_annealing","Returns an approximate solution to your optimisation problem using Simulated Annealing",null,{"inputs":[{"name":"metaheuristics"},{"name":"duration"}],"output":{"name":"t"}}],[8,"Metaheuristics","metaheuristics","Implement this simple trait to apply metaheuristics to your optimisation problems",null,null],[10,"clone_candidate","","Clone the supplied candidate solution",0,null],[10,"generate_candidate","","Randomly generate a new candidate solution",0,null],[10,"rank_candidate","","Rank a candidate solution so that it can be compared with another (higher is better)",0,null],[10,"tweak_candidate","","Clone the supplied candidate solution, then make a small (but random) modification",0,null]],"paths":[[8,"Metaheuristics"]]};
initSearch(searchIndex);