[4370] | 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.Interfaces;
|
---|
[4752] | 30 | using HeuristicLab.Common;
|
---|
[4370] | 31 |
|
---|
| 32 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Alba {
|
---|
| 33 | [Item("AlbaExhaustiveIntraRouteInversionGenerator", "Generates all possible intra route inversion 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.")]
|
---|
| 34 | [StorableClass]
|
---|
| 35 | public sealed class AlbaExhaustiveIntraRouteInversionGenerator : AlbaIntraRouteInversionMoveGenerator, IExhaustiveMoveGenerator, IAlbaIntraRouteInversionMoveOperator {
|
---|
| 36 | [StorableConstructor]
|
---|
| 37 | private AlbaExhaustiveIntraRouteInversionGenerator(bool deserializing) : base(deserializing) { }
|
---|
| 38 |
|
---|
| 39 | public AlbaExhaustiveIntraRouteInversionGenerator()
|
---|
| 40 | : base() {
|
---|
| 41 | }
|
---|
| 42 |
|
---|
[4752] | 43 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 44 | return new AlbaExhaustiveIntraRouteInversionGenerator(this, cloner);
|
---|
| 45 | }
|
---|
| 46 |
|
---|
| 47 | private AlbaExhaustiveIntraRouteInversionGenerator(AlbaExhaustiveIntraRouteInversionGenerator original, Cloner cloner)
|
---|
| 48 | : base(original, cloner) {
|
---|
| 49 | }
|
---|
| 50 |
|
---|
[4370] | 51 | protected override AlbaIntraRouteInversionMove[] GenerateMoves(AlbaEncoding individual, IVRPProblemInstance problemInstance) {
|
---|
| 52 | List<AlbaIntraRouteInversionMove> moves = new List<AlbaIntraRouteInversionMove>();
|
---|
| 53 |
|
---|
| 54 | int currentTourStart = 0;
|
---|
| 55 | int currentTourEnd = 0;
|
---|
| 56 | while(currentTourEnd != individual.Length) {
|
---|
| 57 | currentTourEnd = currentTourStart;
|
---|
| 58 | while (individual[currentTourEnd] < problemInstance.Cities.Value &&
|
---|
| 59 | currentTourEnd < individual.Length) {
|
---|
| 60 | currentTourEnd++;
|
---|
| 61 | }
|
---|
| 62 |
|
---|
| 63 | int tourLength = currentTourEnd - currentTourStart;
|
---|
| 64 | if (tourLength >= 4) {
|
---|
| 65 | for (int i = 0; i <= tourLength - 4; i++ ) {
|
---|
| 66 | for (int j = i + 2; j <= tourLength - 2; j++) {
|
---|
| 67 | AlbaIntraRouteInversionMove move = new AlbaIntraRouteInversionMove(
|
---|
| 68 | currentTourStart + i,
|
---|
| 69 | currentTourStart + j,
|
---|
| 70 | individual);
|
---|
| 71 |
|
---|
| 72 | moves.Add(move);
|
---|
| 73 | }
|
---|
| 74 | }
|
---|
| 75 | }
|
---|
| 76 |
|
---|
| 77 | currentTourStart = currentTourEnd;
|
---|
| 78 | }
|
---|
| 79 |
|
---|
| 80 | return moves.ToArray();
|
---|
| 81 | }
|
---|
| 82 | }
|
---|
| 83 | }
|
---|