1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2018 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 System.Collections.Generic;
|
---|
23 | using HeuristicLab.Common;
|
---|
24 | using HeuristicLab.Core;
|
---|
25 | using HeuristicLab.Optimization;
|
---|
26 | using HeuristicLab.Parameters;
|
---|
27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
28 | using HeuristicLab.Problems.VehicleRouting.Interfaces;
|
---|
29 | using HeuristicLab.Problems.VehicleRouting.Variants;
|
---|
30 |
|
---|
31 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Potvin {
|
---|
32 | [Item("PotvinPDRearrangeSingleMoveGenerator", "Generates a single rearrange move from a given PDP encoding.")]
|
---|
33 | [StorableClass]
|
---|
34 | public sealed class PotvinPDRearrangeSingleMoveGenerator : PotvinPDRearrangeMoveGenerator,
|
---|
35 | ISingleMoveGenerator {
|
---|
36 | public ILookupParameter<IRandom> RandomParameter {
|
---|
37 | get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
|
---|
38 | }
|
---|
39 |
|
---|
40 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
41 | return new PotvinPDRearrangeSingleMoveGenerator(this, cloner);
|
---|
42 | }
|
---|
43 |
|
---|
44 | [StorableConstructor]
|
---|
45 | private PotvinPDRearrangeSingleMoveGenerator(bool deserializing) : base(deserializing) { }
|
---|
46 |
|
---|
47 | public PotvinPDRearrangeSingleMoveGenerator()
|
---|
48 | : base() {
|
---|
49 | Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator."));
|
---|
50 | }
|
---|
51 |
|
---|
52 | private PotvinPDRearrangeSingleMoveGenerator(PotvinPDRearrangeSingleMoveGenerator original, Cloner cloner)
|
---|
53 | : base(original, cloner) {
|
---|
54 | }
|
---|
55 |
|
---|
56 | public static PotvinPDRearrangeMove Apply(PotvinEncoding individual, IVRPProblemInstance problemInstance, IRandom rand) {
|
---|
57 | List<int> cities = new List<int>();
|
---|
58 |
|
---|
59 | IPickupAndDeliveryProblemInstance pdp = problemInstance as IPickupAndDeliveryProblemInstance;
|
---|
60 | for (int i = 1; i <= individual.Cities; i++) {
|
---|
61 | if (pdp == null || pdp.GetDemand(i) >= 0)
|
---|
62 | cities.Add(i);
|
---|
63 | }
|
---|
64 |
|
---|
65 | if (cities.Count > 0) {
|
---|
66 | int city = cities[rand.Next(cities.Count)];
|
---|
67 | int tour = individual.Tours.FindIndex(t => t.Stops.Contains(city));
|
---|
68 | return new PotvinPDRearrangeMove(city, tour, individual);
|
---|
69 | } else {
|
---|
70 | return null;
|
---|
71 | }
|
---|
72 | }
|
---|
73 |
|
---|
74 | protected override PotvinPDRearrangeMove[] GenerateMoves(PotvinEncoding individual, IVRPProblemInstance problemInstance) {
|
---|
75 | List<PotvinPDRearrangeMove> result = new List<PotvinPDRearrangeMove>();
|
---|
76 |
|
---|
77 | PotvinPDRearrangeMove move = Apply(individual, ProblemInstance, RandomParameter.ActualValue);
|
---|
78 | if (move != null)
|
---|
79 | result.Add(move);
|
---|
80 |
|
---|
81 | return result.ToArray();
|
---|
82 | }
|
---|
83 | }
|
---|
84 | }
|
---|