| 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;
|
|---|
| 27 | using HeuristicLab.Common;
|
|---|
| 28 |
|
|---|
| 29 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Prins {
|
|---|
| 30 | [Item("PrinsPermutationCrossover", "An operator which crosses two VRP representations using a standard permutation operator. 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.")]
|
|---|
| 31 | [StorableClass]
|
|---|
| 32 | public sealed class PrinsPermutationCrossover : PrinsCrossover, IPrinsOperator {
|
|---|
| 33 | public IValueLookupParameter<IPermutationCrossover> InnerCrossoverParameter {
|
|---|
| 34 | get { return (IValueLookupParameter<IPermutationCrossover>)Parameters["InnerCrossover"]; }
|
|---|
| 35 | }
|
|---|
| 36 |
|
|---|
| 37 | [StorableConstructor]
|
|---|
| 38 | private PrinsPermutationCrossover(bool deserializing) : base(deserializing) { }
|
|---|
| 39 | private PrinsPermutationCrossover(PrinsPermutationCrossover original, Cloner cloner) : base(original, cloner) { }
|
|---|
| 40 | public override IDeepCloneable Clone(Cloner cloner) {
|
|---|
| 41 | return new PrinsPermutationCrossover(this, cloner);
|
|---|
| 42 | }
|
|---|
| 43 | public PrinsPermutationCrossover()
|
|---|
| 44 | : base() {
|
|---|
| 45 | Parameters.Add(new ValueLookupParameter<IPermutationCrossover>("InnerCrossover", "The permutation crossover.", new OrderCrossover()));
|
|---|
| 46 | }
|
|---|
| 47 |
|
|---|
| 48 | protected override PrinsEncoding Crossover(IRandom random, PrinsEncoding parent1, PrinsEncoding parent2) {
|
|---|
| 49 | //note - the inner crossover is called here and the result is converted to a prins representation
|
|---|
| 50 | //some refactoring should be done here in the future - the crossover operation should be called directly
|
|---|
| 51 |
|
|---|
| 52 | InnerCrossoverParameter.ActualValue.ParentsParameter.ActualName = ParentsParameter.ActualName;
|
|---|
| 53 | IAtomicOperation op = this.ExecutionContext.CreateOperation(
|
|---|
| 54 | InnerCrossoverParameter.ActualValue, this.ExecutionContext.Scope);
|
|---|
| 55 | op.Operator.Execute((IExecutionContext)op);
|
|---|
| 56 |
|
|---|
| 57 | string childName = InnerCrossoverParameter.ActualValue.ChildParameter.ActualName;
|
|---|
| 58 | if (ExecutionContext.Scope.Variables.ContainsKey(childName)) {
|
|---|
| 59 | Permutation permutation = ExecutionContext.Scope.Variables[childName].Value as Permutation;
|
|---|
| 60 | ExecutionContext.Scope.Variables.Remove(childName);
|
|---|
| 61 |
|
|---|
| 62 | return new PrinsEncoding(permutation, Cities,
|
|---|
| 63 | DueTimeParameter.ActualValue,
|
|---|
| 64 | ServiceTimeParameter.ActualValue,
|
|---|
| 65 | ReadyTimeParameter.ActualValue,
|
|---|
| 66 | DemandParameter.ActualValue,
|
|---|
| 67 | CapacityParameter.ActualValue,
|
|---|
| 68 | FleetUsageFactor.ActualValue,
|
|---|
| 69 | TimeFactor.ActualValue,
|
|---|
| 70 | DistanceFactor.ActualValue,
|
|---|
| 71 | OverloadPenalty.ActualValue,
|
|---|
| 72 | TardinessPenalty.ActualValue,
|
|---|
| 73 | CoordinatesParameter.ActualValue,
|
|---|
| 74 | UseDistanceMatrixParameter.ActualValue);
|
|---|
| 75 | } else
|
|---|
| 76 | return null;
|
|---|
| 77 | }
|
|---|
| 78 | }
|
|---|
| 79 | }
|
|---|
