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.Parameters;
|
---|
27 | using System.Collections.Generic;
|
---|
28 | using HeuristicLab.Problems.VehicleRouting.Interfaces;
|
---|
29 | using HeuristicLab.Common;
|
---|
30 |
|
---|
31 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Potvin {
|
---|
32 | [Item("PotvinOnePointCrossoverExhaustiveMoveGenerator", "Generates customer relocation moves from a given VRP encoding.")]
|
---|
33 | [StorableClass]
|
---|
34 | public sealed class PotvinOnePointCrossoverExhaustiveMoveGenerator : PotvinOnePointCrossoverMoveGenerator, IExhaustiveMoveGenerator {
|
---|
35 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
36 | return new PotvinOnePointCrossoverExhaustiveMoveGenerator(this, cloner);
|
---|
37 | }
|
---|
38 |
|
---|
39 | [StorableConstructor]
|
---|
40 | private PotvinOnePointCrossoverExhaustiveMoveGenerator(bool deserializing) : base(deserializing) { }
|
---|
41 |
|
---|
42 | public PotvinOnePointCrossoverExhaustiveMoveGenerator()
|
---|
43 | : base() {
|
---|
44 | }
|
---|
45 |
|
---|
46 | private PotvinOnePointCrossoverExhaustiveMoveGenerator(PotvinOnePointCrossoverMoveGenerator original, Cloner cloner)
|
---|
47 | : base(original, cloner) {
|
---|
48 | }
|
---|
49 |
|
---|
50 | protected override PotvinOnePointCrossoverMove[] GenerateMoves(PotvinEncoding individual, IVRPProblemInstance problemInstance) {
|
---|
51 | List<PotvinOnePointCrossoverMove> result = new List<PotvinOnePointCrossoverMove>();
|
---|
52 |
|
---|
53 | for (int tour1 = 0; tour1 < individual.Tours.Count; tour1++) {
|
---|
54 | for (int tour2 = tour1 + 1; tour2 < individual.Tours.Count; tour2++) {
|
---|
55 | for (int index1 = 0; index1 <= individual.Tours[tour1].Stops.Count; index1++) {
|
---|
56 | for (int index2 = 0; index2 <= individual.Tours[tour2].Stops.Count; index2++) {
|
---|
57 | if ((index1 != individual.Tours[tour1].Stops.Count || index2 != individual.Tours[tour2].Stops.Count) &&
|
---|
58 | (index1 != 0 || index2 != 0))
|
---|
59 | result.Add(new PotvinOnePointCrossoverMove(tour1, index1, tour2, index2, individual));
|
---|
60 | }
|
---|
61 | }
|
---|
62 | }
|
---|
63 | }
|
---|
64 |
|
---|
65 | return result.ToArray();
|
---|
66 | }
|
---|
67 | }
|
---|
68 | }
|
---|