[6773] | 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 System;
|
---|
| 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Optimization;
|
---|
| 25 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 26 | using HeuristicLab.Parameters;
|
---|
| 27 | using System.Collections.Generic;
|
---|
| 28 | using HeuristicLab.Problems.VehicleRouting.Interfaces;
|
---|
| 29 | using HeuristicLab.Common;
|
---|
| 30 | using HeuristicLab.Problems.VehicleRouting.Variants;
|
---|
| 31 |
|
---|
| 32 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Potvin {
|
---|
| 33 | [Item("PotvinPDExchangeExhaustiveMoveGenerator", "Generates exchange moves from a given PDP encoding.")]
|
---|
| 34 | [StorableClass]
|
---|
| 35 | public sealed class PotvinPDExchangeExhaustiveMoveGenerator : PotvinPDExchangeMoveGenerator, IExhaustiveMoveGenerator {
|
---|
| 36 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 37 | return new PotvinPDExchangeExhaustiveMoveGenerator(this, cloner);
|
---|
| 38 | }
|
---|
| 39 |
|
---|
| 40 | [StorableConstructor]
|
---|
| 41 | private PotvinPDExchangeExhaustiveMoveGenerator(bool deserializing) : base(deserializing) { }
|
---|
| 42 |
|
---|
| 43 | public PotvinPDExchangeExhaustiveMoveGenerator()
|
---|
| 44 | : base() {
|
---|
| 45 | }
|
---|
| 46 |
|
---|
| 47 | private PotvinPDExchangeExhaustiveMoveGenerator(PotvinPDExchangeExhaustiveMoveGenerator original, Cloner cloner)
|
---|
| 48 | : base(original, cloner) {
|
---|
| 49 | }
|
---|
| 50 |
|
---|
| 51 | protected override PotvinPDExchangeMove[] GenerateMoves(PotvinEncoding individual, IVRPProblemInstance problemInstance) {
|
---|
| 52 | List<PotvinPDExchangeMove> result = new List<PotvinPDExchangeMove>();
|
---|
| 53 | IPickupAndDeliveryProblemInstance pdp = problemInstance as IPickupAndDeliveryProblemInstance;
|
---|
| 54 |
|
---|
| 55 | int max = individual.Tours.Count;
|
---|
| 56 | if (individual.Tours.Count < problemInstance.Vehicles.Value)
|
---|
| 57 | max = max - 1;
|
---|
| 58 |
|
---|
| 59 | for (int i = 0; i < individual.Tours.Count; i++) {
|
---|
| 60 | for (int j = 0; j < individual.Tours[i].Stops.Count; j++) {
|
---|
| 61 | for (int k = 0; k <= max; k++) {
|
---|
| 62 | if (k != i) {
|
---|
| 63 | int city1 = individual.Tours[i].Stops[j];
|
---|
[6851] | 64 | if (pdp == null || pdp.GetDemand(city1) >= 0) {
|
---|
[6773] | 65 | for (int l = 0; l < individual.Tours[k].Stops.Count; l++) {
|
---|
| 66 | int city2 = individual.Tours[k].Stops[l];
|
---|
[6851] | 67 | if (pdp == null || pdp.GetDemand(city2) >= 0) {
|
---|
[6773] | 68 | bool valid = pdp == null ||
|
---|
| 69 | (pdp.PickupDeliveryLocation[city2] != pdp.PickupDeliveryLocation[city1] &&
|
---|
| 70 | pdp.PickupDeliveryLocation[city2] != city1 &&
|
---|
| 71 | pdp.PickupDeliveryLocation[city1] != city2);
|
---|
| 72 |
|
---|
| 73 | if (valid) {
|
---|
| 74 | PotvinPDExchangeMove move = new PotvinPDExchangeMove(
|
---|
| 75 | city1, i, k, city2, individual);
|
---|
| 76 |
|
---|
| 77 | result.Add(move);
|
---|
| 78 | }
|
---|
| 79 | }
|
---|
| 80 | }
|
---|
| 81 | }
|
---|
| 82 | }
|
---|
| 83 | }
|
---|
| 84 | }
|
---|
| 85 | }
|
---|
| 86 |
|
---|
| 87 | return result.ToArray();
|
---|
| 88 | }
|
---|
| 89 | }
|
---|
| 90 | }
|
---|