1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 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 HEAL.Attic;
|
---|
27 | using HeuristicLab.Problems.VehicleRouting.Interfaces;
|
---|
28 | using HeuristicLab.Problems.VehicleRouting.Variants;
|
---|
29 |
|
---|
30 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Potvin {
|
---|
31 | [Item("PotvinPDExchangeExhaustiveMoveGenerator", "Generates exchange moves from a given PDP encoding.")]
|
---|
32 | [StorableType("EF921D7D-7DBE-45D9-B7F2-6364F2546981")]
|
---|
33 | public sealed class PotvinPDExchangeExhaustiveMoveGenerator : PotvinPDExchangeMoveGenerator, IExhaustiveMoveGenerator {
|
---|
34 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
35 | return new PotvinPDExchangeExhaustiveMoveGenerator(this, cloner);
|
---|
36 | }
|
---|
37 |
|
---|
38 | [StorableConstructor]
|
---|
39 | private PotvinPDExchangeExhaustiveMoveGenerator(StorableConstructorFlag _) : base(_) { }
|
---|
40 |
|
---|
41 | public PotvinPDExchangeExhaustiveMoveGenerator()
|
---|
42 | : base() {
|
---|
43 | }
|
---|
44 |
|
---|
45 | private PotvinPDExchangeExhaustiveMoveGenerator(PotvinPDExchangeExhaustiveMoveGenerator original, Cloner cloner)
|
---|
46 | : base(original, cloner) {
|
---|
47 | }
|
---|
48 |
|
---|
49 | protected override PotvinPDExchangeMove[] GenerateMoves(PotvinEncoding individual, IVRPProblemInstance problemInstance) {
|
---|
50 | List<PotvinPDExchangeMove> result = new List<PotvinPDExchangeMove>();
|
---|
51 | IPickupAndDeliveryProblemInstance pdp = problemInstance as IPickupAndDeliveryProblemInstance;
|
---|
52 |
|
---|
53 | int max = individual.Tours.Count;
|
---|
54 | if (individual.Tours.Count < problemInstance.Vehicles.Value)
|
---|
55 | max = max - 1;
|
---|
56 |
|
---|
57 | for (int i = 0; i < individual.Tours.Count; i++) {
|
---|
58 | for (int j = 0; j < individual.Tours[i].Stops.Count; j++) {
|
---|
59 | for (int k = 0; k <= max; k++) {
|
---|
60 | if (k != i) {
|
---|
61 | int city1 = individual.Tours[i].Stops[j];
|
---|
62 | if (pdp == null || pdp.GetDemand(city1) >= 0) {
|
---|
63 | for (int l = 0; l < individual.Tours[k].Stops.Count; l++) {
|
---|
64 | int city2 = individual.Tours[k].Stops[l];
|
---|
65 | if (pdp == null || pdp.GetDemand(city2) >= 0) {
|
---|
66 | bool valid = pdp == null ||
|
---|
67 | (pdp.GetPickupDeliveryLocation(city2) != pdp.GetPickupDeliveryLocation(city1) &&
|
---|
68 | pdp.GetPickupDeliveryLocation(city2) != city1 &&
|
---|
69 | pdp.GetPickupDeliveryLocation(city1) != city2);
|
---|
70 |
|
---|
71 | if (valid) {
|
---|
72 | PotvinPDExchangeMove move = new PotvinPDExchangeMove(
|
---|
73 | city1, i, k, city2, individual);
|
---|
74 |
|
---|
75 | result.Add(move);
|
---|
76 | }
|
---|
77 | }
|
---|
78 | }
|
---|
79 | }
|
---|
80 | }
|
---|
81 | }
|
---|
82 | }
|
---|
83 | }
|
---|
84 |
|
---|
85 | return result.ToArray();
|
---|
86 | }
|
---|
87 | }
|
---|
88 | }
|
---|