Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Problems.VehicleRouting/3.3/Encodings/Potvin/Crossovers/PotvinSequenceBasedCrossover.cs @ 8978

Last change on this file since 8978 was 7259, checked in by swagner, 13 years ago

Updated year of copyrights to 2012 (#1716)

File size: 4.0 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2012 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 HeuristicLab.Common;
23using HeuristicLab.Core;
24using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
25using HeuristicLab.Data;
26
27namespace HeuristicLab.Problems.VehicleRouting.Encodings.Potvin {
28  [Item("PotvinSequenceBasedCrossover", "The SBX crossover for a VRP representations.  It is implemented as described in Potvin, J.-Y. and Bengio, S. (1996). The Vehicle Routing Problem with Time Windows - Part II: Genetic Search. INFORMS Journal of Computing, 8:165–172.")]
29  [StorableClass]
30  public sealed class PotvinSequenceBasedCrossover : PotvinCrossover {
31    [StorableConstructor]
32    private PotvinSequenceBasedCrossover(bool deserializing) : base(deserializing) { }
33    private PotvinSequenceBasedCrossover(PotvinSequenceBasedCrossover original, Cloner cloner)
34      : base(original, cloner) {
35    }
36    public override IDeepCloneable Clone(Cloner cloner) {
37      return new PotvinSequenceBasedCrossover(this, cloner);
38    }
39
40    public PotvinSequenceBasedCrossover()
41      : base() { }
42
43    protected override PotvinEncoding Crossover(IRandom random, PotvinEncoding parent1, PotvinEncoding parent2) {
44      BoolValue useDistanceMatrix = UseDistanceMatrixParameter.ActualValue;
45      DoubleMatrix coordinates = CoordinatesParameter.ActualValue;
46      DistanceMatrix distMatrix = VRPUtilities.GetDistanceMatrix(coordinates, DistanceMatrixParameter, useDistanceMatrix);
47      DoubleArray dueTime = DueTimeParameter.ActualValue;
48      DoubleArray readyTime = ReadyTimeParameter.ActualValue;
49      DoubleArray serviceTime = ServiceTimeParameter.ActualValue;
50      DoubleArray demand = DemandParameter.ActualValue;
51      DoubleValue capacity = CapacityParameter.ActualValue;
52
53      bool allowInfeasible = AllowInfeasibleSolutions.Value.Value;
54
55      PotvinEncoding child = parent1.Clone() as PotvinEncoding;
56      Tour newTour = new Tour();
57
58      int breakPoint1 = random.Next(1, Cities + 1);
59      Tour tour1 = FindRoute(child, breakPoint1);
60      breakPoint1 = tour1.Cities.IndexOf(breakPoint1);
61
62      for (int i = 0; i < breakPoint1; i++)
63        newTour.Cities.Add(tour1.Cities[i]);
64
65      int breakPoint2 = random.Next(1, Cities + 1);
66      Tour tour2 = FindRoute(parent2, breakPoint2);
67      breakPoint2 = tour2.Cities.IndexOf(breakPoint2);
68
69      for (int i = breakPoint2; i < tour2.Cities.Count; i++)
70        newTour.Cities.Add(tour2.Cities[i]);
71
72      child.Tours.Remove(tour1);
73      child.Tours.Add(newTour);
74
75      foreach (int city in tour1.Cities)
76        if (FindRoute(child, city) == null && !child.Unrouted.Contains(city))
77          child.Unrouted.Add(city);
78
79      foreach (int city in tour2.Cities)
80        if (FindRoute(child, city) == null && !child.Unrouted.Contains(city))
81          child.Unrouted.Add(city);
82
83      if (Repair(random, child, newTour, distMatrix, dueTime, readyTime, serviceTime, demand, capacity, allowInfeasible) || allowInfeasible) {
84        return child;
85      } else {
86         if (random.NextDouble() < 0.5)
87          return parent1.Clone() as PotvinEncoding;
88        else
89          return parent2.Clone() as PotvinEncoding;   
90      }
91    }
92  }
93}
Note: See TracBrowser for help on using the repository browser.