1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2012 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.GVR {
|
---|
28 | [Item("GVRDisplacementManipulator", "An operator which manipulates a GVR representation by applying a displacement operation. It is implemented as described in Pereira, F.B. et al (2002). GVR: a New Genetic Representation for the Vehicle Routing Problem. AICS 2002, LNAI 2464, pp. 95-102.")]
|
---|
29 | [StorableClass]
|
---|
30 | public sealed class GVRDisplacementManipulator : GVRManipulator {
|
---|
31 | [StorableConstructor]
|
---|
32 | private GVRDisplacementManipulator(bool deserializing) : base(deserializing) { }
|
---|
33 |
|
---|
34 | public GVRDisplacementManipulator()
|
---|
35 | : base() {
|
---|
36 | }
|
---|
37 |
|
---|
38 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
39 | return new GVRDisplacementManipulator(this, cloner);
|
---|
40 | }
|
---|
41 |
|
---|
42 | private GVRDisplacementManipulator(GVRDisplacementManipulator original, Cloner cloner)
|
---|
43 | : base(original, cloner) {
|
---|
44 | }
|
---|
45 |
|
---|
46 | protected override void Manipulate(IRandom random, GVREncoding individual) {
|
---|
47 | Tour tour = individual.Tours[random.Next(individual.Tours.Count)];
|
---|
48 | int breakPoint1 = random.Next(tour.Stops.Count);
|
---|
49 | int length = random.Next(1, tour.Stops.Count - breakPoint1 + 1);
|
---|
50 |
|
---|
51 | List<int> displaced = tour.Stops.GetRange(breakPoint1, length);
|
---|
52 | tour.Stops.RemoveRange(breakPoint1, length);
|
---|
53 | //with a probability of 1/(2*V) create a new tour, else insert at another position
|
---|
54 | if (individual.GetTours().Count > 0 &&
|
---|
55 | individual.GetTours().Count < ProblemInstance.Vehicles.Value &&
|
---|
56 | random.Next(individual.GetTours().Count * 2) == 0) {
|
---|
57 | Tour newTour = new Tour();
|
---|
58 | newTour.Stops.InsertRange(0, displaced);
|
---|
59 |
|
---|
60 | individual.Tours.Add(newTour);
|
---|
61 | } else {
|
---|
62 | Tour newTour = individual.Tours[random.Next(individual.Tours.Count)];
|
---|
63 | int newPosition = newTour.Stops.Count;
|
---|
64 |
|
---|
65 | newTour.Stops.InsertRange(newPosition, displaced);
|
---|
66 | }
|
---|
67 |
|
---|
68 | if (tour.Stops.Count == 0)
|
---|
69 | individual.Tours.Remove(tour);
|
---|
70 | }
|
---|
71 | }
|
---|
72 | }
|
---|