1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
4 | *
|
---|
5 | * This file is part of HeuristicLab.
|
---|
6 | *
|
---|
7 | * HeuristicLab is free software: you can redistribute it and/or modify
|
---|
8 | * it under the terms of the GNU General Public License as published by
|
---|
9 | * the Free Software Foundation, either version 3 of the License, or
|
---|
10 | * (at your option) any later version.
|
---|
11 | *
|
---|
12 | * HeuristicLab is distributed in the hope that it will be useful,
|
---|
13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
---|
15 | * GNU General Public License for more details.
|
---|
16 | *
|
---|
17 | * You should have received a copy of the GNU General Public License
|
---|
18 | * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
|
---|
19 | */
|
---|
20 | #endregion
|
---|
21 |
|
---|
22 | using System;
|
---|
23 | using System.Threading;
|
---|
24 | using HeuristicLab.Core;
|
---|
25 | using HeuristicLab.Encodings.PermutationEncoding;
|
---|
26 |
|
---|
27 | namespace HeuristicLab.Algorithms.MemPR.Permutation.LocalSearch {
|
---|
28 | public static class Exhaustive {
|
---|
29 | #if DEBUG
|
---|
30 | private const bool VALIDATE = true;
|
---|
31 | #else
|
---|
32 | private const bool VALIDATE = false;
|
---|
33 | #endif
|
---|
34 |
|
---|
35 | public static Tuple<int, int> HillClimb(IRandom random, Encodings.PermutationEncoding.Permutation perm,
|
---|
36 | ref double quality, bool maximization, Func<Encodings.PermutationEncoding.Permutation, double> eval,
|
---|
37 | CancellationToken token, bool[,] noTouch = null) {
|
---|
38 | if (double.IsNaN(quality)) quality = eval(perm);
|
---|
39 | Tuple<int, int> changes;
|
---|
40 | switch (perm.PermutationType) {
|
---|
41 | case PermutationTypes.Absolute:
|
---|
42 | changes = ExhaustiveSwap2.HillClimb(random, perm, ref quality, maximization, eval, token, noTouch);
|
---|
43 | break;
|
---|
44 | case PermutationTypes.RelativeDirected:
|
---|
45 | changes = Exhaustive1Shift.HillClimb(random, perm, ref quality, maximization, eval, token, noTouch);
|
---|
46 | break;
|
---|
47 | case PermutationTypes.RelativeUndirected:
|
---|
48 | changes = Exhaustive2Opt.HillClimb(random, perm, ref quality, maximization, eval, token, noTouch);
|
---|
49 | break;
|
---|
50 | default: throw new ArgumentException(string.Format("Permutation type {0} is not known", perm.PermutationType));
|
---|
51 | }
|
---|
52 | if (VALIDATE && !perm.Validate()) throw new ArgumentException("HillClimb produced invalid child");
|
---|
53 | return changes;
|
---|
54 | }
|
---|
55 | }
|
---|
56 | }
|
---|