source: stable/HeuristicLab.Tests/HeuristicLab-3.3/Samples/VnsOpSampleTest.cs @ 12742

Last change on this file since 12742 was 12742, checked in by abeham, 6 years ago

#2208: merged 12722 to stable

File size: 4.7 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2015 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.IO;
23using System.Linq;
24using HeuristicLab.Algorithms.VariableNeighborhoodSearch;
25using HeuristicLab.Data;
26using HeuristicLab.Encodings.IntegerVectorEncoding;
27using HeuristicLab.Persistence.Default.Xml;
28using HeuristicLab.Problems.Orienteering;
29using Microsoft.VisualStudio.TestTools.UnitTesting;
30
31namespace HeuristicLab.Tests {
32  [TestClass]
33  public class VnsOpSampleTest {
34    private const string SampleFileName = "VNS_OP";
35
36    [TestMethod]
37    [TestCategory("Samples.Create")]
38    [TestProperty("Time", "medium")]
39    public void CreateVnsTspSampleTest() {
40      var vns = CreateVnsTspSample();
41      string path = Path.Combine(SamplesUtils.SamplesDirectory, SampleFileName + SamplesUtils.SampleFileExtension);
42      XmlGenerator.Serialize(vns, path);
43    }
44    [TestMethod]
45    [TestCategory("Samples.Execute")]
46    [TestProperty("Time", "long")]
47    public void RunVnsTspSampleTest() {
48      var vns = CreateVnsTspSample();
49      vns.SetSeedRandomly = false;
50      SamplesUtils.RunAlgorithm(vns);
51      Assert.AreEqual(1182, SamplesUtils.GetDoubleResult(vns, "BestQuality"));
52      Assert.AreEqual(1182, SamplesUtils.GetDoubleResult(vns, "CurrentAverageQuality"));
53      Assert.AreEqual(1182, SamplesUtils.GetDoubleResult(vns, "CurrentWorstQuality"));
54      Assert.AreEqual(42651753, SamplesUtils.GetIntResult(vns, "EvaluatedSolutions"));
55    }
56
57    private VariableNeighborhoodSearch CreateVnsTspSample() {
58      VariableNeighborhoodSearch vns = new VariableNeighborhoodSearch();
59      #region Problem Configuration
60      OrienteeringProblem opProblem = new OrienteeringProblem();
61      opProblem.BestKnownQuality = new DoubleValue(1188);
62      opProblem.BestKnownSolution = new IntegerVector(new[] {
630, 1, 3, 6, 11, 17, 24, 18, 13, 19, 14, 20, 26, 34, 27, 35, 42, 48, 53, 57, 52, 47, 41, 33, 25, 32, 40, 46, 39, 31, 38, 50, 44, 37, 30, 23, 16, 10, 15, 22, 29, 21, 28, 36, 43, 49, 54, 58, 61, 63
64      });
65      opProblem.Coordinates = new DoubleMatrix(new double[,] {
66{ 7, 0 },{ 6, 1 },{ 8, 1 },{ 5, 2 },{ 7, 2 },{ 9, 2 },{ 4, 3 },{ 6, 3 },{ 8, 3 },{ 10, 3 },{ 3, 4 },{ 5, 4 },{ 7, 4 },{ 9, 4 },{ 11, 4 },{ 2, 5 },{ 4, 5 },{ 6, 5 },{ 8, 5 },{ 10, 5 },{ 12, 5 },{ 1, 6 },{ 3, 6 },{ 5, 6 },{ 7, 6 },{ 9, 6 },{ 11, 6 },{ 13, 6 },{ 0, 7 },{ 2, 7 },{ 4, 7 },{ 6, 7 },{ 8, 7 },{ 10, 7 },{ 12, 7 },{ 14, 7 },{ 1, 8 },{ 3, 8 },{ 5, 8 },{ 7, 8 },{ 9, 8 },{ 11, 8 },{ 13, 8 },{ 2, 9 },{ 4, 9 },{ 6, 9 },{ 8, 9 },{ 10, 9 },{ 12, 9 },{ 3, 10 },{ 5, 10 },{ 7, 10 },{ 9, 10 },{ 11, 10 },{ 4, 11 },{ 6, 11 },{ 8, 11 },{ 10, 11 },{ 5, 12 },{ 7, 12 },{ 9, 12 },{ 6, 13 },{ 8, 13 },{ 7, 14 }
67      });
68      opProblem.MaximumDistance = 70;
69      opProblem.PointVisitingCosts = 0;
70      opProblem.Scores = new DoubleArray(new double[] {
710, 6, 6, 12, 6, 12, 18, 12, 12, 18, 24, 18, 12, 18, 24, 30, 24, 18, 18, 24, 30, 36, 30, 24, 18, 24, 30, 36, 42, 36, 30, 24, 24, 30, 36, 42, 36, 30, 24, 18, 24, 30, 36, 30, 24, 18, 18, 24, 30, 24, 18, 12, 18, 24, 18, 12, 12, 18, 12, 6, 12, 6, 6, 0
72      });
73      opProblem.StartingPoint = 0;
74      opProblem.TerminalPoint = 63;
75
76      opProblem.Name = "1_p64_t070";
77      opProblem.Description = "Represents a symmetric Traveling Salesman Problem.";
78      #endregion
79      #region Algorithm Configuration
80      vns.Name = "Variable Neighborhood Search - TSP";
81      vns.Description = "A variable neighborhood search algorithm which solves a funny TSP instance";
82      vns.Problem = opProblem;
83
84      vns.LocalImprovement = vns.LocalImprovementParameter.ValidValues.OfType<OrienteeringLocalImprovementOperator>().Single();
85      vns.LocalImprovementMaximumIterations = 200;
86      vns.MaximumIterations = 25;
87      vns.Seed = 0;
88      vns.SetSeedRandomly = true;
89      vns.ShakingOperator = vns.ShakingOperatorParameter.ValidValues.OfType<OrienteeringShakingOperator>().Single();
90      #endregion
91      vns.Engine = new ParallelEngine.ParallelEngine();
92      return vns;
93    }
94  }
95}
Note: See TracBrowser for help on using the repository browser.