Module org.cicirello.chips_n_salsa
Package org.cicirello.search
Interface SingleSolutionMetaheuristic<T extends Copyable<T>>
- Type Parameters:
T
- The type of object under optimization.
- All Superinterfaces:
Metaheuristic<T>
,ReoptimizableMetaheuristic<T>
,Splittable<TrackableSearch<T>>
,TrackableSearch<T>
- All Known Implementing Classes:
OnePlusOneEvolutionaryAlgorithm
,OnePlusOneGeneticAlgorithm
,SimulatedAnnealing
public interface SingleSolutionMetaheuristic<T extends Copyable<T>>
extends ReoptimizableMetaheuristic<T>
This interface defines the required methods for implementations of single-solution
metaheuristics, i.e., metaheuristics such as simulated annealing that operate one a single
candidate solution (as compared to population-based metaheuristics such as genetic algorithms. It
is also specifically focused on metaheuristics for which the maximum run length can be specified.
-
Method Summary
Modifier and TypeMethodDescriptionExecutes a run of the metaheuristic beginning at a specified starting solution.Methods inherited from interface org.cicirello.search.Metaheuristic
optimize
Methods inherited from interface org.cicirello.search.ReoptimizableMetaheuristic
reoptimize, split
Methods inherited from interface org.cicirello.search.TrackableSearch
getProblem, getProgressTracker, getTotalRunLength, setProgressTracker
-
Method Details
-
optimize
Executes a run of the metaheuristic beginning at a specified starting solution. If this method is called multiple times, each call begins by reinitializing the metaheuristic's control parameters. as if it was a fresh run.Implementing classes should provide more specific documentation of this method to define in particular what run length means in the context of the given metaheuristic. It is also recommended that implementing classes rename the runLength parameter to be a more meaningful name within the context of that metaheuristic.
- Parameters:
runLength
- The length of a run of this metaheuristic.start
- The desired starting solution.- Returns:
- The current solution at the end of this run and its cost, which may or may not be the
best of run solution, and which may or may not be the same as the solution contained in
this metaheuristic's
ProgressTracker
, which contains the best of all runs. Returns null if the run did not execute, such as if the ProgressTracker already contains the theoretical best solution.
-