1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2010 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 HeuristicLab.Core;
|
---|
24 | using HeuristicLab.Data;
|
---|
25 | using HeuristicLab.Operators;
|
---|
26 | using HeuristicLab.Optimization;
|
---|
27 | using HeuristicLab.Parameters;
|
---|
28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
29 |
|
---|
30 | namespace HeuristicLab.Encodings.Permutation.Moves {
|
---|
31 | [Item("TwoOptMoveTabuMaker", "Declares a given 2-opt move as tabu, by adding its attributes to the tabu list. It also removes the oldest entry in the tabu list when its size is greater than tenure.")]
|
---|
32 | [StorableClass]
|
---|
33 | public class TwoOptMoveTabuMaker : SingleSuccessorOperator, ITwoOptPermutationMoveOperator, ITabuMoveMaker {
|
---|
34 | public ILookupParameter<Permutation> PermutationParameter {
|
---|
35 | get { return (ILookupParameter<Permutation>)Parameters["Permutation"]; }
|
---|
36 | }
|
---|
37 | public ILookupParameter<TwoOptMove> TwoOptMoveParameter {
|
---|
38 | get { return (LookupParameter<TwoOptMove>)Parameters["Move"]; }
|
---|
39 | }
|
---|
40 | public LookupParameter<ItemList<IItem>> TabuListParameter {
|
---|
41 | get { return (LookupParameter<ItemList<IItem>>)Parameters["TabuList"]; }
|
---|
42 | }
|
---|
43 | public ValueLookupParameter<IntValue> TabuTenureParameter {
|
---|
44 | get { return (ValueLookupParameter<IntValue>)Parameters["TabuTenure"]; }
|
---|
45 | }
|
---|
46 |
|
---|
47 | public TwoOptMoveTabuMaker()
|
---|
48 | : base() {
|
---|
49 | Parameters.Add(new LookupParameter<TwoOptMove>("Move", "The move that was made."));
|
---|
50 | Parameters.Add(new LookupParameter<ItemList<IItem>>("TabuList", "The tabu list where move attributes are stored."));
|
---|
51 | Parameters.Add(new ValueLookupParameter<IntValue>("TabuTenure", "The tenure of the tabu list."));
|
---|
52 | Parameters.Add(new LookupParameter<Permutation>("Permutation", "The solution as permutation."));
|
---|
53 | }
|
---|
54 |
|
---|
55 | public override IOperation Apply() {
|
---|
56 | ItemList<IItem> tabuList = TabuListParameter.ActualValue;
|
---|
57 | TwoOptMove move = TwoOptMoveParameter.ActualValue;
|
---|
58 | IntValue tabuTenure = TabuTenureParameter.ActualValue;
|
---|
59 | Permutation permutation = PermutationParameter.ActualValue;
|
---|
60 |
|
---|
61 | if (tabuList.Count >= tabuTenure.Value) {
|
---|
62 | for (int i = 0; i < tabuTenure.Value - 1; i++)
|
---|
63 | tabuList[i] = tabuList[i + 1];
|
---|
64 | tabuList.RemoveAt(tabuList.Count - 1);
|
---|
65 | }
|
---|
66 |
|
---|
67 | TwoOptMoveTabuAttribute attribute = new TwoOptMoveTabuAttribute(
|
---|
68 | permutation.GetCircular(move.Index1 - 1), permutation[move.Index1],
|
---|
69 | permutation[move.Index2], permutation.GetCircular(move.Index2 + 1));
|
---|
70 | tabuList.Add(attribute);
|
---|
71 | return base.Apply();
|
---|
72 | }
|
---|
73 | }
|
---|
74 | }
|
---|