[4379] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[12009] | 3 | * Copyright (C) 2002-2015 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;
|
---|
[4379] | 23 | using HeuristicLab.Common;
|
---|
| 24 | using HeuristicLab.Core;
|
---|
| 25 | using HeuristicLab.Data;
|
---|
| 26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 27 | using HeuristicLab.Problems.VehicleRouting.Encodings.General;
|
---|
| 28 | using HeuristicLab.Problems.VehicleRouting.Interfaces;
|
---|
| 29 | using HeuristicLab.Problems.VehicleRouting.Variants;
|
---|
| 30 |
|
---|
| 31 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.GVR {
|
---|
| 32 | [Item("GVREncoding", "Represents a potvin encoding of VRP solutions. 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.")]
|
---|
| 33 | [StorableClass]
|
---|
| 34 | public class GVREncoding : TourEncoding {
|
---|
| 35 | public override List<Tour> GetTours() {
|
---|
[8053] | 36 | List<Tour> tours = new List<Tour>();
|
---|
[4379] | 37 |
|
---|
| 38 | foreach (Tour tour in base.Tours) {
|
---|
| 39 | Tour newTour = new Tour();
|
---|
| 40 | double currentDemand = 0;
|
---|
| 41 |
|
---|
| 42 | DoubleValue capacity = new DoubleValue(double.MaxValue);
|
---|
| 43 | if (ProblemInstance is IHomogenousCapacitatedProblemInstance) {
|
---|
| 44 | capacity.Value = (ProblemInstance as IHomogenousCapacitatedProblemInstance).Capacity.Value;
|
---|
| 45 | }
|
---|
| 46 |
|
---|
| 47 |
|
---|
| 48 | foreach (int city in tour.Stops) {
|
---|
[6851] | 49 | currentDemand += ProblemInstance.GetDemand(city);
|
---|
[4379] | 50 |
|
---|
| 51 | if (currentDemand > capacity.Value) {
|
---|
| 52 | if (newTour.Stops.Count > 0)
|
---|
| 53 | tours.Add(newTour);
|
---|
| 54 |
|
---|
| 55 | newTour = new Tour();
|
---|
| 56 | newTour.Stops.Add(city);
|
---|
[6851] | 57 | currentDemand = ProblemInstance.GetDemand(city);
|
---|
[4379] | 58 | } else {
|
---|
| 59 | newTour.Stops.Add(city);
|
---|
| 60 | }
|
---|
| 61 | }
|
---|
| 62 |
|
---|
| 63 | if (newTour.Stops.Count > 0)
|
---|
| 64 | tours.Add(newTour);
|
---|
| 65 | }
|
---|
| 66 |
|
---|
| 67 | //repair if there are too many vehicles used
|
---|
| 68 | while (tours.Count > ProblemInstance.Vehicles.Value) {
|
---|
| 69 | Tour tour = tours[tours.Count - 1];
|
---|
| 70 | tours[tours.Count - 2].Stops.AddRange(tour.Stops);
|
---|
| 71 |
|
---|
| 72 | tours.Remove(tour);
|
---|
[8053] | 73 | }
|
---|
[4379] | 74 |
|
---|
| 75 | return tours;
|
---|
| 76 | }
|
---|
[8053] | 77 |
|
---|
[4379] | 78 | public GVREncoding(IVRPProblemInstance problemInstance)
|
---|
| 79 | : base(problemInstance) {
|
---|
| 80 | }
|
---|
| 81 |
|
---|
| 82 | [StorableConstructor]
|
---|
[7906] | 83 | protected GVREncoding(bool serializing)
|
---|
[4379] | 84 | : base(serializing) {
|
---|
| 85 | }
|
---|
| 86 |
|
---|
[4752] | 87 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 88 | return new GVREncoding(this, cloner);
|
---|
| 89 | }
|
---|
| 90 |
|
---|
| 91 | protected GVREncoding(GVREncoding original, Cloner cloner)
|
---|
| 92 | : base(original, cloner) {
|
---|
| 93 | }
|
---|
| 94 |
|
---|
[4379] | 95 | public static GVREncoding ConvertFrom(IVRPEncoding encoding, IVRPProblemInstance problemInstance) {
|
---|
| 96 | GVREncoding solution = new GVREncoding(problemInstance);
|
---|
| 97 |
|
---|
| 98 | TourEncoding.ConvertFrom(encoding, solution, problemInstance);
|
---|
| 99 |
|
---|
| 100 | return solution;
|
---|
| 101 | }
|
---|
| 102 |
|
---|
| 103 | public static GVREncoding ConvertFrom(List<int> route, IVRPProblemInstance problemInstance) {
|
---|
| 104 | GVREncoding solution = new GVREncoding(problemInstance);
|
---|
| 105 |
|
---|
| 106 | TourEncoding.ConvertFrom(route, solution);
|
---|
| 107 |
|
---|
| 108 | return solution;
|
---|
| 109 | }
|
---|
| 110 |
|
---|
| 111 | internal void FindCustomer(int customer, out Tour tour, out int index) {
|
---|
| 112 | tour = null;
|
---|
| 113 | index = -1;
|
---|
| 114 |
|
---|
| 115 | int currentTour = 0;
|
---|
| 116 | while (tour == null && currentTour < Tours.Count) {
|
---|
| 117 | int currentCity = 0;
|
---|
| 118 | while (tour == null && currentCity < Tours[currentTour].Stops.Count) {
|
---|
| 119 | if (Tours[currentTour].Stops[currentCity] == customer) {
|
---|
| 120 | tour = Tours[currentTour];
|
---|
| 121 | index = currentCity;
|
---|
| 122 | }
|
---|
| 123 |
|
---|
| 124 | currentCity++;
|
---|
| 125 | }
|
---|
| 126 |
|
---|
| 127 | currentTour++;
|
---|
| 128 | }
|
---|
| 129 | }
|
---|
| 130 | }
|
---|
| 131 | }
|
---|