Free cookie consent management tool by TermsFeed Policy Generator

source: branches/VRP/HeuristicLab.Problems.VehicleRouting/3.4/Encodings/Potvin/Crossovers/PotvinRouteBasedCrossover.cs @ 6607

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

Merged changes from trunk (#1561) into branch (#1177)

File size: 2.9 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 HeuristicLab.Core;
23using HeuristicLab.Encodings.PermutationEncoding;
24using HeuristicLab.Parameters;
25using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
26using HeuristicLab.Data;
27using HeuristicLab.Common;
28
29namespace HeuristicLab.Problems.VehicleRouting.Encodings.Potvin {
30  [Item("PotvinRouteBasedCrossover", "The RBX 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.")]
31  [StorableClass]
32  public sealed class PotvinRouteBasedCrossover : PotvinCrossover {
33    [StorableConstructor]
34    private PotvinRouteBasedCrossover(bool deserializing) : base(deserializing) { }
35
36    public PotvinRouteBasedCrossover()
37      : base() { }
38
39    public override IDeepCloneable Clone(Cloner cloner) {
40      return new PotvinRouteBasedCrossover(this, cloner);
41    }
42
43    private PotvinRouteBasedCrossover(PotvinRouteBasedCrossover original, Cloner cloner)
44      : base(original, cloner) {
45    }
46     
47    protected override PotvinEncoding Crossover(IRandom random, PotvinEncoding parent1, PotvinEncoding parent2) {
48      bool allowInfeasible = AllowInfeasibleSolutions.Value.Value;
49
50      PotvinEncoding child = parent2.Clone() as PotvinEncoding;
51
52      int tourParent1 = random.Next(parent1.Tours.Count);
53      Tour replacing = parent1.Tours[tourParent1].Clone() as Tour;
54
55      int tourParent2 = random.Next(child.Tours.Count);
56      Tour replaced = child.Tours[tourParent2];
57
58      child.Tours.Remove(replaced);
59      child.Tours.Add(replacing);
60
61      foreach (int city in replaced.Stops)
62        if (FindRoute(child, city) == null && !child.Unrouted.Contains(city))
63          child.Unrouted.Add(city);
64
65      if (Repair(random, child, replacing, ProblemInstance, allowInfeasible) || allowInfeasible)
66        return child;
67      else {
68        if(random.NextDouble() < 0.5)
69          return parent1.Clone() as PotvinEncoding;
70        else
71          return parent2.Clone() as PotvinEncoding;
72      }
73    }
74  }
75}
Note: See TracBrowser for help on using the repository browser.