public static void Improve(Permutation assignment, DoubleMatrix distances, DoubleValue quality, IntValue localIterations, IntValue evaluatedSolutions, bool maximization, int maxIterations, ItemList <BoolArray> realizations, CancellationToken cancellation) { var distanceM = (DistanceMatrix)distances; Func <int, int, double> distance = (a, b) => distanceM[a, b]; for (var i = localIterations.Value; i < maxIterations; i++) { TranslocationMove bestMove = null; double bestQuality = 0; // we have to make an improvement, so 0 is the baseline double evaluations = 0.0; foreach (var move in ExhaustiveInsertionMoveGenerator.Generate(assignment)) { double moveQuality = PTSPEstimatedInsertionMoveEvaluator.EvaluateMove(assignment, move, distance, realizations); evaluations += realizations.Count * 6.0 / (assignment.Length * assignment.Length); if (maximization && moveQuality > bestQuality || !maximization && moveQuality < bestQuality) { bestQuality = moveQuality; bestMove = move; } } evaluatedSolutions.Value += (int)Math.Ceiling(evaluations); if (bestMove == null) { break; } TranslocationManipulator.Apply(assignment, bestMove.Index1, bestMove.Index2, bestMove.Index3); quality.Value += bestQuality; localIterations.Value++; cancellation.ThrowIfCancellationRequested(); } }
public static double EvaluateMove(Permutation permutation, TwoPointFiveMove move, Func <int, int, double> distance, ItemList <BoolArray> realizations) { if (move.IsInvert) { return(PTSPEstimatedInversionMoveEvaluator.EvaluateMove(permutation, new InversionMove(move.Index1, move.Index2, move.Permutation), distance, realizations)); } else { return(PTSPEstimatedInsertionMoveEvaluator.EvaluateMove(permutation, new TranslocationMove(move.Index1, move.Index1, move.Index2), distance, realizations)); } }
protected PTSPEstimatedInsertionMoveEvaluator(PTSPEstimatedInsertionMoveEvaluator original, Cloner cloner) : base(original, cloner) { }