|Maintainer||Richard Senington <email@example.com>|
Transformations for capturing characteristics of algorithms.
- improvement :: Ord nme => LSTree nme -> LSTree nme
- nShuffle :: RandomGen g => g -> LSTree nme -> LSTree nme
- nSort :: Ord nme => LSTree nme -> LSTree nme
- nReverse :: LSTree nme -> LSTree nme
- tabu :: Eq nme => Int -> [nme] -> LSTree nme -> LSTree nme
- thresholdWorsening :: NumericallyPriced nme a => a -> LSTree nme -> LSTree nme
- varyingThresholdWorsening :: NumericallyPriced nme a => [a] -> LSTree nme -> LSTree nme
- multiLevelApply :: [LSTree nme -> LSTree nme] -> LSTree nme -> LSTree nme
- sImprovement :: Ord nme => LSTree nme -> LSTree nme
A basic recursive filter. This will check every neighbourhood, and remove those neighbours that do not improve upon their parent solution.
Recursive neighbourhood shuffling transformation, all neighbourhoods will become randomised.
Recursive neighbourhood ordering transformation. Implemented using multi-apply.
Recursive neighbourhood reversal transformation. Implemented using multi-apply.
A simple (very simple) TABU system. Based upon a limited Queue, and direct node comparison (not the way it is usually used in the OR community). Acts as a recursive filter based upon memory.
Takes advantage of numerically priced solutions, rather than just ordering, to allow through solutions that are worse than the current solution, but only to a limited extent. Would require some understanding of the maximum and minimum differences likely in a solution set.
An adaptation of the above. We now have a list of thresholds, constructed in some way (user defined) and then applied each to a different level of the tree. Used in one of the Simulated Annealing experiments.
Takes a list of single level transformations, and applies them each to a different level of a tree. These are also generated in a user defined way, and this function is used in the other Simulated Annealing experiment.
A single level improvement transformation, that will remove from the top neighbourhood of the tree those solutions that do not improve upon the parent solution. It is used by both the recursive improvement transformation, and one of the attempts to encode Simulated Annealing.