You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
This commit was created on GitHub.com and signed with GitHub’s verified signature.
The key has expired.
[6.2.0] - 2023-01-10
Added
AdaptiveMutationOnlyEvolutionaryAlgorithm: Implementation of a mutation-only evolutionary algorithm with mutation rates that evolve during the search.
Extracted a EuclideanDistance class from the TSP (previously default and only edge distance) to enable easily introducing additional TSP edge distance functions.
Changed
Refactored several classes to improve performance and/or maintainability, including the following:
Several permutation crossover and mutation operators for improved performance
All real-valued mutation operators
SimulatedAnnealing
Stochastic samplers
Hill climbers
Evolutionary algorithms
Parallel metaheuristic and parallel multistarter classes
Refactored test cases for the LargestCommonSubgraph class (based on RefactorFirst scan).
Refactored test cases for the hill climber classes (based on RefactorFirst scan).
Refactored test cases for the TSP class (based on RefactorFirst scan).
Refactored test cases for BoltzmannSelection and BoltzmannStochasticUniversalSampling (based on RefactorFirst scan).