[4268] | 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 |
|
---|
[4687] | 22 | using System;
|
---|
| 23 | using System.Collections.Generic;
|
---|
[4268] | 24 | using HeuristicLab.Common;
|
---|
| 25 | using HeuristicLab.Core;
|
---|
| 26 | using HeuristicLab.Data;
|
---|
| 27 | using HeuristicLab.Encodings.PermutationEncoding;
|
---|
| 28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 29 |
|
---|
| 30 | namespace HeuristicLab.Problems.VehicleRouting.Encodings.General {
|
---|
| 31 | [Item("PermutationEncoding", "Represents a base class for permutation encodings of VRP solutions.")]
|
---|
| 32 | [StorableClass]
|
---|
| 33 | public abstract class PermutationEncoding : Permutation, IVRPEncoding {
|
---|
| 34 | #region IVRPEncoding Members
|
---|
| 35 | public abstract List<Tour> GetTours(ILookupParameter<DoubleMatrix> distanceMatrix = null, int maxVehicles = int.MaxValue);
|
---|
| 36 | #endregion
|
---|
| 37 |
|
---|
| 38 | public PermutationEncoding(Permutation permutation)
|
---|
| 39 | : base(PermutationTypes.RelativeUndirected) {
|
---|
| 40 | this.array = new int[permutation.Length];
|
---|
| 41 | for (int i = 0; i < array.Length; i++)
|
---|
| 42 | this.array[i] = permutation[i];
|
---|
| 43 | }
|
---|
| 44 |
|
---|
| 45 | [StorableConstructor]
|
---|
| 46 | protected PermutationEncoding(bool serializing)
|
---|
| 47 | : base() {
|
---|
| 48 | }
|
---|
[4687] | 49 | protected PermutationEncoding(PermutationEncoding original, Cloner cloner)
|
---|
| 50 | : base(original, cloner) {
|
---|
| 51 | }
|
---|
[4293] | 52 |
|
---|
[4687] | 53 |
|
---|
[4293] | 54 | public int IndexOf(int city) {
|
---|
| 55 | return Array.IndexOf(this.array, city);
|
---|
| 56 | }
|
---|
[4268] | 57 | }
|
---|
| 58 | }
|
---|