#region License Information
/* HeuristicLab
* Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
*
* This file is part of HeuristicLab.
*
* HeuristicLab is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* HeuristicLab is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with HeuristicLab. If not, see .
*/
#endregion
using HeuristicLab.Common;
using HeuristicLab.Core;
using HeuristicLab.Parameters;
using HEAL.Attic;
using HeuristicLab.Problems.VehicleRouting.Interfaces;
namespace HeuristicLab.Problems.VehicleRouting.Encodings.General {
[Item("VRPCrossover", "Crosses VRP solutions.")]
[StorableType("E26BAD0A-49E6-477C-AEA0-CB41552F0B2B")]
public abstract class VRPCrossover : VRPOperator, IVRPCrossover {
public ILookupParameter> ParentsParameter {
get { return (ScopeTreeLookupParameter)Parameters["Parents"]; }
}
public ILookupParameter ChildParameter {
get { return (ILookupParameter)Parameters["Child"]; }
}
[StorableConstructor]
protected VRPCrossover(StorableConstructorFlag _) : base(_) { }
public VRPCrossover()
: base() {
Parameters.Add(new ScopeTreeLookupParameter("Parents", "The parent permutations which should be crossed."));
ParentsParameter.ActualName = "VRPTours";
Parameters.Add(new LookupParameter("Child", "The child permutation resulting from the crossover."));
ChildParameter.ActualName = "VRPTours";
}
protected VRPCrossover(VRPCrossover original, Cloner cloner)
: base(original, cloner) {
}
}
}