[6773] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17181] | 3 | * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[6773] | 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 |
|
---|
[8053] | 22 | using System.Collections.Generic;
|
---|
| 23 | using HeuristicLab.Common;
|
---|
[6773] | 24 | using HeuristicLab.Core;
|
---|
| 25 | using HeuristicLab.Optimization;
|
---|
[8053] | 26 | using HeuristicLab.Parameters;
|
---|
[17097] | 27 | using HEAL.Attic;
|
---|
[6773] | 28 | using HeuristicLab.Problems.VehicleRouting.Interfaces;
|
---|
| 29 | using HeuristicLab.Problems.VehicleRouting.Variants;
|
---|
| 30 |
|
---|
| 31 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Potvin {
|
---|
| 32 | [Item("PotvinPDExchangeSingleMoveGenerator", "Generates a single exchange move from a given PDP encoding.")]
|
---|
[17097] | 33 | [StorableType("3A621754-DD4D-47BA-91B0-FC857D11D45B")]
|
---|
[6773] | 34 | public sealed class PotvinPDExchangeSingleMoveGenerator : PotvinPDExchangeMoveGenerator,
|
---|
[8053] | 35 | ISingleMoveGenerator {
|
---|
[6773] | 36 | public ILookupParameter<IRandom> RandomParameter {
|
---|
| 37 | get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
|
---|
| 38 | }
|
---|
| 39 |
|
---|
| 40 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 41 | return new PotvinPDExchangeSingleMoveGenerator(this, cloner);
|
---|
| 42 | }
|
---|
| 43 |
|
---|
| 44 | [StorableConstructor]
|
---|
[17097] | 45 | private PotvinPDExchangeSingleMoveGenerator(StorableConstructorFlag _) : base(_) { }
|
---|
[6773] | 46 |
|
---|
| 47 | public PotvinPDExchangeSingleMoveGenerator()
|
---|
| 48 | : base() {
|
---|
| 49 | Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator."));
|
---|
| 50 | }
|
---|
| 51 |
|
---|
| 52 | private PotvinPDExchangeSingleMoveGenerator(PotvinPDExchangeSingleMoveGenerator original, Cloner cloner)
|
---|
| 53 | : base(original, cloner) {
|
---|
| 54 | }
|
---|
| 55 |
|
---|
| 56 | public static PotvinPDExchangeMove 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++) {
|
---|
[6851] | 61 | if (pdp == null || pdp.GetDemand(i) >= 0)
|
---|
[6773] | 62 | cities.Add(i);
|
---|
| 63 | }
|
---|
| 64 |
|
---|
[6909] | 65 | if (cities.Count > 1 && individual.Tours.Count > 1) {
|
---|
| 66 | PotvinPDExchangeMove move = null;
|
---|
| 67 | while (cities.Count > 1 && move == null) {
|
---|
| 68 | int city = cities[rand.Next(cities.Count)];
|
---|
| 69 | Tour oldTour = individual.Tours.Find(t => t.Stops.Contains(city));
|
---|
| 70 | int oldTourIndex = individual.Tours.IndexOf(oldTour);
|
---|
[6773] | 71 |
|
---|
[13457] | 72 | int max = individual.Tours.Count - 1;
|
---|
[6773] | 73 |
|
---|
[6909] | 74 | int newTourIndex = rand.Next(max);
|
---|
| 75 | if (newTourIndex >= oldTourIndex)
|
---|
| 76 | newTourIndex++;
|
---|
[6773] | 77 |
|
---|
[6909] | 78 | Tour newTour = individual.Tours[newTourIndex];
|
---|
| 79 | List<int> tourCities = new List<int>();
|
---|
| 80 | foreach (int stop in newTour.Stops) {
|
---|
| 81 | if (pdp == null ||
|
---|
| 82 | (pdp.GetDemand(stop) >= 0 &&
|
---|
| 83 | pdp.GetPickupDeliveryLocation(stop) != pdp.GetPickupDeliveryLocation(city) &&
|
---|
| 84 | pdp.GetPickupDeliveryLocation(stop) != city &&
|
---|
| 85 | pdp.GetPickupDeliveryLocation(city) != stop))
|
---|
| 86 | tourCities.Add(stop);
|
---|
| 87 | }
|
---|
[6773] | 88 |
|
---|
[6909] | 89 | if (tourCities.Count > 0) {
|
---|
| 90 | int replaced = tourCities[rand.Next(tourCities.Count)];
|
---|
| 91 | move = new PotvinPDExchangeMove(city, oldTourIndex, newTourIndex, replaced, individual);
|
---|
| 92 | }
|
---|
[6773] | 93 | }
|
---|
| 94 |
|
---|
[6909] | 95 | return move;
|
---|
| 96 | } else {
|
---|
| 97 | return null;
|
---|
[8053] | 98 | }
|
---|
[6773] | 99 | }
|
---|
| 100 |
|
---|
| 101 | protected override PotvinPDExchangeMove[] GenerateMoves(PotvinEncoding individual, IVRPProblemInstance problemInstance) {
|
---|
| 102 | List<PotvinPDExchangeMove> result = new List<PotvinPDExchangeMove>();
|
---|
| 103 |
|
---|
| 104 | PotvinPDExchangeMove move = Apply(individual, ProblemInstance, RandomParameter.ActualValue);
|
---|
| 105 | if (move != null)
|
---|
| 106 | result.Add(move);
|
---|
| 107 |
|
---|
| 108 | return result.ToArray();
|
---|
| 109 | }
|
---|
| 110 | }
|
---|
| 111 | }
|
---|