Package es.urjc.etsii.grafo.algorithms

package es.urjc.etsii.grafo.algorithms

Related Packages

Package	Description
es.urjc.etsii.grafo.algorithms.multistart
es.urjc.etsii.grafo.algorithms.scattersearch
es.urjc.etsii.grafo.algorithms.vns

Class	Description
Algorithm<S extends Solution<S,I>,I extends Instance>	Base algorithm class, all algorithms should extend this class or any of its subclasses.
EmptyAlgorithm<S extends Solution<S,I>,I extends Instance>
FMode	Solving mode, can be either maximize or minimize
IteratedGreedy<S extends Solution<S,I>,I extends Instance>	Iterated greedy is a search method that iterates through applications of construction heuristics using the repeated execution of two main phases, the partial destruction of a complete candidate solution and a subsequent reconstruction of a complete candidate solution.
ScoringFunction<S extends Solution<S,I>,I extends Instance>
SimpleAlgorithm<S extends Solution<S,I>,I extends Instance>	Example simple algorithm, executes: Constructive → (Optional, if present) Local Searches → (Optional, if present) Shake → If did not improve end ^_________________________________________| else repeat This class can be used to test all the pieces if they are working properly, or as a base for more complex algorithms