1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2010 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
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 |
|
---|
22 | using HeuristicLab.Common;
|
---|
23 | using HeuristicLab.Core;
|
---|
24 | using HeuristicLab.Data;
|
---|
25 | using HeuristicLab.Encodings.PermutationEncoding;
|
---|
26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
27 | using System.Drawing;
|
---|
28 | using System.Collections.Generic;
|
---|
29 | using HeuristicLab.Problems.VehicleRouting.Interfaces;
|
---|
30 |
|
---|
31 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.General {
|
---|
32 | [Item("TourEncoding", "Represents a base class for tour encodings of VRP solutions.")]
|
---|
33 | [StorableClass]
|
---|
34 | public abstract class TourEncoding : Item, IVRPEncoding {
|
---|
35 | public override Image ItemImage {
|
---|
36 | get { return HeuristicLab.Common.Resources.VS2008ImageLibrary.Class; }
|
---|
37 | }
|
---|
38 |
|
---|
39 | #region IVRPEncoding Members
|
---|
40 | public virtual List<Tour> GetTours() {
|
---|
41 | List<Tour> result = new List<Tour>();
|
---|
42 |
|
---|
43 | foreach(Tour tour in Tours) {
|
---|
44 | if (tour.Stops.Count > 0)
|
---|
45 | result.Add(tour);
|
---|
46 | }
|
---|
47 |
|
---|
48 | while (result.Count > ProblemInstance.Vehicles.Value) {
|
---|
49 | Tour tour = result[result.Count - 1];
|
---|
50 | result[result.Count - 2].Stops.AddRange(tour.Stops);
|
---|
51 |
|
---|
52 | result.Remove(tour);
|
---|
53 | }
|
---|
54 |
|
---|
55 | return result;
|
---|
56 | }
|
---|
57 |
|
---|
58 | public int Cities {
|
---|
59 | get
|
---|
60 | {
|
---|
61 | int cities = 0;
|
---|
62 |
|
---|
63 | foreach (Tour tour in Tours) {
|
---|
64 | cities += tour.Stops.Count;
|
---|
65 | }
|
---|
66 |
|
---|
67 | return cities;
|
---|
68 | }
|
---|
69 | }
|
---|
70 | #endregion
|
---|
71 |
|
---|
72 | [Storable]
|
---|
73 | public ItemList<Tour> Tours { get; set; }
|
---|
74 |
|
---|
75 | [Storable]
|
---|
76 | protected IVRPProblemInstance ProblemInstance { get; set; }
|
---|
77 |
|
---|
78 | public TourEncoding(IVRPProblemInstance problemInstance) {
|
---|
79 | Tours = new ItemList<Tour>();
|
---|
80 |
|
---|
81 | ProblemInstance = problemInstance;
|
---|
82 | }
|
---|
83 |
|
---|
84 | [StorableConstructor]
|
---|
85 | protected TourEncoding(bool serializing)
|
---|
86 | : base(serializing) {
|
---|
87 | }
|
---|
88 |
|
---|
89 | protected TourEncoding(TourEncoding original, Cloner cloner)
|
---|
90 | : base(original, cloner) {
|
---|
91 | this.Tours = (ItemList<Tour>)cloner.Clone(original.Tours);
|
---|
92 | this.ProblemInstance = original.ProblemInstance;
|
---|
93 | }
|
---|
94 |
|
---|
95 | public static void ConvertFrom(IVRPEncoding encoding, TourEncoding solution, IVRPProblemInstance problemInstance) {
|
---|
96 | solution.Tours = new ItemList<Tour>(encoding.GetTours());
|
---|
97 | }
|
---|
98 |
|
---|
99 | public static void ConvertFrom(List<int> route, TourEncoding solution) {
|
---|
100 | solution.Tours = new ItemList<Tour>();
|
---|
101 |
|
---|
102 | Tour tour = new Tour();
|
---|
103 | for (int i = 0; i < route.Count; i++) {
|
---|
104 | if (route[i] == 0) {
|
---|
105 | if (tour.Stops.Count > 0) {
|
---|
106 | solution.Tours.Add(tour);
|
---|
107 | tour = new Tour();
|
---|
108 | }
|
---|
109 | } else {
|
---|
110 | tour.Stops.Add(route[i]);
|
---|
111 | }
|
---|
112 | }
|
---|
113 | }
|
---|
114 | }
|
---|
115 | }
|
---|