Free cookie consent management tool by TermsFeed Policy Generator

source: branches/ParameterBinding/HeuristicLab.Problems.VehicleRouting/3.3/Encodings/Potvin/Manipulators/PotvinTwoLevelExchangeManipulator.cs @ 11247

Last change on this file since 11247 was 4722, checked in by swagner, 14 years ago

Merged cloning refactoring branch back into trunk (#922)

File size: 3.4 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.Common;
23using HeuristicLab.Core;
24using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
25
26namespace HeuristicLab.Problems.VehicleRouting.Encodings.Potvin {
27  [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.")]
28  [StorableClass]
29  public sealed class PotvinTwoLevelExchangeManipulator : PotvinManipulator {
30    [StorableConstructor]
31    private PotvinTwoLevelExchangeManipulator(bool deserializing) : base(deserializing) { }
32    private PotvinTwoLevelExchangeManipulator(PotvinTwoLevelExchangeManipulator original, Cloner cloner) : base(original, cloner) { }
33    public override IDeepCloneable Clone(Cloner cloner) {
34      return new PotvinTwoLevelExchangeManipulator(this, cloner);
35    }
36    public PotvinTwoLevelExchangeManipulator() : base() { }
37
38    protected override void Manipulate(IRandom random, PotvinEncoding individual) {
39      int selectedIndex = SelectRandomTourBiasedByLength(random, individual);
40      Tour route1 =
41        individual.Tours[selectedIndex];
42
43      for (int customer1Position = 0; customer1Position < route1.Cities.Count; customer1Position++) {
44        foreach (Tour tour in individual.Tours) {
45          if (tour != route1) {
46            for (int customer2Position = 0; customer2Position < tour.Cities.Count; customer2Position++) {
47              int customer1 = route1.Cities[customer1Position];
48              int customer2 = tour.Cities[customer2Position];
49
50              //customer1 can be feasibly inserted at the location of customer2
51              tour.Cities[customer2Position] = customer1;
52              if (Feasible(tour)) {
53                int route, place;
54                if (FindInsertionPlace(individual,
55                  customer2, selectedIndex, out route, out place)) {
56                  individual.Tours[route].Cities.Insert(place, customer2);
57                  route1.Cities.RemoveAt(customer1Position);
58
59                  if (route1.Cities.Count == 0)
60                    individual.Tours.Remove(route1);
61
62                  //two-level exchange has been performed
63                  return;
64                } else {
65                  tour.Cities[customer2Position] = customer2;
66                }
67              } else {
68                tour.Cities[customer2Position] = customer2;
69              }
70            }
71          }
72        }
73      }
74    }
75  }
76}
Note: See TracBrowser for help on using the repository browser.