1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2016 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 |
|
---|
22 | using System.Collections.Generic;
|
---|
23 | using HeuristicLab.Common;
|
---|
24 | using HeuristicLab.Core;
|
---|
25 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
26 |
|
---|
27 | namespace 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 |
|
---|
34 | public PrinsExhaustiveLSManipulator()
|
---|
35 | : base() {
|
---|
36 | }
|
---|
37 |
|
---|
38 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
39 | return new PrinsExhaustiveLSManipulator(this, cloner);
|
---|
40 | }
|
---|
41 |
|
---|
42 | private PrinsExhaustiveLSManipulator(PrinsExhaustiveLSManipulator original, Cloner cloner)
|
---|
43 | : base(original, cloner) {
|
---|
44 | }
|
---|
45 |
|
---|
46 | protected override void Manipulate(IRandom random, PrinsEncoding individual) {
|
---|
47 | List<Tour> tours = individual.GetTours();
|
---|
48 | bool improvement = false;
|
---|
49 | int iterations = 0;
|
---|
50 |
|
---|
51 | do {
|
---|
52 | int u = depot;
|
---|
53 | improvement = false;
|
---|
54 | double originalQuality = GetQuality(individual);
|
---|
55 | PrinsEncoding child = null;
|
---|
56 |
|
---|
57 | while (!improvement && u < ProblemInstance.Cities.Value) {
|
---|
58 | int v = depot;
|
---|
59 | while (!improvement && v < ProblemInstance.Cities.Value) {
|
---|
60 | if (u != v) {
|
---|
61 | child = Manipulate(individual,
|
---|
62 | originalQuality, u, v);
|
---|
63 |
|
---|
64 | improvement = child != null;
|
---|
65 | }
|
---|
66 | v++;
|
---|
67 | }
|
---|
68 | u++;
|
---|
69 | }
|
---|
70 |
|
---|
71 | if (improvement) {
|
---|
72 | for (int i = 0; i < child.Length; i++) {
|
---|
73 | individual[i] = child[i];
|
---|
74 | }
|
---|
75 | }
|
---|
76 |
|
---|
77 | iterations++;
|
---|
78 | } while (improvement &&
|
---|
79 | iterations < Iterations.Value.Value);
|
---|
80 | }
|
---|
81 | }
|
---|
82 | }
|
---|