source: branches/SpectralKernelForGaussianProcesses/HeuristicLab.Problems.VehicleRouting/3.4/Encodings/Potvin/Manipulators/PotvinTwoLevelExchangeManipulator.cs @ 10479

Last change on this file since 10479 was 10479, checked in by gkronber, 6 years ago

#2124 merged all changes from trunk to prepare for trunk-reintegration

File size: 4.1 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2013 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.Problems.VehicleRouting.Interfaces;
26
27namespace HeuristicLab.Problems.VehicleRouting.Encodings.Potvin {
28  [Item("PotvinTwoLevelExchangeManipulator", "The 2M operator which manipulates a VRP representation.  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 PotvinTwoLevelExchangeManipulator : PotvinManipulator {
31    [StorableConstructor]
32    private PotvinTwoLevelExchangeManipulator(bool deserializing) : base(deserializing) { }
33
34    public PotvinTwoLevelExchangeManipulator() : base() { }
35
36    public override IDeepCloneable Clone(Cloner cloner) {
37      return new PotvinTwoLevelExchangeManipulator(this, cloner);
38    }
39
40    private PotvinTwoLevelExchangeManipulator(PotvinTwoLevelExchangeManipulator original, Cloner cloner)
41      : base(original, cloner) {
42    }
43
44    public static void ApplyManipulation(IRandom random, PotvinEncoding individual, IVRPProblemInstance instance, bool allowInfeasible) {
45      int selectedIndex = SelectRandomTourBiasedByLength(random, individual, instance);
46      if (selectedIndex >= 0) {
47        Tour route1 = individual.Tours[selectedIndex];
48
49        bool performed = false;
50        int customer1Position = 0;
51        while (customer1Position < route1.Stops.Count) {
52          performed = false;
53
54          foreach (Tour tour in individual.Tours) {
55            if (tour != route1) {
56              for (int customer2Position = 0; customer2Position < tour.Stops.Count; customer2Position++) {
57                int customer1 = route1.Stops[customer1Position];
58                int customer2 = tour.Stops[customer2Position];
59
60                //customer1 can be feasibly inserted at the location of customer2
61                tour.Stops[customer2Position] = customer1;
62                route1.Stops.RemoveAt(customer1Position);
63
64                if (instance.TourFeasible(tour, individual)) {
65                  int routeIdx, place;
66                  if (FindInsertionPlace(individual,
67                    customer2, selectedIndex, allowInfeasible, out routeIdx, out place)) {
68                    individual.Tours[routeIdx].Stops.Insert(place, customer2);
69
70                    //two-level exchange has been performed
71                    performed = true;
72                    break;
73                  } else {
74                    tour.Stops[customer2Position] = customer2;
75                    route1.Stops.Insert(customer1Position, customer1);
76                  }
77                } else {
78                  tour.Stops[customer2Position] = customer2;
79                  route1.Stops.Insert(customer1Position, customer1);
80                }
81              }
82            }
83
84            if (performed)
85              break;
86          }
87
88          if (!performed)
89            customer1Position++;
90        }
91      }
92    }
93     
94
95    protected override void Manipulate(IRandom random, PotvinEncoding individual) {
96      bool allowInfeasible = AllowInfeasibleSolutions.Value.Value;
97
98      ApplyManipulation(random, individual, ProblemInstance, allowInfeasible);
99    }
100  }
101}
Note: See TracBrowser for help on using the repository browser.