#region License Information
/* HeuristicLab
* Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
*
* This file is part of HeuristicLab.
*
* HeuristicLab is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* HeuristicLab is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with HeuristicLab. If not, see .
*/
#endregion
using System.IO;
using System.Linq;
using HeuristicLab.Algorithms.TabuSearch;
using HeuristicLab.Encodings.PermutationEncoding;
using HeuristicLab.Persistence.Default.Xml;
using HeuristicLab.Problems.BinPacking3D;
using Microsoft.VisualStudio.TestTools.UnitTesting;
namespace HeuristicLab.Tests {
[TestClass]
public class TabuSearch3dBinPackingSampleTest {
private const string SampleFileName = "TS_BPP";
[TestMethod]
[TestCategory("Samples.Create")]
[TestProperty("Time", "medium")]
public void CreateTabuSearchBppSampleTest() {
var ts = CreateTabuSearchBppSample();
string path = Path.Combine(SamplesUtils.SamplesDirectory, SampleFileName + SamplesUtils.SampleFileExtension);
XmlGenerator.Serialize(ts, path);
}
[TestMethod]
[TestCategory("Samples.Execute")]
[TestProperty("Time", "long")]
public void RunTabuSearchBppSampleTest() {
var ts = CreateTabuSearchBppSample();
ts.SetSeedRandomly.Value = false;
SamplesUtils.RunAlgorithm(ts);
// Assert.AreEqual(6294, SamplesUtils.GetDoubleResult(ts, "BestQuality"));
// Assert.AreEqual(7380.0386666666664, SamplesUtils.GetDoubleResult(ts, "CurrentAverageQuality"));
// Assert.AreEqual(8328, SamplesUtils.GetDoubleResult(ts, "CurrentWorstQuality"));
// Assert.AreEqual(750000, SamplesUtils.GetIntResult(ts, "EvaluatedMoves"));
}
private TabuSearch CreateTabuSearchBppSample() {
TabuSearch ts = new TabuSearch();
#region Problem Configuration
PermutationProblem bppProblem = new PermutationProblem();
#endregion
#region Algorithm Configuration
ts.Name = "Tabu Search - 3D Bin Packing Problem";
ts.Description = "A tabu search algorithm that solves a 3D bin packing problem instance";
ts.Problem = bppProblem;
ts.MaximumIterations.Value = 1000;
// move generator has to be set first
var moveGenerator = ts.MoveGeneratorParameter.ValidValues
.OfType()
.Single();
ts.MoveGenerator = moveGenerator;
var moveEvaluator = ts.MoveEvaluatorParameter.ValidValues
.OfType()
.Single();
ts.MoveEvaluator = moveEvaluator;
var moveMaker = ts.MoveMakerParameter.ValidValues
.OfType()
.Single();
ts.MoveMaker = moveMaker;
ts.SampleSize.Value = 100;
ts.Seed.Value = 0;
ts.SetSeedRandomly.Value = true;
var tabuChecker = ts.TabuCheckerParameter.ValidValues
.OfType()
.Single();
tabuChecker.UseAspirationCriterion.Value = true;
ts.TabuChecker = tabuChecker;
var tabuMaker = ts.TabuMakerParameter.ValidValues
.OfType()
.Single();
ts.TabuMaker = tabuMaker;
ts.TabuTenure.Value = 60;
#endregion
ts.Engine = new ParallelEngine.ParallelEngine();
return ts;
}
}
}