Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Problems.VehicleRouting/3.4/Encodings/Alba/Moves/LambdaInterchange/AlbaExhaustiveLambdaInterchangeMoveGenerator.cs @ 11171

Last change on this file since 11171 was 11171, checked in by ascheibe, 10 years ago

#2115 merged r11170 (copyright update) into trunk

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