[4379] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[16453] | 3 | * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[4379] | 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;
|
---|
[4379] | 24 | using HeuristicLab.Core;
|
---|
[8053] | 25 | using HeuristicLab.Data;
|
---|
[4379] | 26 | using HeuristicLab.Parameters;
|
---|
[16462] | 27 | using HEAL.Fossil;
|
---|
[4379] | 28 |
|
---|
| 29 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.Prins {
|
---|
| 30 | [Item("PrinsStochasticLSManipulator", "An operator which manipulates a VRP representation by using the stochastic version of the Prins local search. It is implemented as described in Prins, C. (2004). A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research, 12:1985-2002.")]
|
---|
[16462] | 31 | [StorableType("0EA1C024-7FDA-4E52-8186-D2BAF9D5AB24")]
|
---|
[4379] | 32 | public sealed class PrinsStochasticLSManipulator : PrinsLSManipulator {
|
---|
| 33 | public IValueParameter<IntValue> SampleSize {
|
---|
| 34 | get { return (IValueParameter<IntValue>)Parameters["SampleSize"]; }
|
---|
| 35 | }
|
---|
[8053] | 36 |
|
---|
[4379] | 37 | [StorableConstructor]
|
---|
[16462] | 38 | private PrinsStochasticLSManipulator(StorableConstructorFlag _) : base(_) { }
|
---|
[4379] | 39 |
|
---|
| 40 | public PrinsStochasticLSManipulator()
|
---|
| 41 | : base() {
|
---|
[8053] | 42 | Parameters.Add(new ValueParameter<IntValue>("SampleSize", "The sample size.", new IntValue(200)));
|
---|
[4379] | 43 | }
|
---|
| 44 |
|
---|
[4752] | 45 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 46 | return new PrinsStochasticLSManipulator(this, cloner);
|
---|
| 47 | }
|
---|
| 48 |
|
---|
| 49 | private PrinsStochasticLSManipulator(PrinsStochasticLSManipulator original, Cloner cloner)
|
---|
| 50 | : base(original, cloner) {
|
---|
| 51 | }
|
---|
| 52 |
|
---|
[4379] | 53 | protected override void Manipulate(IRandom random, PrinsEncoding individual) {
|
---|
| 54 | List<Tour> tours = individual.GetTours();
|
---|
| 55 | bool improvement = false;
|
---|
| 56 | int iterations = 0;
|
---|
| 57 |
|
---|
| 58 | do {
|
---|
| 59 | improvement = false;
|
---|
| 60 | double originalQuality = GetQuality(individual);
|
---|
| 61 | PrinsEncoding child = null;
|
---|
| 62 |
|
---|
| 63 | int samples = 0;
|
---|
| 64 | while (!improvement &&
|
---|
| 65 | samples < SampleSize.Value.Value) {
|
---|
[8053] | 66 | int u = random.Next(ProblemInstance.Cities.Value);
|
---|
| 67 | int v = random.Next(ProblemInstance.Cities.Value);
|
---|
[4379] | 68 |
|
---|
[8053] | 69 | child = Manipulate(individual,
|
---|
| 70 | originalQuality, u, v);
|
---|
[4379] | 71 |
|
---|
[8053] | 72 | improvement = child != null;
|
---|
[4379] | 73 |
|
---|
[8053] | 74 | samples++;
|
---|
[4379] | 75 | }
|
---|
| 76 |
|
---|
| 77 | if (improvement) {
|
---|
| 78 | for (int i = 0; i < child.Length; i++) {
|
---|
| 79 | individual[i] = child[i];
|
---|
| 80 | }
|
---|
| 81 | }
|
---|
| 82 |
|
---|
| 83 | iterations++;
|
---|
[8053] | 84 | } while (improvement &&
|
---|
[4379] | 85 | iterations < Iterations.Value.Value);
|
---|
| 86 | }
|
---|
| 87 | }
|
---|
| 88 | }
|
---|