Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Problems.VehicleRouting/3.4/Encodings/Potvin/Manipulators/PotvinOneLevelExchangeManipulator.cs @ 10460

Last change on this file since 10460 was 10460, checked in by svonolfe, 10 years ago

added static apply methods to VRP operators (#2152)

File size: 3.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("PotvinOneLevelExchangeMainpulator", "The 1M 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 PotvinOneLevelExchangeMainpulator : PotvinManipulator {
31    [StorableConstructor]
32    private PotvinOneLevelExchangeMainpulator(bool deserializing) : base(deserializing) { }
33
34    public PotvinOneLevelExchangeMainpulator() : base() { }
35
36    public override IDeepCloneable Clone(Cloner cloner) {
37      return new PotvinOneLevelExchangeMainpulator(this, cloner);
38    }
39
40    private PotvinOneLevelExchangeMainpulator(PotvinOneLevelExchangeMainpulator 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 =
48          individual.Tours[selectedIndex];
49
50        int count = route1.Stops.Count;
51        int i = 0;
52        while (i < count) {
53          int insertedRoute, insertedPlace;
54
55          int city = route1.Stops[i];
56          route1.Stops.Remove(city);
57
58          if (FindInsertionPlace(individual, city, selectedIndex, allowInfeasible, out insertedRoute, out insertedPlace)) {
59            individual.Tours[insertedRoute].Stops.Insert(insertedPlace, city);
60          } else {
61            route1.Stops.Insert(i, city);
62            i++;
63          }
64
65          count = route1.Stops.Count;
66        }
67      }
68    }
69
70    protected override void Manipulate(IRandom random, PotvinEncoding individual) {
71      bool allowInfeasible = AllowInfeasibleSolutions.Value.Value;
72      ApplyManipulation(random, individual, ProblemInstance, allowInfeasible);     
73    }
74  }
75}
Note: See TracBrowser for help on using the repository browser.