Free cookie consent management tool by TermsFeed Policy Generator

source: branches/ParameterBinding/HeuristicLab.Problems.VehicleRouting/3.3/Encodings/Prins/Manipulators/PrinsExhaustiveLSManipulator.cs @ 13067

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

Merged cloning refactoring branch back into trunk (#922)

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 System.Collections.Generic;
23using HeuristicLab.Common;
24using HeuristicLab.Core;
25using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
26
27namespace HeuristicLab.Problems.VehicleRouting.Encodings.Prins {
28  [Item("PrinsExhaustiveLSManipulator", "An operator which manipulates a VRP representation by using the exhaustive Prins local search.  It is implemented as described in Prins, C. (2004). A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research, 12:1985-2002.")]
29  [StorableClass]
30  public sealed class PrinsExhaustiveLSManipulator : PrinsLSManipulator {   
31    [StorableConstructor]
32    private PrinsExhaustiveLSManipulator(bool deserializing) : base(deserializing) { }
33    private PrinsExhaustiveLSManipulator(PrinsExhaustiveLSManipulator original, Cloner cloner) : base(original, cloner) { }
34    public override IDeepCloneable Clone(Cloner cloner) {
35      return new PrinsExhaustiveLSManipulator(this, cloner);
36    }
37    public PrinsExhaustiveLSManipulator()
38      : base() {
39    }
40
41    protected override void Manipulate(IRandom random, PrinsEncoding individual) {
42      List<Tour> tours = individual.GetTours(DistanceMatrixParameter);
43      bool improvement = false;
44      int iterations = 0;
45
46      do {
47        int u = depot;
48        improvement = false;
49        double originalQuality = GetQuality(individual);
50        PrinsEncoding child = null;
51
52        while (!improvement && u < Cities) {
53          int v = depot;
54          while (!improvement && v < Cities) {
55            if (u != v) {
56              child = Manipulate(individual,
57                originalQuality, u, v);
58
59              improvement = child != null;
60            }
61            v++;
62          }
63          u++;
64        }
65
66        if (improvement) {
67          for (int i = 0; i < child.Length; i++) {
68            individual[i] = child[i];
69          }
70        }
71
72        iterations++;
73      } while (improvement &&
74        iterations < Iterations.Value.Value);
75    }
76  }
77}
Note: See TracBrowser for help on using the repository browser.