[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.Data;
|
---|
| 31 | using HeuristicLab.Problems.VehicleRouting.Encodings.General;
|
---|
| 32 | using HeuristicLab.Problems.VehicleRouting.Variants;
|
---|
| 33 |
|
---|
| 34 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Potvin {
|
---|
| 35 | [Item("PotvinPDShiftSingleMoveGenerator", "Generates a single shift move from a given PDP encoding.")]
|
---|
| 36 | [StorableClass]
|
---|
| 37 | public sealed class PotvinPDShiftSingleMoveGenerator : PotvinPDShiftMoveGenerator,
|
---|
| 38 | ISingleMoveGenerator {
|
---|
| 39 | public ILookupParameter<IRandom> RandomParameter {
|
---|
| 40 | get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
|
---|
| 41 | }
|
---|
| 42 |
|
---|
| 43 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 44 | return new PotvinPDShiftSingleMoveGenerator(this, cloner);
|
---|
| 45 | }
|
---|
| 46 |
|
---|
| 47 | [StorableConstructor]
|
---|
| 48 | private PotvinPDShiftSingleMoveGenerator(bool deserializing) : base(deserializing) { }
|
---|
| 49 |
|
---|
| 50 | public PotvinPDShiftSingleMoveGenerator()
|
---|
| 51 | : base() {
|
---|
| 52 | Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator."));
|
---|
| 53 | }
|
---|
| 54 |
|
---|
| 55 | private PotvinPDShiftSingleMoveGenerator(PotvinPDShiftSingleMoveGenerator original, Cloner cloner)
|
---|
| 56 | : base(original, cloner) {
|
---|
| 57 | }
|
---|
| 58 |
|
---|
| 59 | public static PotvinPDShiftMove Apply(PotvinEncoding individual, IVRPProblemInstance problemInstance, IRandom rand) {
|
---|
| 60 | List<int> cities = new List<int>();
|
---|
| 61 |
|
---|
| 62 | IPickupAndDeliveryProblemInstance pdp = problemInstance as IPickupAndDeliveryProblemInstance;
|
---|
| 63 | for (int i = 1; i <= individual.Cities; i++) {
|
---|
| 64 | if(pdp == null || pdp.Demand[i] >= 0)
|
---|
| 65 | cities.Add(i);
|
---|
| 66 | }
|
---|
| 67 |
|
---|
| 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);
|
---|
| 71 |
|
---|
| 72 | int max = individual.Tours.Count;
|
---|
| 73 | if (individual.Tours.Count < problemInstance.Vehicles.Value)
|
---|
| 74 | max = max - 1;
|
---|
| 75 |
|
---|
| 76 | int newTourIndex = rand.Next(max);
|
---|
| 77 | if (newTourIndex >= oldTourIndex)
|
---|
| 78 | newTourIndex++;
|
---|
| 79 |
|
---|
| 80 | return new PotvinPDShiftMove(city, oldTourIndex, newTourIndex, individual);
|
---|
| 81 | }
|
---|
| 82 |
|
---|
| 83 | protected override PotvinPDShiftMove[] GenerateMoves(PotvinEncoding individual, IVRPProblemInstance problemInstance) {
|
---|
| 84 | List<PotvinPDShiftMove> result = new List<PotvinPDShiftMove>();
|
---|
| 85 |
|
---|
| 86 | PotvinPDShiftMove move = Apply(individual, ProblemInstance, RandomParameter.ActualValue);
|
---|
| 87 | if (move != null)
|
---|
| 88 | result.Add(move);
|
---|
| 89 |
|
---|
| 90 | return result.ToArray();
|
---|
| 91 | }
|
---|
| 92 | }
|
---|
| 93 | }
|
---|