[4370] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[14185] | 3 | * Copyright (C) 2002-2016 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 |
|
---|
| 22 | using System;
|
---|
[8053] | 23 | using System.Collections.Generic;
|
---|
| 24 | using HeuristicLab.Common;
|
---|
[4370] | 25 | using HeuristicLab.Core;
|
---|
| 26 | using HeuristicLab.Optimization;
|
---|
[8053] | 27 | using HeuristicLab.Parameters;
|
---|
[4370] | 28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 29 | using HeuristicLab.Problems.VehicleRouting.Interfaces;
|
---|
| 30 |
|
---|
| 31 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Alba {
|
---|
| 32 | [Item("AlbaStochasticLambdaInterchangeSingleMoveGenerator", "Generates one random lambda interchange 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.")]
|
---|
| 33 | [StorableClass]
|
---|
| 34 | public sealed class AlbaStochasticLambdaInterchangeSingleMoveGenerator : AlbaLambdaInterchangeMoveGenerator,
|
---|
[5867] | 35 | IStochasticOperator, ISingleMoveGenerator, IAlbaLambdaInterchangeMoveOperator {
|
---|
[4370] | 36 | #region IMultiVRPMoveOperator Members
|
---|
| 37 |
|
---|
| 38 | public override ILookupParameter VRPMoveParameter {
|
---|
| 39 | get { return (ILookupParameter)Parameters["AlbaLambdaInterchangeMove"]; }
|
---|
| 40 | }
|
---|
| 41 |
|
---|
| 42 | #endregion
|
---|
[8053] | 43 |
|
---|
[4370] | 44 | public ILookupParameter<IRandom> RandomParameter {
|
---|
| 45 | get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
|
---|
| 46 | }
|
---|
[8053] | 47 |
|
---|
[4370] | 48 | [StorableConstructor]
|
---|
| 49 | private AlbaStochasticLambdaInterchangeSingleMoveGenerator(bool deserializing) : base(deserializing) { }
|
---|
| 50 |
|
---|
| 51 | public AlbaStochasticLambdaInterchangeSingleMoveGenerator()
|
---|
| 52 | : base() {
|
---|
[8053] | 53 | Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator."));
|
---|
[4370] | 54 | }
|
---|
| 55 |
|
---|
[4752] | 56 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 57 | return new AlbaStochasticLambdaInterchangeSingleMoveGenerator(this, cloner);
|
---|
| 58 | }
|
---|
| 59 |
|
---|
| 60 | private AlbaStochasticLambdaInterchangeSingleMoveGenerator(AlbaStochasticLambdaInterchangeSingleMoveGenerator original, Cloner cloner)
|
---|
| 61 | : base(original, cloner) {
|
---|
| 62 | }
|
---|
| 63 |
|
---|
[4370] | 64 | public static AlbaLambdaInterchangeMove Apply(AlbaEncoding individual, int cities, int lambda, IRandom rand) {
|
---|
| 65 | List<Tour> tours = individual.GetTours();
|
---|
| 66 |
|
---|
[5201] | 67 | if (tours.Count > 1) {
|
---|
| 68 | int route1Index = rand.Next(tours.Count);
|
---|
| 69 | Tour route1 = tours[route1Index];
|
---|
[4370] | 70 |
|
---|
[5201] | 71 | int route2Index = rand.Next(tours.Count - 1);
|
---|
| 72 | if (route2Index >= route1Index)
|
---|
| 73 | route2Index += 1;
|
---|
[4370] | 74 |
|
---|
[5201] | 75 | Tour route2 = tours[route2Index];
|
---|
[4370] | 76 |
|
---|
[5201] | 77 | int length1 = rand.Next(Math.Min(lambda + 1, route1.Stops.Count + 1));
|
---|
| 78 | int index1 = rand.Next(route1.Stops.Count - length1 + 1);
|
---|
[4370] | 79 |
|
---|
[5201] | 80 | int l2Min = 0;
|
---|
| 81 | if (length1 == 0)
|
---|
| 82 | l2Min = 1;
|
---|
| 83 | int length2 = rand.Next(l2Min, Math.Min(lambda + 1, route2.Stops.Count + 1));
|
---|
| 84 | int index2 = rand.Next(route2.Stops.Count - length2 + 1);
|
---|
| 85 |
|
---|
| 86 | return new AlbaLambdaInterchangeMove(route1Index, index1, length1, route2Index, index2, length2, individual);
|
---|
| 87 | } else {
|
---|
| 88 | return new AlbaLambdaInterchangeMove(0, 0, 0, 0, 0, 0, individual);
|
---|
| 89 | }
|
---|
[4370] | 90 | }
|
---|
| 91 |
|
---|
| 92 | protected override AlbaLambdaInterchangeMove[] GenerateMoves(AlbaEncoding individual, IVRPProblemInstance problemInstance, int lambda) {
|
---|
| 93 | List<AlbaLambdaInterchangeMove> moves = new List<AlbaLambdaInterchangeMove>();
|
---|
| 94 |
|
---|
| 95 | AlbaLambdaInterchangeMove move = Apply(individual, problemInstance.Cities.Value, lambda, RandomParameter.ActualValue);
|
---|
[8053] | 96 | if (move != null)
|
---|
[4370] | 97 | moves.Add(move);
|
---|
| 98 |
|
---|
| 99 | return moves.ToArray();
|
---|
| 100 | }
|
---|
| 101 | }
|
---|
| 102 | }
|
---|