[7689] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[14185] | 3 | * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[7689] | 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 |
|
---|
[8053] | 22 | using System.Collections.Generic;
|
---|
| 23 | using HeuristicLab.Common;
|
---|
[7689] | 24 | using HeuristicLab.Core;
|
---|
[8053] | 25 | using HeuristicLab.Data;
|
---|
[7689] | 26 | using HeuristicLab.Optimization;
|
---|
[8053] | 27 | using HeuristicLab.Parameters;
|
---|
[14927] | 28 | using HeuristicLab.Persistence;
|
---|
[8053] | 29 | using HeuristicLab.Problems.VehicleRouting.Encodings.General;
|
---|
[7689] | 30 | using HeuristicLab.Problems.VehicleRouting.Interfaces;
|
---|
| 31 |
|
---|
| 32 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Potvin {
|
---|
[7865] | 33 | [Item("PotvinTwoOptStarMultiMoveGenerator", "Generates two opt star moves from a given VRP encoding.")]
|
---|
[14927] | 34 | [StorableType("f0880331-82de-46a4-b7d5-fad1ec3598d9")]
|
---|
[7865] | 35 | public sealed class PotvinTwoOptStarMultiMoveGenerator : PotvinTwoOptStarMoveGenerator, IMultiMoveGenerator, IMultiVRPMoveGenerator {
|
---|
[7689] | 36 | public ILookupParameter<IRandom> RandomParameter {
|
---|
| 37 | get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
|
---|
| 38 | }
|
---|
| 39 |
|
---|
| 40 | public IValueLookupParameter<IntValue> SampleSizeParameter {
|
---|
| 41 | get { return (IValueLookupParameter<IntValue>)Parameters["SampleSize"]; }
|
---|
| 42 | }
|
---|
| 43 |
|
---|
| 44 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
[7865] | 45 | return new PotvinTwoOptStarMultiMoveGenerator(this, cloner);
|
---|
[7689] | 46 | }
|
---|
| 47 |
|
---|
| 48 | [StorableConstructor]
|
---|
[15018] | 49 | private PotvinTwoOptStarMultiMoveGenerator(StorableConstructorFlag deserializing) : base(deserializing) { }
|
---|
[7689] | 50 |
|
---|
[7865] | 51 | public PotvinTwoOptStarMultiMoveGenerator()
|
---|
[7689] | 52 | : base() {
|
---|
| 53 | Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator."));
|
---|
| 54 | Parameters.Add(new ValueLookupParameter<IntValue>("SampleSize", "The number of moves to generate."));
|
---|
| 55 | }
|
---|
| 56 |
|
---|
[7906] | 57 | private PotvinTwoOptStarMultiMoveGenerator(PotvinTwoOptStarMultiMoveGenerator original, Cloner cloner)
|
---|
[7689] | 58 | : base(original, cloner) {
|
---|
| 59 | }
|
---|
| 60 |
|
---|
[7865] | 61 | protected override PotvinTwoOptStarMove[] GenerateMoves(PotvinEncoding individual, IVRPProblemInstance problemInstance) {
|
---|
| 62 | List<PotvinTwoOptStarMove> result = new List<PotvinTwoOptStarMove>();
|
---|
[7689] | 63 |
|
---|
| 64 | for (int i = 0; i < SampleSizeParameter.ActualValue.Value; i++) {
|
---|
[7865] | 65 | result.Add(PotvinTwoOptStarSingleMoveGenerator.Apply(individual, ProblemInstance, RandomParameter.ActualValue));
|
---|
[7689] | 66 | }
|
---|
| 67 |
|
---|
| 68 | return result.ToArray();
|
---|
| 69 | }
|
---|
| 70 | }
|
---|
| 71 | }
|
---|