[13368] | 1 | #region License Information
|
---|
[4370] | 2 | /* HeuristicLab
|
---|
[12012] | 3 | * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[4370] | 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;
|
---|
[4370] | 24 | using HeuristicLab.Core;
|
---|
| 25 | using HeuristicLab.Optimization;
|
---|
[8053] | 26 | using HeuristicLab.Parameters;
|
---|
[4370] | 27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 28 | using HeuristicLab.Problems.VehicleRouting.Interfaces;
|
---|
| 29 |
|
---|
| 30 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Alba {
|
---|
| 31 | [Item("AlbaStochasticIntraRouteInversionSingleMoveGenerator", "Generates one random intra route inversion move from a given VRP encoding. It is implemented as described in Alba, E. and Dorronsoro, B. (2004). Solving the Vehicle Routing Problem by Using Cellular Genetic Algorithms.")]
|
---|
[14711] | 32 | [StorableType("569ED174-120D-498B-A78C-43E4F24440B8")]
|
---|
[4370] | 33 | public sealed class AlbaStochasticIntraRouteInversionSingleMoveGenerator : AlbaIntraRouteInversionMoveGenerator,
|
---|
[5867] | 34 | IStochasticOperator, ISingleMoveGenerator, IAlbaIntraRouteInversionMoveOperator {
|
---|
[4370] | 35 | #region IMultiVRPMoveOperator Members
|
---|
| 36 |
|
---|
| 37 | public override ILookupParameter VRPMoveParameter {
|
---|
| 38 | get { return (ILookupParameter)Parameters["AlbaIntraRouteInversionMove"]; }
|
---|
| 39 | }
|
---|
| 40 |
|
---|
| 41 | #endregion
|
---|
[8053] | 42 |
|
---|
[4370] | 43 | public ILookupParameter<IRandom> RandomParameter {
|
---|
| 44 | get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
|
---|
| 45 | }
|
---|
[8053] | 46 |
|
---|
[4370] | 47 | [StorableConstructor]
|
---|
| 48 | private AlbaStochasticIntraRouteInversionSingleMoveGenerator(bool deserializing) : base(deserializing) { }
|
---|
| 49 |
|
---|
| 50 | public AlbaStochasticIntraRouteInversionSingleMoveGenerator()
|
---|
| 51 | : base() {
|
---|
[8053] | 52 | Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator."));
|
---|
[4370] | 53 | }
|
---|
| 54 |
|
---|
[4752] | 55 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 56 | return new AlbaStochasticIntraRouteInversionSingleMoveGenerator(this, cloner);
|
---|
| 57 | }
|
---|
| 58 |
|
---|
| 59 | private AlbaStochasticIntraRouteInversionSingleMoveGenerator(AlbaStochasticIntraRouteInversionSingleMoveGenerator original, Cloner cloner)
|
---|
| 60 | : base(original, cloner) {
|
---|
| 61 | }
|
---|
| 62 |
|
---|
[4370] | 63 | public static AlbaIntraRouteInversionMove Apply(AlbaEncoding individual, int cities, IRandom rand) {
|
---|
| 64 | int index1 = -1;
|
---|
| 65 | int index2 = -1;
|
---|
| 66 |
|
---|
| 67 | List<Tour> validTours = new List<Tour>();
|
---|
| 68 | foreach (Tour tour in individual.GetTours()) {
|
---|
| 69 | if (tour.Stops.Count >= 4)
|
---|
| 70 | validTours.Add(tour);
|
---|
| 71 | }
|
---|
| 72 |
|
---|
| 73 | if (validTours.Count > 0) {
|
---|
| 74 | Tour chosenTour = validTours[rand.Next(validTours.Count)];
|
---|
| 75 | int currentTourStart = -1;
|
---|
| 76 | for (int i = 0; i < individual.Length; i++) {
|
---|
| 77 | if (individual[i] + 1 == chosenTour.Stops[0]) {
|
---|
| 78 | currentTourStart = i;
|
---|
| 79 | break;
|
---|
| 80 | }
|
---|
| 81 | }
|
---|
| 82 |
|
---|
| 83 | int currentTourEnd = currentTourStart;
|
---|
| 84 | while (currentTourEnd < individual.Length &&
|
---|
| 85 | individual[currentTourEnd] < cities) {
|
---|
| 86 | currentTourEnd++;
|
---|
| 87 | }
|
---|
| 88 |
|
---|
| 89 | int tourLength = currentTourEnd - currentTourStart;
|
---|
| 90 | int a = rand.Next(tourLength - 3);
|
---|
| 91 | index1 = currentTourStart + a;
|
---|
| 92 | index2 = currentTourStart + rand.Next(a + 2, tourLength - 1);
|
---|
| 93 | }
|
---|
| 94 |
|
---|
| 95 | return new AlbaIntraRouteInversionMove(index1, index2, individual);
|
---|
| 96 | }
|
---|
| 97 |
|
---|
| 98 | protected override AlbaIntraRouteInversionMove[] GenerateMoves(AlbaEncoding individual, IVRPProblemInstance problemInstance) {
|
---|
| 99 | List<AlbaIntraRouteInversionMove> moves = new List<AlbaIntraRouteInversionMove>();
|
---|
| 100 |
|
---|
| 101 | AlbaIntraRouteInversionMove move = Apply(individual, problemInstance.Cities.Value, RandomParameter.ActualValue);
|
---|
[8053] | 102 | if (move != null)
|
---|
[4370] | 103 | moves.Add(move);
|
---|
| 104 |
|
---|
| 105 | return moves.ToArray();
|
---|
| 106 | }
|
---|
| 107 | }
|
---|
| 108 | }
|
---|