1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2019 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 HeuristicLab.Common;
|
---|
23 | using HeuristicLab.Core;
|
---|
24 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
25 |
|
---|
26 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Alba {
|
---|
27 | [Item("AlbaCustomerInsertionManipulator", "An operator which manipulates a VRP representation by inserting a customer in another place. It is implemented as described in Alba, E. and Dorronsoro, B. (2004). Solving the Vehicle Routing Problem by Using Cellular Genetic Algorithms.")]
|
---|
28 | [StorableClass]
|
---|
29 | public sealed class AlbaCustomerInsertionManipulator : AlbaManipulator {
|
---|
30 | [StorableConstructor]
|
---|
31 | private AlbaCustomerInsertionManipulator(bool deserializing) : base(deserializing) { }
|
---|
32 |
|
---|
33 | public AlbaCustomerInsertionManipulator()
|
---|
34 | : base() {
|
---|
35 | }
|
---|
36 |
|
---|
37 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
38 | return new AlbaCustomerInsertionManipulator(this, cloner);
|
---|
39 | }
|
---|
40 |
|
---|
41 | private AlbaCustomerInsertionManipulator(AlbaCustomerInsertionManipulator original, Cloner cloner)
|
---|
42 | : base(original, cloner) {
|
---|
43 | }
|
---|
44 |
|
---|
45 | protected override void Manipulate(IRandom random, AlbaEncoding individual) {
|
---|
46 | AlbaEncoding original = (AlbaEncoding)individual.Clone();
|
---|
47 | int cutIndex, insertIndex, number;
|
---|
48 |
|
---|
49 | int customer = random.Next(ProblemInstance.Cities.Value);
|
---|
50 | cutIndex = FindCustomerLocation(customer, individual);
|
---|
51 |
|
---|
52 | insertIndex = random.Next(original.Length);
|
---|
53 | number = original[cutIndex];
|
---|
54 |
|
---|
55 | int i = 0; // index in new permutation
|
---|
56 | int j = 0; // index in old permutation
|
---|
57 | while (i < original.Length) {
|
---|
58 | if (j == cutIndex) {
|
---|
59 | j++;
|
---|
60 | }
|
---|
61 | if (i == insertIndex) {
|
---|
62 | individual[i] = number;
|
---|
63 | i++;
|
---|
64 | }
|
---|
65 | if ((i < original.Length) && (j < original.Length)) {
|
---|
66 | individual[i] = original[j];
|
---|
67 | i++;
|
---|
68 | j++;
|
---|
69 | }
|
---|
70 | }
|
---|
71 | }
|
---|
72 | }
|
---|
73 | }
|
---|