source: branches/GeneralizedQAP/UnitTests/CordeauCrossoverTest.cs @ 15507

Last change on this file since 15507 was 15507, checked in by abeham, 21 months ago

#1614:

  • fixed some bugs introduced in last commit (project file, tests)
  • fixed ApproximateLocalSearch due to change in move evaluator that outputs an absolute quality of the move and not a delta
  • added evaluated solution counting to approximate local search
  • GRASP+PR: restructured main loop and combined iteration initialization with variable creator outside
File size: 2.2 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2017 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
22using System.Linq;
23using System.Threading;
24using HeuristicLab.Data;
25using HeuristicLab.Problems.GeneralizedQuadraticAssignment;
26using HeuristicLab.Problems.Instances.CordeauGQAP;
27using HeuristicLab.Random;
28using Microsoft.VisualStudio.TestTools.UnitTesting;
29
30namespace UnitTests {
31  [TestClass]
32  public class CordeauCrossoverTest {
33    [TestMethod]
34    public void CordeauCrossoverFunctionalityTest() {
35      var provider = new CordeauGQAPInstanceProvider();
36      var instance = provider.LoadData(provider.GetDataDescriptors().Single(x => x.Name == "20-15-75"));
37      var gqap = new GQAP();
38      gqap.Load(instance);
39      var evaluator = gqap.Evaluator;
40
41      for (int i = 0; i < 100; i++) {
42        var random = new MersenneTwister((uint)i);
43        var parent1 = GreedyRandomizedSolutionCreator.CreateSolution(random, gqap.ProblemInstance, 100, true, CancellationToken.None);
44        var parent2 = GreedyRandomizedSolutionCreator.CreateSolution(random, gqap.ProblemInstance, 100, true, CancellationToken.None);
45
46        try {
47          CordeauCrossover.Apply(random,
48            parent1,
49            new DoubleValue(gqap.Evaluate(parent1)),
50            parent2,
51            new DoubleValue(gqap.Evaluate(parent2)),
52            gqap.ProblemInstance,
53            new IntValue(0));
54        } catch {
55          Assert.Fail("Error during crossover");
56        }
57      }
58    }
59  }
60}
Note: See TracBrowser for help on using the repository browser.