This package includes classes and interfaces related to implementing multistart metaheuristics (i.e., metaheuristics that periodically restart, and return the best solution across a number of such restarts).
Interface Summary Interface Description RestartScheduleMultistart metaheuristics involve periodically restarting the metaheuristic from a new initial starting solution (often random).
Class Summary Class Description ConstantRestartScheduleThis is the basic constant run length restart schedule, such that every restart of the multistart metaheuristic is the same in length. LubyRestartsThe Luby restart schedule originated with constraint satisfaction search, and was originally used to control when to restart a backtracking constraint satisfaction search in number of backtracks. Multistarter<T extends Copyable<T>>This class is used for implementing multistart metaheuristics. ParallelVariableAnnealingLengthThe Parallel Variable Annealing Length (P-VAL) restart schedule originated, as you would expect from the word "annealing" in its name, as a restart schedule for Simulated Annealing. ReoptimizableMultistarter<T extends Copyable<T>>This class is used for implementing multistart metaheuristics, that can be restarted at previously found solutions. VariableAnnealingLengthThe Variable Annealing Length (VAL) restart schedule originated, as you would expect from the word "annealing" in its name, as a restart schedule for Simulated Annealing.