[4370] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17180] | 3 | * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[4370] | 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 HeuristicLab.Common;
|
---|
[4370] | 23 | using HeuristicLab.Core;
|
---|
[8053] | 24 | using HeuristicLab.Data;
|
---|
[4370] | 25 | using HeuristicLab.Optimization;
|
---|
[8053] | 26 | using HeuristicLab.Parameters;
|
---|
[16565] | 27 | using HEAL.Attic;
|
---|
[8053] | 28 | using HeuristicLab.Problems.VehicleRouting.Encodings.General;
|
---|
[4370] | 29 | using HeuristicLab.Problems.VehicleRouting.Interfaces;
|
---|
| 30 |
|
---|
| 31 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Alba {
|
---|
| 32 | [Item("AlbaStochasticIntraRouteInversionMultiMoveGenerator", "Generates multiple random intra route inversion moves from a given VRP encoding. It is implemented as described in Alba, E. and Dorronsoro, B. (2004). Solving the Vehicle Routing Problem by Using Cellular Genetic Algorithms.")]
|
---|
[16565] | 33 | [StorableType("16DCDE21-1817-467B-B3E2-06BEF35541BD")]
|
---|
[5867] | 34 | public sealed class AlbaStochasticIntraRouteInversionMultiMoveGenerator : AlbaIntraRouteInversionMoveGenerator, IStochasticOperator,
|
---|
| 35 | IMultiMoveGenerator, IAlbaIntraRouteInversionMoveOperator, IMultiVRPMoveGenerator {
|
---|
[4370] | 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 | }
|
---|
[8053] | 43 |
|
---|
[4370] | 44 | [StorableConstructor]
|
---|
[16565] | 45 | private AlbaStochasticIntraRouteInversionMultiMoveGenerator(StorableConstructorFlag _) : base(_) { }
|
---|
[4370] | 46 |
|
---|
| 47 | public AlbaStochasticIntraRouteInversionMultiMoveGenerator()
|
---|
| 48 | : base() {
|
---|
[8053] | 49 | Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator."));
|
---|
| 50 | Parameters.Add(new ValueLookupParameter<IntValue>("SampleSize", "The number of moves to generate."));
|
---|
[4370] | 51 | }
|
---|
| 52 |
|
---|
[4752] | 53 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 54 | return new AlbaStochasticIntraRouteInversionMultiMoveGenerator(this, cloner);
|
---|
| 55 | }
|
---|
| 56 |
|
---|
| 57 | private AlbaStochasticIntraRouteInversionMultiMoveGenerator(AlbaStochasticIntraRouteInversionMultiMoveGenerator original, Cloner cloner)
|
---|
| 58 | : base(original, cloner) {
|
---|
| 59 | }
|
---|
| 60 |
|
---|
[4370] | 61 | protected override AlbaIntraRouteInversionMove[] GenerateMoves(AlbaEncoding individual, IVRPProblemInstance problemInstance) {
|
---|
| 62 | int sampleSize = SampleSizeParameter.ActualValue.Value;
|
---|
| 63 |
|
---|
| 64 | AlbaIntraRouteInversionMove[] moves = new AlbaIntraRouteInversionMove[sampleSize];
|
---|
| 65 | for (int i = 0; i < sampleSize; i++) {
|
---|
| 66 | moves[i] = AlbaStochasticIntraRouteInversionSingleMoveGenerator.Apply(
|
---|
| 67 | individual, problemInstance.Cities.Value, RandomParameter.ActualValue);
|
---|
| 68 | }
|
---|
| 69 |
|
---|
| 70 | return moves;
|
---|
| 71 | }
|
---|
| 72 | }
|
---|
| 73 | }
|
---|