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.Optimization;
|
---|
25 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
26 | using HeuristicLab.Problems.VehicleRouting.Encodings.Alba;
|
---|
27 | using HeuristicLab.Parameters;
|
---|
28 | using System.Collections.Generic;
|
---|
29 | using HeuristicLab.Data;
|
---|
30 | using HeuristicLab.Problems.VehicleRouting.Interfaces;
|
---|
31 |
|
---|
32 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Alba {
|
---|
33 | [Item("AlbaStochasticLambdaInterchangeMultiMoveGenerator", "Generates multiple random lambda interchange 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.")]
|
---|
34 | [StorableClass]
|
---|
35 | public sealed class AlbaStochasticLambdaInterchangeMultiMoveGenerator : AlbaLambdaInterchangeMoveGenerator, IStochasticOperator, IMultiMoveGenerator, IAlbaLambdaInterchangeMoveOperator {
|
---|
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 | [StorableConstructor]
|
---|
45 | private AlbaStochasticLambdaInterchangeMultiMoveGenerator(bool deserializing) : base(deserializing) { }
|
---|
46 |
|
---|
47 | public AlbaStochasticLambdaInterchangeMultiMoveGenerator()
|
---|
48 | : base() {
|
---|
49 | Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator."));
|
---|
50 | Parameters.Add(new ValueLookupParameter<IntValue>("SampleSize", "The number of moves to generate."));
|
---|
51 | }
|
---|
52 |
|
---|
53 | protected override AlbaLambdaInterchangeMove[] GenerateMoves(AlbaEncoding individual, IVRPProblemInstance problemInstance, int lambda) {
|
---|
54 | int sampleSize = SampleSizeParameter.ActualValue.Value;
|
---|
55 |
|
---|
56 | AlbaLambdaInterchangeMove[] moves = new AlbaLambdaInterchangeMove[sampleSize];
|
---|
57 | for (int i = 0; i < sampleSize; i++) {
|
---|
58 | moves[i] = AlbaStochasticLambdaInterchangeSingleMoveGenerator.Apply(
|
---|
59 | individual, problemInstance.Cities.Value, lambda, RandomParameter.ActualValue);
|
---|
60 | }
|
---|
61 |
|
---|
62 | return moves;
|
---|
63 | }
|
---|
64 | }
|
---|
65 | }
|
---|