[6773] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17180] | 3 | * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[6773] | 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 |
|
---|
[8053] | 22 | using System.Collections.Generic;
|
---|
| 23 | using HeuristicLab.Common;
|
---|
[6773] | 24 | using HeuristicLab.Core;
|
---|
| 25 | using HeuristicLab.Optimization;
|
---|
[16565] | 26 | using HEAL.Attic;
|
---|
[6773] | 27 | using HeuristicLab.Problems.VehicleRouting.Interfaces;
|
---|
| 28 | using HeuristicLab.Problems.VehicleRouting.Variants;
|
---|
| 29 |
|
---|
| 30 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Potvin {
|
---|
| 31 | [Item("PotvinPDShiftExhaustiveMoveGenerator", "Generates shift moves from a given PDP encoding.")]
|
---|
[16565] | 32 | [StorableType("CD03F921-FC4D-49AD-BEA3-156C60AAD5BD")]
|
---|
[6773] | 33 | public sealed class PotvinPDShiftExhaustiveMoveGenerator : PotvinPDShiftMoveGenerator, IExhaustiveMoveGenerator {
|
---|
| 34 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 35 | return new PotvinPDShiftExhaustiveMoveGenerator(this, cloner);
|
---|
| 36 | }
|
---|
| 37 |
|
---|
| 38 | [StorableConstructor]
|
---|
[16565] | 39 | private PotvinPDShiftExhaustiveMoveGenerator(StorableConstructorFlag _) : base(_) { }
|
---|
[6773] | 40 |
|
---|
| 41 | public PotvinPDShiftExhaustiveMoveGenerator()
|
---|
| 42 | : base() {
|
---|
| 43 | }
|
---|
| 44 |
|
---|
| 45 | private PotvinPDShiftExhaustiveMoveGenerator(PotvinPDShiftExhaustiveMoveGenerator original, Cloner cloner)
|
---|
| 46 | : base(original, cloner) {
|
---|
| 47 | }
|
---|
| 48 |
|
---|
| 49 | protected override PotvinPDShiftMove[] GenerateMoves(PotvinEncoding individual, IVRPProblemInstance problemInstance) {
|
---|
| 50 | List<PotvinPDShiftMove> result = new List<PotvinPDShiftMove>();
|
---|
| 51 | IPickupAndDeliveryProblemInstance pdp = problemInstance as IPickupAndDeliveryProblemInstance;
|
---|
| 52 |
|
---|
| 53 | int max = individual.Tours.Count;
|
---|
[7791] | 54 | if (individual.Tours.Count >= problemInstance.Vehicles.Value)
|
---|
[6773] | 55 | max = max - 1;
|
---|
| 56 |
|
---|
| 57 | for (int i = 0; i < individual.Tours.Count; i++) {
|
---|
| 58 | for (int j = 0; j < individual.Tours[i].Stops.Count; j++) {
|
---|
| 59 | for (int k = 0; k <= max; k++) {
|
---|
| 60 | if (k != i) {
|
---|
| 61 | int city = individual.Tours[i].Stops[j];
|
---|
[6851] | 62 | if (pdp == null || pdp.GetDemand(city) >= 0) {
|
---|
[6773] | 63 | PotvinPDShiftMove move = new PotvinPDShiftMove(
|
---|
| 64 | city, i, k, individual);
|
---|
| 65 |
|
---|
| 66 | result.Add(move);
|
---|
| 67 | }
|
---|
| 68 | }
|
---|
| 69 | }
|
---|
| 70 | }
|
---|
| 71 | }
|
---|
| 72 |
|
---|
| 73 | return result.ToArray();
|
---|
| 74 | }
|
---|
| 75 | }
|
---|
| 76 | }
|
---|