[4204] | 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.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 24 | using HeuristicLab.Encodings.PermutationEncoding;
|
---|
| 25 | using HeuristicLab.Common;
|
---|
[4205] | 26 | using HeuristicLab.Problems.VehicleRouting.Encodings.General;
|
---|
| 27 | using HeuristicLab.Data;
|
---|
[4204] | 28 |
|
---|
| 29 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Alba {
|
---|
| 30 | [Item("InversionMove", "Item that describes a simple local search move on an Alba VRP representation.")]
|
---|
| 31 | [StorableClass]
|
---|
[4205] | 32 | public class SimpleLocalSearchMove : TwoIndexMove, IVRPMove {
|
---|
[4204] | 33 | public SimpleLocalSearchMove()
|
---|
| 34 | : base() {
|
---|
| 35 | }
|
---|
| 36 |
|
---|
| 37 | public SimpleLocalSearchMove(int index1, int index2)
|
---|
| 38 | : base(index1, index2, null) {
|
---|
| 39 | }
|
---|
| 40 |
|
---|
| 41 | public SimpleLocalSearchMove(int index1, int index2, AlbaEncoding permutation)
|
---|
| 42 | : base(index1, index2, permutation) {
|
---|
| 43 | }
|
---|
| 44 |
|
---|
| 45 | public override IDeepCloneable Clone(HeuristicLab.Common.Cloner cloner) {
|
---|
| 46 | SimpleLocalSearchMove clone = new SimpleLocalSearchMove(
|
---|
| 47 | Index1, Index2);
|
---|
| 48 |
|
---|
| 49 | if (Permutation != null)
|
---|
| 50 | clone.Permutation = (AlbaEncoding)cloner.Clone(Permutation);
|
---|
| 51 |
|
---|
| 52 | cloner.RegisterClonedObject(this, clone);
|
---|
| 53 | return clone;
|
---|
| 54 | }
|
---|
[4205] | 55 |
|
---|
| 56 | #region IVRPMove Members
|
---|
| 57 |
|
---|
| 58 | public TourEvaluation GetMoveQuality(
|
---|
| 59 | IVRPEncoding individual,
|
---|
| 60 | DoubleArray dueTimeArray, DoubleArray serviceTimeArray, DoubleArray readyTimeArray,
|
---|
| 61 | DoubleArray demandArray, DoubleValue capacity, DoubleMatrix coordinates,
|
---|
| 62 | DoubleValue fleetUsageFactor, DoubleValue timeFactor, DoubleValue distanceFactor,
|
---|
| 63 | DoubleValue overloadPenalty, DoubleValue tardinessPenalty,
|
---|
| 64 | ILookupParameter<DoubleMatrix> distanceMatrix, Data.BoolValue useDistanceMatrix) {
|
---|
| 65 | return SimpleLocalSearchMoveEvaluator.GetMoveQuality(individual as AlbaEncoding, this,
|
---|
| 66 | dueTimeArray, serviceTimeArray, readyTimeArray, demandArray, capacity,
|
---|
| 67 | coordinates, fleetUsageFactor, timeFactor, distanceFactor,
|
---|
| 68 | overloadPenalty, tardinessPenalty, distanceMatrix, useDistanceMatrix);
|
---|
| 69 | }
|
---|
| 70 |
|
---|
| 71 | public void MakeMove(IRandom random, IVRPEncoding individual) {
|
---|
| 72 | SimpleLocalSearchMoveMaker.Apply(individual as AlbaEncoding, this);
|
---|
| 73 | }
|
---|
| 74 |
|
---|
| 75 | #endregion
|
---|
[4204] | 76 | }
|
---|
| 77 | }
|
---|