[4365] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[16453] | 3 | * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[4365] | 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 System.Drawing;
|
---|
[4365] | 24 | using HeuristicLab.Common;
|
---|
| 25 | using HeuristicLab.Core;
|
---|
[16462] | 26 | using HEAL.Fossil;
|
---|
[4365] | 27 | using HeuristicLab.Problems.VehicleRouting.Interfaces;
|
---|
| 28 |
|
---|
| 29 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.General {
|
---|
| 30 | [Item("TourEncoding", "Represents a base class for tour encodings of VRP solutions.")]
|
---|
[16462] | 31 | [StorableType("FC5DBAE6-05D9-4C55-AA85-6E3C2330700F")]
|
---|
[4365] | 32 | public abstract class TourEncoding : Item, IVRPEncoding {
|
---|
[7203] | 33 | public static new Image StaticItemImage {
|
---|
[5867] | 34 | get { return HeuristicLab.Common.Resources.VSImageLibrary.Class; }
|
---|
[4365] | 35 | }
|
---|
[8053] | 36 |
|
---|
[4365] | 37 | #region IVRPEncoding Members
|
---|
[6851] | 38 | public virtual void Repair() {
|
---|
[6752] | 39 | List<Tour> toBeRemoved = new List<Tour>();
|
---|
| 40 | foreach (Tour tour in Tours) {
|
---|
| 41 | if (tour.Stops.Count == 0)
|
---|
| 42 | toBeRemoved.Add(tour);
|
---|
[5127] | 43 | }
|
---|
| 44 |
|
---|
[6752] | 45 | foreach (Tour tour in toBeRemoved)
|
---|
| 46 | Tours.Remove(tour);
|
---|
[4365] | 47 |
|
---|
[6752] | 48 | while (Tours.Count > ProblemInstance.Vehicles.Value) {
|
---|
| 49 | Tour tour = Tours[Tours.Count - 1];
|
---|
| 50 | Tours[Tours.Count - 2].Stops.AddRange(tour.Stops);
|
---|
[4365] | 51 |
|
---|
[6752] | 52 | Tours.Remove(tour);
|
---|
[8053] | 53 | }
|
---|
[4365] | 54 | }
|
---|
| 55 |
|
---|
[8053] | 56 | public virtual List<Tour> GetTours() {
|
---|
| 57 | List<Tour> result = new List<Tour>();
|
---|
| 58 | foreach (Tour tour in Tours)
|
---|
| 59 | result.Add(tour.Clone() as Tour);
|
---|
[6752] | 60 |
|
---|
[8053] | 61 | return result;
|
---|
[6752] | 62 | }
|
---|
| 63 |
|
---|
[6851] | 64 | public int GetTourIndex(Tour tour) {
|
---|
| 65 | int index = -1;
|
---|
| 66 |
|
---|
| 67 | for (int i = 0; i < Tours.Count; i++) {
|
---|
| 68 | if (Tours[i].IsEqual(tour)) {
|
---|
| 69 | index = i;
|
---|
| 70 | break;
|
---|
| 71 | }
|
---|
| 72 | }
|
---|
| 73 |
|
---|
| 74 | return index;
|
---|
| 75 | }
|
---|
| 76 |
|
---|
| 77 | public virtual int GetVehicleAssignment(int tour) {
|
---|
| 78 | return tour;
|
---|
| 79 | }
|
---|
| 80 |
|
---|
[4365] | 81 | public int Cities {
|
---|
[8053] | 82 | get {
|
---|
[4365] | 83 | int cities = 0;
|
---|
| 84 |
|
---|
| 85 | foreach (Tour tour in Tours) {
|
---|
| 86 | cities += tour.Stops.Count;
|
---|
| 87 | }
|
---|
| 88 |
|
---|
| 89 | return cities;
|
---|
| 90 | }
|
---|
| 91 | }
|
---|
| 92 | #endregion
|
---|
| 93 |
|
---|
| 94 | [Storable]
|
---|
| 95 | public ItemList<Tour> Tours { get; set; }
|
---|
| 96 |
|
---|
| 97 | [Storable]
|
---|
| 98 | protected IVRPProblemInstance ProblemInstance { get; set; }
|
---|
| 99 |
|
---|
| 100 | public TourEncoding(IVRPProblemInstance problemInstance) {
|
---|
| 101 | Tours = new ItemList<Tour>();
|
---|
| 102 |
|
---|
| 103 | ProblemInstance = problemInstance;
|
---|
| 104 | }
|
---|
| 105 |
|
---|
| 106 | [StorableConstructor]
|
---|
[16462] | 107 | protected TourEncoding(StorableConstructorFlag _) : base(_) {
|
---|
[4365] | 108 | }
|
---|
[4376] | 109 |
|
---|
[4752] | 110 | protected TourEncoding(TourEncoding original, Cloner cloner)
|
---|
| 111 | : base(original, cloner) {
|
---|
[8053] | 112 | this.Tours = (ItemList<Tour>)cloner.Clone(original.Tours);
|
---|
| 113 | if (original.ProblemInstance != null && cloner.ClonedObjectRegistered(original.ProblemInstance))
|
---|
| 114 | this.ProblemInstance = (IVRPProblemInstance)cloner.Clone(original.ProblemInstance);
|
---|
| 115 | else
|
---|
| 116 | this.ProblemInstance = original.ProblemInstance;
|
---|
[4752] | 117 | }
|
---|
| 118 |
|
---|
[4376] | 119 | public static void ConvertFrom(IVRPEncoding encoding, TourEncoding solution, IVRPProblemInstance problemInstance) {
|
---|
| 120 | solution.Tours = new ItemList<Tour>(encoding.GetTours());
|
---|
[6837] | 121 | solution.Repair();
|
---|
[4376] | 122 | }
|
---|
| 123 |
|
---|
| 124 | public static void ConvertFrom(List<int> route, TourEncoding solution) {
|
---|
| 125 | solution.Tours = new ItemList<Tour>();
|
---|
| 126 |
|
---|
| 127 | Tour tour = new Tour();
|
---|
| 128 | for (int i = 0; i < route.Count; i++) {
|
---|
[7543] | 129 | if (route[i] <= 0) {
|
---|
[4376] | 130 | if (tour.Stops.Count > 0) {
|
---|
| 131 | solution.Tours.Add(tour);
|
---|
| 132 | tour = new Tour();
|
---|
| 133 | }
|
---|
| 134 | } else {
|
---|
| 135 | tour.Stops.Add(route[i]);
|
---|
| 136 | }
|
---|
| 137 | }
|
---|
[6837] | 138 |
|
---|
| 139 | solution.Repair();
|
---|
[4376] | 140 | }
|
---|
[4365] | 141 | }
|
---|
| 142 | }
|
---|