Package | Description |
---|---|
org.jamesframework.core.factory |
Miscellaneous factory interfaces.
|
org.jamesframework.core.search |
High-level search templates.
|
org.jamesframework.core.search.algo |
Algorithm implementations.
|
org.jamesframework.core.search.algo.tabu |
Tabu search and components (including tabu memory specification).
|
org.jamesframework.core.search.algo.vns |
Variable neighbourhood searches and components.
|
org.jamesframework.core.search.listeners |
Search listeners.
|
org.jamesframework.core.subset.algo |
Specific subset sampling algorithms.
|
Modifier and Type | Method and Description |
---|---|
LocalSearch<SolutionType> |
LocalSearchFactory.create(Problem<SolutionType> problem)
Create a local search, given the problem to solve.
|
Modifier and Type | Class and Description |
---|---|
class |
MultiNeighbourhoodSearch<SolutionType extends Solution>
Abstract neighbourhood search that uses multiple neighbourhoods to modify the current solution.
|
class |
NeighbourhoodSearch<SolutionType extends Solution>
A neighbourhood search is a specific kind of local search in which the current solution is repeatedly modified by
applying moves, generated by one or more neighbourhoods, that transform this solution into a similar, neighbouring
solution.
|
class |
SingleNeighbourhoodSearch<SolutionType extends Solution>
Abstract neighbourhood search that uses a single neighbourhood to modify the current solution.
|
Modifier and Type | Class and Description |
---|---|
class |
MetropolisSearch<SolutionType extends Solution>
Metropolis search (fixed temperature).
|
class |
ParallelTempering<SolutionType extends Solution>
The parallel tempering algorithm uses several Metropolis search replicas with different
temperatures in a given range, where good solutions are pushed towards cool replicas for
the sake of convergence, while bad solutions are pushed towards hot replicas in an attempt
to find further improvements.
|
class |
PipedLocalSearch<SolutionType extends Solution>
A piped local search consists of a composition of other local search \(S_1, ..., S_n\).
|
class |
RandomDescent<SolutionType extends Solution>
Basic random descent algorithm.
|
class |
SteepestDescent<SolutionType extends Solution>
Steepest descent algorithm, also referred to as hill climbing.
|
Constructor and Description |
---|
PipedLocalSearch(Problem<SolutionType> problem,
List<LocalSearch<SolutionType>> pipeline)
Creates a new piped local search, specifying the problem to solve and a list of local searches to
be executed in the pipeline, in the given order.
|
PipedLocalSearch(String name,
Problem<SolutionType> problem,
List<LocalSearch<SolutionType>> pipeline)
Creates a new piped local search, specifying the problem to solve, a list of local searches to
be executed in the pipeline in the given order, and a custom search name.
|
Modifier and Type | Class and Description |
---|---|
class |
TabuSearch<SolutionType extends Solution>
Tabu search algorithm.
|
Modifier and Type | Class and Description |
---|---|
class |
ReducedVariableNeighbourhoodSearch<SolutionType extends Solution>
Reduced variable neighbourhood search (RVNS) algorithm.
|
class |
VariableNeighbourhoodDescent<SolutionType extends Solution>
Variable neighbourhood descent algorithm.
|
class |
VariableNeighbourhoodSearch<SolutionType extends Solution>
Variable neighbourhood search (VNS) algorithm.
|
Modifier and Type | Method and Description |
---|---|
default void |
SearchListener.newCurrentSolution(LocalSearch<? extends SolutionType> search,
SolutionType newCurrentSolution,
Evaluation newCurrentSolutionEvaluation,
Validation newCurrentSolutionValidation)
Fired by local searches only, when a new current solution has been adopted.
|
Modifier and Type | Class and Description |
---|---|
class |
LRSubsetSearch
LR subset search is a greedy local search heuristic for subset selection.
|
Copyright © 2016. All rights reserved.