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.Collections.Generic;
|
---|
23 | using HeuristicLab.Core;
|
---|
24 | using HeuristicLab.Data;
|
---|
25 | using HeuristicLab.Encodings.PermutationEncoding;
|
---|
26 | using HeuristicLab.Optimization;
|
---|
27 | using HeuristicLab.Parameters;
|
---|
28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
29 |
|
---|
30 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Alba {
|
---|
31 | [Item("AlbaTranslocationMoveGenerator", "An operator which generates translocation moves for the alba representation.")]
|
---|
32 | [StorableClass]
|
---|
33 | public sealed class AlbaTranslocationMoveGenerator : AlbaMoveOperator, IAlbaTranslocationMoveOperator, IMultiMoveGenerator {
|
---|
34 | public IValueLookupParameter<TranslocationMoveGenerator> TranslocationMoveGeneratorParameter {
|
---|
35 | get { return (IValueLookupParameter<TranslocationMoveGenerator>)Parameters["TranslocationMoveGenerator"]; }
|
---|
36 | }
|
---|
37 |
|
---|
38 | protected override IPermutationMoveOperator PermutationMoveOperatorParameter {
|
---|
39 | get { return TranslocationMoveGeneratorParameter.Value; }
|
---|
40 | set {
|
---|
41 | TranslocationMoveGeneratorParameter.Value = value as TranslocationMoveGenerator;
|
---|
42 | if (TranslocationMoveGeneratorParameter.Value is IMultiMoveGenerator) {
|
---|
43 | ((IMultiMoveGenerator)TranslocationMoveGeneratorParameter.Value).SampleSizeParameter.ActualName = SampleSizeParameter.Name;
|
---|
44 | }
|
---|
45 | }
|
---|
46 | }
|
---|
47 |
|
---|
48 | public ILookupParameter<TranslocationMove> TranslocationMoveParameter {
|
---|
49 | get {
|
---|
50 | if (TranslocationMoveGeneratorParameter.Value != null)
|
---|
51 | return TranslocationMoveGeneratorParameter.Value.TranslocationMoveParameter;
|
---|
52 | else
|
---|
53 | return null;
|
---|
54 | }
|
---|
55 | }
|
---|
56 |
|
---|
57 | public ILookupParameter<Permutation> PermutationParameter {
|
---|
58 | get {
|
---|
59 | if (TranslocationMoveGeneratorParameter.Value != null)
|
---|
60 | return TranslocationMoveGeneratorParameter.Value.PermutationParameter;
|
---|
61 | else
|
---|
62 | return null;
|
---|
63 | }
|
---|
64 | }
|
---|
65 |
|
---|
66 | public IValueLookupParameter<IntValue> SampleSizeParameter {
|
---|
67 | get { return (IValueLookupParameter<IntValue>)Parameters["SampleSize"]; }
|
---|
68 | }
|
---|
69 |
|
---|
70 | public AlbaTranslocationMoveGenerator()
|
---|
71 | : base() {
|
---|
72 | Parameters.Add(new ValueLookupParameter<TranslocationMoveGenerator>("TranslocationMoveGenerator", "The move generator.",
|
---|
73 | new StochasticTranslocationMultiMoveGenerator()));
|
---|
74 | Parameters.Add(new ValueLookupParameter<IntValue>("SampleSize", "The number of moves to generate."));
|
---|
75 |
|
---|
76 | ((IMultiMoveGenerator)TranslocationMoveGeneratorParameter.Value).SampleSizeParameter.ActualName = SampleSizeParameter.Name;
|
---|
77 | }
|
---|
78 |
|
---|
79 | public override IOperation Apply() {
|
---|
80 | IOperation successor = base.Apply();
|
---|
81 |
|
---|
82 | Permutation permutation = VRPSolutionParameter.ActualValue as Permutation;
|
---|
83 | string moveName = TranslocationMoveGeneratorParameter.ActualValue.TranslocationMoveParameter.Name;
|
---|
84 | int cities = VRPSolutionParameter.ActualValue.Cities;
|
---|
85 |
|
---|
86 | List<Scope> toBeDeleted = new List<Scope>();
|
---|
87 | foreach (Scope scope in this.ExecutionContext.Scope.SubScopes) {
|
---|
88 | if (scope.Variables.ContainsKey(moveName)) {
|
---|
89 | TranslocationMove move = scope.Variables[moveName].Value as TranslocationMove;
|
---|
90 |
|
---|
91 | if (move != null) {
|
---|
92 | bool criteria1 = true;
|
---|
93 | if (move.Index1 - 1 >= 0 &&
|
---|
94 | move.Index3 - 1 >= 0)
|
---|
95 | criteria1 = (permutation[move.Index1] >= cities &&
|
---|
96 | permutation[move.Index1 - 1] >= cities &&
|
---|
97 | permutation[move.Index3 - 1] >= cities);
|
---|
98 |
|
---|
99 | int index3 = move.Index3 + (move.Index2 - move.Index1) + 1;
|
---|
100 | bool criteria2 = true;
|
---|
101 | if (move.Index2 + 1 < permutation.Length &&
|
---|
102 | index3 < permutation.Length)
|
---|
103 | criteria2 = (permutation[move.Index2] >= cities &&
|
---|
104 | permutation[move.Index2 + 1] >= cities &&
|
---|
105 | permutation[index3] >= cities);
|
---|
106 |
|
---|
107 | if (criteria1 && criteria2)
|
---|
108 | toBeDeleted.Add(scope);
|
---|
109 | }
|
---|
110 | }
|
---|
111 | }
|
---|
112 |
|
---|
113 | foreach (Scope scope in toBeDeleted) {
|
---|
114 | this.ExecutionContext.Scope.SubScopes.Remove(scope);
|
---|
115 | }
|
---|
116 |
|
---|
117 | return successor;
|
---|
118 | }
|
---|
119 | }
|
---|
120 | }
|
---|