[4177] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[5445] | 3 | * Copyright (C) 2002-2011 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[4177] | 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;
|
---|
[4722] | 23 | using HeuristicLab.Common;
|
---|
[4177] | 24 | using HeuristicLab.Core;
|
---|
| 25 | using HeuristicLab.Optimization;
|
---|
| 26 | using HeuristicLab.Parameters;
|
---|
| 27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 28 |
|
---|
| 29 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.General {
|
---|
[4179] | 30 | [Item("RandomCreator", "Creates a randomly initialized VRP solution.")]
|
---|
[4177] | 31 | [StorableClass]
|
---|
[4179] | 32 | public sealed class RandomCreator : DefaultRepresentationCreator, IStochasticOperator {
|
---|
[4177] | 33 | #region IStochasticOperator Members
|
---|
| 34 | public ILookupParameter<IRandom> RandomParameter {
|
---|
| 35 | get { return (LookupParameter<IRandom>)Parameters["Random"]; }
|
---|
| 36 | }
|
---|
| 37 | #endregion
|
---|
| 38 |
|
---|
[4179] | 39 | [StorableConstructor]
|
---|
| 40 | private RandomCreator(bool deserializing) : base(deserializing) { }
|
---|
[4722] | 41 | private RandomCreator(RandomCreator original, Cloner cloner) : base(original, cloner) { }
|
---|
| 42 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 43 | return new RandomCreator(this, cloner);
|
---|
| 44 | }
|
---|
[4179] | 45 |
|
---|
[4177] | 46 | public RandomCreator()
|
---|
| 47 | : base() {
|
---|
| 48 | Parameters.Add(new LookupParameter<IRandom>("Random", "The pseudo random number generator."));
|
---|
| 49 | }
|
---|
| 50 |
|
---|
| 51 | protected override List<int> CreateSolution() {
|
---|
| 52 | int cities = Cities;
|
---|
| 53 | int vehicles = VehiclesParameter.ActualValue.Value;
|
---|
| 54 |
|
---|
| 55 | int[] perm = new int[cities + vehicles];
|
---|
| 56 | int[] sortingArray = new int[perm.Length - 2];
|
---|
| 57 | for (int i = 0; i < cities; i++)
|
---|
| 58 | perm[i] = i + 1;
|
---|
| 59 | for (int i = cities; i < cities + vehicles; i++)
|
---|
| 60 | perm[i] = 0;
|
---|
| 61 | for (int i = 0; i < perm.Length - 2; i++) {
|
---|
| 62 | sortingArray[i] = RandomParameter.ActualValue.Next(perm.Length * 2);
|
---|
| 63 | }
|
---|
| 64 | // shuffle perm from 1...n-1 by sorting sortingArray (perm[0] and perm[n] must stay 0)
|
---|
| 65 | bool done;
|
---|
| 66 | do {
|
---|
| 67 | done = true;
|
---|
| 68 | for (int i = 0; i < perm.Length - 3; i++) {
|
---|
| 69 | if (sortingArray[i] > sortingArray[i + 1]) {
|
---|
| 70 | int h = sortingArray[i];
|
---|
| 71 | sortingArray[i] = sortingArray[i + 1];
|
---|
| 72 | sortingArray[i + 1] = h;
|
---|
| 73 | h = perm[i + 1];
|
---|
| 74 | perm[i + 1] = perm[i + 2];
|
---|
| 75 | perm[i + 2] = h;
|
---|
| 76 | done = false;
|
---|
| 77 | }
|
---|
| 78 | }
|
---|
| 79 | } while (!done);
|
---|
| 80 |
|
---|
| 81 | return new List<int>(perm);
|
---|
| 82 | }
|
---|
| 83 | }
|
---|
| 84 | }
|
---|