source: branches/PersistenceOverhaul/HeuristicLab.Problems.VehicleRouting/3.4/Encodings/Tour.cs @ 13368

Last change on this file since 13368 was 13368, checked in by ascheibe, 4 years ago

#2520 added guids to storable classes

File size: 2.4 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2015 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
22using System.Collections.Generic;
23using HeuristicLab.Common;
24using HeuristicLab.Core;
25using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
26using HeuristicLab.Problems.VehicleRouting.Interfaces;
27
28namespace HeuristicLab.Problems.VehicleRouting {
29  [StorableClass("3DC499CA-F9A8-4652-A5F0-976234070D95")]
30  public class Tour : Item {
31    [Storable]
32    public List<int> Stops { get; private set; }
33
34    public Tour() {
35      Stops = new List<int>();
36    }
37
38    public override IDeepCloneable Clone(Cloner cloner) {
39      return new Tour(this, cloner);
40    }
41
42    protected Tour(Tour original, Cloner cloner)
43      : base(original, cloner) {
44      this.Stops = new List<int>(original.Stops);
45    }
46
47    [StorableConstructor]
48    protected Tour(bool deserializing) : base(deserializing) { }
49
50    public double GetTourLength(IVRPProblemInstance instance, IVRPEncoding solution) {
51      double length = 0;
52
53      if (Stops.Count > 0) {
54        List<int> cities = new List<int>();
55        cities.Add(0);
56        foreach (int city in Stops) {
57          cities.Add(city);
58        }
59        cities.Add(0);
60
61        for (int i = 1; i < cities.Count; i++) {
62          length += instance.GetDistance(cities[i - 1], cities[i], solution);
63        }
64      }
65
66      return length;
67    }
68
69    public bool IsEqual(Tour tour) {
70      bool equal = (tour != null) && (tour.Stops.Count == Stops.Count);
71      int index = 0;
72
73      while (equal && index < Stops.Count) {
74        equal = equal && tour.Stops[index] == Stops[index];
75        index++;
76      }
77
78      return equal;
79    }
80  }
81}
Note: See TracBrowser for help on using the repository browser.