Package | Description |
---|---|
org.jamesframework.core.search.algo.tabu |
Tabu search and components (including tabu memory specification).
|
org.jamesframework.core.subset.algo.tabu |
Tabu search components for subset selection.
|
Modifier and Type | Class and Description |
---|---|
class |
FullTabuMemory<SolutionType extends Solution>
Full tabu memory that stores deeps copies of recently visited solutions and declares a move tabu if
applying it to the current solution yields a neighbouring solution which is currently contained in
the memory.
|
Modifier and Type | Method and Description |
---|---|
TabuMemory<SolutionType> |
TabuSearch.getTabuMemory()
Get the tabu memory.
|
Modifier and Type | Method and Description |
---|---|
void |
TabuSearch.setTabuMemory(TabuMemory<SolutionType> tabuMemory)
Set the tabu memory.
|
Constructor and Description |
---|
TabuSearch(Problem<SolutionType> problem,
Neighbourhood<? super SolutionType> neighbourhood,
TabuMemory<SolutionType> tabuMemory)
Creates a new tabu search, specifying the problem to solve, the neighbourhood used to modify the current
solution and the applied tabu memory.
|
TabuSearch(String name,
Problem<SolutionType> problem,
Neighbourhood<? super SolutionType> neighbourhood,
TabuMemory<SolutionType> tabuMemory)
Creates a new tabu search, specifying the problem to solve, the neighbourhood used to modify the current
solution, the applied tabu memory and a custom search name.
|
Modifier and Type | Class and Description |
---|---|
class |
IDBasedSubsetTabuMemory
An ID based subset tabu memory keeps track of recently added and deleted IDs (recently applied moves) and does not
allow that these IDs are added nor deleted to/from the current solution as long as they are contained in the limited
size tabu memory.
|
Copyright © 2016. All rights reserved.