1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2012 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 System.Collections.Generic;
|
---|
24 | using HeuristicLab.Common;
|
---|
25 | using HeuristicLab.Core;
|
---|
26 | using HeuristicLab.Optimization;
|
---|
27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
28 |
|
---|
29 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Alba {
|
---|
30 | [Item("AlbaExhaustiveLambdaInterchangeMoveGenerator", "Generates all possible lambda interchange moves 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.")]
|
---|
31 | [StorableClass]
|
---|
32 | public sealed class AlbaExhaustiveLambdaInterchangeMoveGenerator : AlbaLambdaInterchangeMoveGenerator, IExhaustiveMoveGenerator, IAlbaLambdaInterchangeMoveOperator {
|
---|
33 | [StorableConstructor]
|
---|
34 | private AlbaExhaustiveLambdaInterchangeMoveGenerator(bool deserializing) : base(deserializing) { }
|
---|
35 | private AlbaExhaustiveLambdaInterchangeMoveGenerator(AlbaExhaustiveLambdaInterchangeMoveGenerator original, Cloner cloner) : base(original, cloner) { }
|
---|
36 | public AlbaExhaustiveLambdaInterchangeMoveGenerator() : base() { }
|
---|
37 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
38 | return new AlbaExhaustiveLambdaInterchangeMoveGenerator(this, cloner);
|
---|
39 | }
|
---|
40 |
|
---|
41 | public static AlbaLambdaInterchangeMove[] GenerateAllMoves(AlbaEncoding individual, int lambda) {
|
---|
42 | List<AlbaLambdaInterchangeMove> moves = new List<AlbaLambdaInterchangeMove>();
|
---|
43 |
|
---|
44 | List<Tour> tours = individual.GetTours();
|
---|
45 |
|
---|
46 | for (int tour1Index = 0; tour1Index < tours.Count; tour1Index++) {
|
---|
47 | Tour tour1 = tours[tour1Index];
|
---|
48 | for (int tour2Index = tour1Index + 1; tour2Index < tours.Count; tour2Index++) {
|
---|
49 | Tour tour2 = tours[tour2Index];
|
---|
50 |
|
---|
51 | for (int length1 = 0; length1 <= Math.Min(lambda, tour1.Cities.Count); length1++) {
|
---|
52 | for (int length2 = 0; length2 <= Math.Min(lambda, tour2.Cities.Count); length2++) {
|
---|
53 | if (length1 != 0 || length2 != 0) {
|
---|
54 | for (int index1 = 0; index1 < tour1.Cities.Count - length1 + 1; index1++) {
|
---|
55 | for (int index2 = 0; index2 < tour2.Cities.Count - length2 + 1; index2++) {
|
---|
56 | moves.Add(new AlbaLambdaInterchangeMove(tour1Index, index1, length1,
|
---|
57 | tour2Index, index2, length2, individual));
|
---|
58 | }
|
---|
59 | }
|
---|
60 | }
|
---|
61 | }
|
---|
62 | }
|
---|
63 | }
|
---|
64 | }
|
---|
65 |
|
---|
66 | return moves.ToArray();
|
---|
67 | }
|
---|
68 |
|
---|
69 | protected override AlbaLambdaInterchangeMove[] GenerateMoves(AlbaEncoding individual, int lambda) {
|
---|
70 | return GenerateAllMoves(individual, lambda);
|
---|
71 | }
|
---|
72 | }
|
---|
73 | }
|
---|