[4376] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[9456] | 3 | * Copyright (C) 2002-2013 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[4376] | 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 HeuristicLab.Common;
|
---|
[4376] | 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 25 |
|
---|
| 26 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Potvin {
|
---|
| 27 | [Item("PotvinOneLevelExchangeMainpulator", "The 1M operator which manipulates a VRP representation. It is implemented as described in Potvin, J.-Y. and Bengio, S. (1996). The Vehicle Routing Problem with Time Windows - Part II: Genetic Search. INFORMS Journal of Computing, 8:165–172.")]
|
---|
| 28 | [StorableClass]
|
---|
| 29 | public sealed class PotvinOneLevelExchangeMainpulator : PotvinManipulator {
|
---|
| 30 | [StorableConstructor]
|
---|
| 31 | private PotvinOneLevelExchangeMainpulator(bool deserializing) : base(deserializing) { }
|
---|
| 32 |
|
---|
| 33 | public PotvinOneLevelExchangeMainpulator() : base() { }
|
---|
[4752] | 34 |
|
---|
| 35 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 36 | return new PotvinOneLevelExchangeMainpulator(this, cloner);
|
---|
| 37 | }
|
---|
| 38 |
|
---|
| 39 | private PotvinOneLevelExchangeMainpulator(PotvinOneLevelExchangeMainpulator original, Cloner cloner)
|
---|
| 40 | : base(original, cloner) {
|
---|
| 41 | }
|
---|
[8053] | 42 |
|
---|
[4376] | 43 | protected override void Manipulate(IRandom random, PotvinEncoding individual) {
|
---|
[6607] | 44 | bool allowInfeasible = AllowInfeasibleSolutions.Value.Value;
|
---|
[8053] | 45 |
|
---|
[4376] | 46 | int selectedIndex = SelectRandomTourBiasedByLength(random, individual);
|
---|
[6907] | 47 | if (selectedIndex >= 0) {
|
---|
| 48 | Tour route1 =
|
---|
| 49 | individual.Tours[selectedIndex];
|
---|
[4376] | 50 |
|
---|
[6907] | 51 | int count = route1.Stops.Count;
|
---|
| 52 | int i = 0;
|
---|
| 53 | while (i < count) {
|
---|
| 54 | int insertedRoute, insertedPlace;
|
---|
[4376] | 55 |
|
---|
[6907] | 56 | int city = route1.Stops[i];
|
---|
| 57 | route1.Stops.Remove(city);
|
---|
[6796] | 58 |
|
---|
[6907] | 59 | if (FindInsertionPlace(individual, city, selectedIndex, allowInfeasible, out insertedRoute, out insertedPlace)) {
|
---|
| 60 | individual.Tours[insertedRoute].Stops.Insert(insertedPlace, city);
|
---|
| 61 | } else {
|
---|
| 62 | route1.Stops.Insert(i, city);
|
---|
| 63 | i++;
|
---|
| 64 | }
|
---|
| 65 |
|
---|
| 66 | count = route1.Stops.Count;
|
---|
[4376] | 67 | }
|
---|
| 68 | }
|
---|
| 69 | }
|
---|
| 70 | }
|
---|
| 71 | }
|
---|