Free cookie consent management tool by TermsFeed Policy Generator

source: branches/VRP/HeuristicLab.Problems.VehicleRouting/3.4/Encodings/Alba/Moves/LambdaInterchange/AlbaStochasticLambdaInterchangeSingleMoveGenerator.cs @ 5867

Last change on this file since 5867 was 5867, checked in by svonolfe, 13 years ago

Merged changes from trunk into branch (#1177)

File size: 4.3 KB
Line 
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
22using System;
23using HeuristicLab.Core;
24using HeuristicLab.Optimization;
25using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
26using HeuristicLab.Problems.VehicleRouting.Encodings.Alba;
27using HeuristicLab.Parameters;
28using System.Collections.Generic;
29using HeuristicLab.Problems.VehicleRouting.Encodings.General;
30using HeuristicLab.Problems.VehicleRouting.Interfaces;
31using HeuristicLab.Common;
32
33namespace HeuristicLab.Problems.VehicleRouting.Encodings.Alba {
34  [Item("AlbaStochasticLambdaInterchangeSingleMoveGenerator", "Generates one random lambda interchange move 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.")]
35  [StorableClass]
36  public sealed class AlbaStochasticLambdaInterchangeSingleMoveGenerator : AlbaLambdaInterchangeMoveGenerator,
37    IStochasticOperator, ISingleMoveGenerator, IAlbaLambdaInterchangeMoveOperator {
38    #region IMultiVRPMoveOperator Members
39
40    public override ILookupParameter VRPMoveParameter {
41      get { return (ILookupParameter)Parameters["AlbaLambdaInterchangeMove"]; }
42    }
43
44    #endregion
45   
46    public ILookupParameter<IRandom> RandomParameter {
47      get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
48    }
49   
50    [StorableConstructor]
51    private AlbaStochasticLambdaInterchangeSingleMoveGenerator(bool deserializing) : base(deserializing) { }
52
53    public AlbaStochasticLambdaInterchangeSingleMoveGenerator()
54      : base() {
55        Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator."));
56    }
57
58    public override IDeepCloneable Clone(Cloner cloner) {
59      return new AlbaStochasticLambdaInterchangeSingleMoveGenerator(this, cloner);
60    }
61
62    private AlbaStochasticLambdaInterchangeSingleMoveGenerator(AlbaStochasticLambdaInterchangeSingleMoveGenerator original, Cloner cloner)
63      : base(original, cloner) {
64    }
65
66    public static AlbaLambdaInterchangeMove Apply(AlbaEncoding individual, int cities, int lambda, IRandom rand) {
67      List<Tour> tours = individual.GetTours();
68
69      if (tours.Count > 1) {
70        int route1Index = rand.Next(tours.Count);
71        Tour route1 = tours[route1Index];
72
73        int route2Index = rand.Next(tours.Count - 1);
74        if (route2Index >= route1Index)
75          route2Index += 1;
76
77        Tour route2 = tours[route2Index];
78
79        int length1 = rand.Next(Math.Min(lambda + 1, route1.Stops.Count + 1));
80        int index1 = rand.Next(route1.Stops.Count - length1 + 1);
81
82        int l2Min = 0;
83        if (length1 == 0)
84          l2Min = 1;
85        int length2 = rand.Next(l2Min, Math.Min(lambda + 1, route2.Stops.Count + 1));
86        int index2 = rand.Next(route2.Stops.Count - length2 + 1);
87
88        return new AlbaLambdaInterchangeMove(route1Index, index1, length1, route2Index, index2, length2, individual);
89      } else {
90        return new AlbaLambdaInterchangeMove(0, 0, 0, 0, 0, 0, individual);
91      }
92    }
93
94    protected override AlbaLambdaInterchangeMove[] GenerateMoves(AlbaEncoding individual, IVRPProblemInstance problemInstance, int lambda) {
95      List<AlbaLambdaInterchangeMove> moves = new List<AlbaLambdaInterchangeMove>();
96
97      AlbaLambdaInterchangeMove move = Apply(individual, problemInstance.Cities.Value, lambda, RandomParameter.ActualValue);
98      if(move != null)
99        moves.Add(move);
100
101      return moves.ToArray();
102    }
103  }
104}
Note: See TracBrowser for help on using the repository browser.