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.Problems.VehicleRouting.Encodings.Alba;
|
---|
27 | using HeuristicLab.Parameters;
|
---|
28 | using System.Collections.Generic;
|
---|
29 | using HeuristicLab.Problems.VehicleRouting.Encodings.General;
|
---|
30 | using HeuristicLab.Problems.VehicleRouting.Interfaces;
|
---|
31 | using HeuristicLab.Common;
|
---|
32 |
|
---|
33 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Alba {
|
---|
34 | [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.")]
|
---|
35 | [StorableClass]
|
---|
36 | public sealed class AlbaStochasticIntraRouteInversionSingleMoveGenerator : AlbaIntraRouteInversionMoveGenerator,
|
---|
37 | IStochasticOperator, ISingleMoveGenerator, IAlbaIntraRouteInversionMoveOperator {
|
---|
38 | #region IMultiVRPMoveOperator Members
|
---|
39 |
|
---|
40 | public override ILookupParameter VRPMoveParameter {
|
---|
41 | get { return (ILookupParameter)Parameters["AlbaIntraRouteInversionMove"]; }
|
---|
42 | }
|
---|
43 |
|
---|
44 | #endregion
|
---|
45 |
|
---|
46 | public ILookupParameter<IRandom> RandomParameter {
|
---|
47 | get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
|
---|
48 | }
|
---|
49 |
|
---|
50 | [StorableConstructor]
|
---|
51 | private AlbaStochasticIntraRouteInversionSingleMoveGenerator(bool deserializing) : base(deserializing) { }
|
---|
52 |
|
---|
53 | public AlbaStochasticIntraRouteInversionSingleMoveGenerator()
|
---|
54 | : base() {
|
---|
55 | Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator."));
|
---|
56 | }
|
---|
57 |
|
---|
58 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
59 | return new AlbaStochasticIntraRouteInversionSingleMoveGenerator(this, cloner);
|
---|
60 | }
|
---|
61 |
|
---|
62 | private AlbaStochasticIntraRouteInversionSingleMoveGenerator(AlbaStochasticIntraRouteInversionSingleMoveGenerator original, Cloner cloner)
|
---|
63 | : base(original, cloner) {
|
---|
64 | }
|
---|
65 |
|
---|
66 | public static AlbaIntraRouteInversionMove Apply(AlbaEncoding individual, int cities, IRandom rand) {
|
---|
67 | int index1 = -1;
|
---|
68 | int index2 = -1;
|
---|
69 |
|
---|
70 | List<Tour> validTours = new List<Tour>();
|
---|
71 | foreach (Tour tour in individual.GetTours()) {
|
---|
72 | if (tour.Stops.Count >= 4)
|
---|
73 | validTours.Add(tour);
|
---|
74 | }
|
---|
75 |
|
---|
76 | if (validTours.Count > 0) {
|
---|
77 | Tour chosenTour = validTours[rand.Next(validTours.Count)];
|
---|
78 | int currentTourStart = -1;
|
---|
79 | for (int i = 0; i < individual.Length; i++) {
|
---|
80 | if (individual[i] + 1 == chosenTour.Stops[0]) {
|
---|
81 | currentTourStart = i;
|
---|
82 | break;
|
---|
83 | }
|
---|
84 | }
|
---|
85 |
|
---|
86 | int currentTourEnd = currentTourStart;
|
---|
87 | while (currentTourEnd < individual.Length &&
|
---|
88 | individual[currentTourEnd] < cities) {
|
---|
89 | currentTourEnd++;
|
---|
90 | }
|
---|
91 |
|
---|
92 | int tourLength = currentTourEnd - currentTourStart;
|
---|
93 | int a = rand.Next(tourLength - 3);
|
---|
94 | index1 = currentTourStart + a;
|
---|
95 | index2 = currentTourStart + rand.Next(a + 2, tourLength - 1);
|
---|
96 | }
|
---|
97 |
|
---|
98 | return new AlbaIntraRouteInversionMove(index1, index2, individual);
|
---|
99 | }
|
---|
100 |
|
---|
101 | protected override AlbaIntraRouteInversionMove[] GenerateMoves(AlbaEncoding individual, IVRPProblemInstance problemInstance) {
|
---|
102 | List<AlbaIntraRouteInversionMove> moves = new List<AlbaIntraRouteInversionMove>();
|
---|
103 |
|
---|
104 | AlbaIntraRouteInversionMove move = Apply(individual, problemInstance.Cities.Value, RandomParameter.ActualValue);
|
---|
105 | if(move != null)
|
---|
106 | moves.Add(move);
|
---|
107 |
|
---|
108 | return moves.ToArray();
|
---|
109 | }
|
---|
110 | }
|
---|
111 | }
|
---|