Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Problems.VehicleRouting/3.3/Encodings/Potvin/Manipulators/Potvin1MManipulator.cs @ 4177

Last change on this file since 4177 was 4177, checked in by svonolfe, 12 years ago

Refactored VRP in preparation for the code review (#1039)

File size: 2.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.Core;
23using HeuristicLab.Encodings.PermutationEncoding;
24using HeuristicLab.Parameters;
25using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
26using HeuristicLab.Data;
27using System.Collections.Generic;
28
29namespace HeuristicLab.Problems.VehicleRouting.Encodings.Potvin {
30  [Item("Potvin1MMainpulator", "The one-level exchange operator which manipulates a Potvin 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.")]
31  [StorableClass]
32  public sealed class Potvin1MMainpulator : PotvinManipulator {
33    protected override void Manipulate(IRandom random, PotvinEncoding individual) {
34      int selectedIndex = SelectRandomTourBiasedByLength(random, individual);
35      Tour route1 =
36        individual.Tours[selectedIndex];
37
38      List<int> replaced = new List<int>();
39      for (int i = 0; i < route1.Cities.Count; i++) {
40        int insertedRoute, insertedPlace;
41
42        if (FindInsertionPlace(individual, route1.Cities[i], selectedIndex, out insertedRoute, out insertedPlace)) {
43          individual.Tours[insertedRoute].Cities.Insert(insertedPlace, route1.Cities[i]);
44          replaced.Add(route1.Cities[i]);
45        }
46      }
47
48      route1.Cities.RemoveAll(
49        new System.Predicate<int>(
50          delegate(int val) {
51            return (replaced.Contains(val));
52          }
53        )
54      );
55
56      if (route1.Cities.Count == 0)
57        individual.Tours.Remove(route1);
58    }
59  }
60}
Note: See TracBrowser for help on using the repository browser.