[4379] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[11594] | 3 | * Copyright (C) 2002-2014 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 HeuristicLab.Common;
|
---|
[4379] | 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 25 |
|
---|
| 26 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.GVR {
|
---|
| 27 | [Item("GVRInsertionManipulator", "An operator which manipulates a GVR representation by inserting a customer at another location. It is implemented as described in Pereira, F.B. et al (2002). GVR: a New Genetic Representation for the Vehicle Routing Problem. AICS 2002, LNAI 2464, pp. 95-102.")]
|
---|
| 28 | [StorableClass]
|
---|
| 29 | public sealed class GVRInsertionManipulator : GVRManipulator {
|
---|
| 30 | [StorableConstructor]
|
---|
| 31 | private GVRInsertionManipulator(bool deserializing) : base(deserializing) { }
|
---|
| 32 |
|
---|
| 33 | public GVRInsertionManipulator()
|
---|
| 34 | : base() {
|
---|
| 35 | }
|
---|
| 36 |
|
---|
[4752] | 37 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 38 | return new GVRInsertionManipulator(this, cloner);
|
---|
| 39 | }
|
---|
| 40 |
|
---|
| 41 | private GVRInsertionManipulator(GVRInsertionManipulator original, Cloner cloner)
|
---|
| 42 | : base(original, cloner) {
|
---|
| 43 | }
|
---|
| 44 |
|
---|
[4379] | 45 | protected override void Manipulate(IRandom random, GVREncoding individual) {
|
---|
| 46 | int customer = random.Next(1, individual.Cities + 1);
|
---|
| 47 | Tour tour;
|
---|
| 48 | int position;
|
---|
| 49 | individual.FindCustomer(customer, out tour, out position);
|
---|
| 50 |
|
---|
| 51 | tour.Stops.RemoveAt(position);
|
---|
| 52 |
|
---|
| 53 | //with a probability of 1/(2*V) create a new tour, else insert at another position
|
---|
[8053] | 54 | if (individual.GetTours().Count > 0 &&
|
---|
| 55 | individual.GetTours().Count < ProblemInstance.Vehicles.Value &&
|
---|
[4379] | 56 | random.Next(individual.GetTours().Count * 2) == 0) {
|
---|
| 57 | Tour newTour = new Tour();
|
---|
| 58 | newTour.Stops.Add(customer);
|
---|
[8053] | 59 |
|
---|
[4379] | 60 | individual.Tours.Add(newTour);
|
---|
| 61 | } else {
|
---|
| 62 | Tour newTour = individual.Tours[random.Next(individual.Tours.Count)];
|
---|
| 63 | int newPosition = random.Next(newTour.Stops.Count + 1);
|
---|
| 64 |
|
---|
| 65 | newTour.Stops.Insert(newPosition, customer);
|
---|
| 66 | }
|
---|
| 67 |
|
---|
| 68 | if (tour.Stops.Count == 0)
|
---|
| 69 | individual.Tours.Remove(tour);
|
---|
| 70 | }
|
---|
| 71 | }
|
---|
| 72 | }
|
---|