1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2012 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.Common;
|
---|
23 | using HeuristicLab.Core;
|
---|
24 | using HeuristicLab.Data;
|
---|
25 | using HeuristicLab.Encodings.PermutationEncoding;
|
---|
26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
27 | using HeuristicLab.Problems.VehicleRouting.Encodings.General;
|
---|
28 |
|
---|
29 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Alba {
|
---|
30 | [Item("InversionMove", "Item that describes an intra route inversion move on a VRP representation. 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 class AlbaIntraRouteInversionMove : TwoIndexMove, IVRPMove {
|
---|
33 | public IVRPEncoding Individual { get { return Permutation as AlbaEncoding; } }
|
---|
34 |
|
---|
35 | [StorableConstructor]
|
---|
36 | protected AlbaIntraRouteInversionMove(bool deserializing) : base(deserializing) { }
|
---|
37 | protected AlbaIntraRouteInversionMove(AlbaIntraRouteInversionMove original, Cloner cloner)
|
---|
38 | : base(original, cloner) {
|
---|
39 | }
|
---|
40 | public AlbaIntraRouteInversionMove()
|
---|
41 | : base() {
|
---|
42 | }
|
---|
43 |
|
---|
44 | public AlbaIntraRouteInversionMove(int index1, int index2)
|
---|
45 | : base(index1, index2, null) {
|
---|
46 | }
|
---|
47 |
|
---|
48 | public AlbaIntraRouteInversionMove(int index1, int index2, AlbaEncoding permutation)
|
---|
49 | : base(index1, index2, null) {
|
---|
50 | this.Permutation = permutation.Clone() as AlbaEncoding;
|
---|
51 | }
|
---|
52 |
|
---|
53 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
54 | return new AlbaIntraRouteInversionMove(this, cloner);
|
---|
55 | }
|
---|
56 |
|
---|
57 | #region IVRPMove Members
|
---|
58 |
|
---|
59 | public TourEvaluation GetMoveQuality(
|
---|
60 | IntValue vehicles,
|
---|
61 | DoubleArray dueTimeArray, DoubleArray serviceTimeArray, DoubleArray readyTimeArray,
|
---|
62 | DoubleArray demandArray, DoubleValue capacity, DoubleMatrix coordinates,
|
---|
63 | DoubleValue fleetUsageFactor, DoubleValue timeFactor, DoubleValue distanceFactor,
|
---|
64 | DoubleValue overloadPenalty, DoubleValue tardinessPenalty,
|
---|
65 | ILookupParameter<DoubleMatrix> distanceMatrix, Data.BoolValue useDistanceMatrix) {
|
---|
66 | return AlbaIntraRouteInversionMoveEvaluator.GetMoveQuality(Permutation as AlbaEncoding, this, vehicles,
|
---|
67 | dueTimeArray, serviceTimeArray, readyTimeArray, demandArray, capacity,
|
---|
68 | coordinates, fleetUsageFactor, timeFactor, distanceFactor,
|
---|
69 | overloadPenalty, tardinessPenalty, distanceMatrix, useDistanceMatrix);
|
---|
70 | }
|
---|
71 |
|
---|
72 | public IVRPEncoding MakeMove() {
|
---|
73 | AlbaIntraRouteInversionMoveMaker.Apply(Individual as AlbaEncoding, this);
|
---|
74 |
|
---|
75 | return Individual;
|
---|
76 | }
|
---|
77 |
|
---|
78 | #endregion
|
---|
79 | }
|
---|
80 | }
|
---|