[4365] | 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 |
|
---|
| 22 | using HeuristicLab.Core;
|
---|
| 23 | using HeuristicLab.Encodings.PermutationEncoding;
|
---|
| 24 | using HeuristicLab.Parameters;
|
---|
| 25 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 26 | using HeuristicLab.Data;
|
---|
[4752] | 27 | using HeuristicLab.Common;
|
---|
[4365] | 28 |
|
---|
| 29 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Alba {
|
---|
| 30 | [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.")]
|
---|
| 31 | [StorableClass]
|
---|
| 32 | public sealed class AlbaCustomerInsertionManipulator : AlbaManipulator {
|
---|
| 33 | [StorableConstructor]
|
---|
| 34 | private AlbaCustomerInsertionManipulator(bool deserializing) : base(deserializing) { }
|
---|
| 35 |
|
---|
| 36 | public AlbaCustomerInsertionManipulator()
|
---|
| 37 | : base() {
|
---|
| 38 | }
|
---|
| 39 |
|
---|
[4752] | 40 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 41 | return new AlbaCustomerInsertionManipulator(this, cloner);
|
---|
| 42 | }
|
---|
| 43 |
|
---|
| 44 | private AlbaCustomerInsertionManipulator(AlbaCustomerInsertionManipulator original, Cloner cloner)
|
---|
| 45 | : base(original, cloner) {
|
---|
| 46 | }
|
---|
| 47 |
|
---|
[4365] | 48 | protected override void Manipulate(IRandom random, AlbaEncoding individual) {
|
---|
| 49 | AlbaEncoding original = (AlbaEncoding)individual.Clone();
|
---|
| 50 | int cutIndex, insertIndex, number;
|
---|
| 51 |
|
---|
| 52 | int customer = random.Next(ProblemInstance.Cities.Value);
|
---|
| 53 | cutIndex = FindCustomerLocation(customer, individual);
|
---|
| 54 |
|
---|
| 55 | insertIndex = random.Next(original.Length);
|
---|
| 56 | number = original[cutIndex];
|
---|
| 57 |
|
---|
| 58 | int i = 0; // index in new permutation
|
---|
| 59 | int j = 0; // index in old permutation
|
---|
| 60 | while (i < original.Length) {
|
---|
| 61 | if (j == cutIndex) {
|
---|
| 62 | j++;
|
---|
| 63 | }
|
---|
| 64 | if (i == insertIndex) {
|
---|
| 65 | individual[i] = number;
|
---|
| 66 | i++;
|
---|
| 67 | }
|
---|
| 68 | if ((i < original.Length) && (j < original.Length)) {
|
---|
| 69 | individual[i] = original[j];
|
---|
| 70 | i++;
|
---|
| 71 | j++;
|
---|
| 72 | }
|
---|
| 73 | }
|
---|
| 74 | }
|
---|
| 75 | }
|
---|
| 76 | }
|
---|