[4362] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[12009] | 3 | * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[4362] | 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 System.Collections.Generic;
|
---|
| 23 | using HeuristicLab.Common;
|
---|
| 24 | using HeuristicLab.Core;
|
---|
[8053] | 25 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
[6607] | 26 | using HeuristicLab.Problems.VehicleRouting.Interfaces;
|
---|
[4362] | 27 |
|
---|
[4363] | 28 | namespace HeuristicLab.Problems.VehicleRouting {
|
---|
[4362] | 29 | [StorableClass]
|
---|
| 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) {
|
---|
[4752] | 39 | return new Tour(this, cloner);
|
---|
| 40 | }
|
---|
[4362] | 41 |
|
---|
[4752] | 42 | protected Tour(Tour original, Cloner cloner)
|
---|
| 43 | : base(original, cloner) {
|
---|
[8053] | 44 | this.Stops = new List<int>(original.Stops);
|
---|
[4362] | 45 | }
|
---|
[6607] | 46 |
|
---|
[7906] | 47 | [StorableConstructor]
|
---|
| 48 | protected Tour(bool deserializing) : base(deserializing) { }
|
---|
| 49 |
|
---|
[6851] | 50 | public double GetTourLength(IVRPProblemInstance instance, IVRPEncoding solution) {
|
---|
[6607] | 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++) {
|
---|
[6851] | 62 | length += instance.GetDistance(cities[i - 1], cities[i], solution);
|
---|
[6607] | 63 | }
|
---|
| 64 | }
|
---|
| 65 |
|
---|
| 66 | return length;
|
---|
| 67 | }
|
---|
[6851] | 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++;
|
---|
[8053] | 76 | }
|
---|
[6851] | 77 |
|
---|
| 78 | return equal;
|
---|
| 79 | }
|
---|
[4362] | 80 | }
|
---|
| 81 | }
|
---|