Free cookie consent management tool by TermsFeed Policy Generator

source: stable/HeuristicLab.Problems.VehicleRouting/3.4/Interpreters/VRPInterpreter.cs @ 18151

Last change on this file since 18151 was 17181, checked in by swagner, 5 years ago

#2875: Merged r17180 from trunk to stable

File size: 2.8 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 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.IO;
23using HeuristicLab.Problems.Instances;
24using HeuristicLab.Problems.VehicleRouting.Encodings.Potvin;
25using HeuristicLab.Problems.VehicleRouting.Interfaces;
26
27namespace HeuristicLab.Problems.VehicleRouting.Interpreters {
28  public abstract class VRPInterpreter : IVRPDataInterpreter<IVRPData> {
29    protected abstract void Interpret(IVRPData data, IVRPProblemInstance problemInstance);
30
31    protected virtual IVRPEncoding GetBestKnowTour(IVRPData data, IVRPProblemInstance problemInstance) {
32      if (data.BestKnownTour != null) {
33        PotvinEncoding solution = new PotvinEncoding(problemInstance);
34
35        for (int i = 0; i < data.BestKnownTour.GetLength(0); i++) {
36          Tour tour = new Tour();
37          solution.Tours.Add(tour);
38
39          foreach (int stop in data.BestKnownTour[i]) {
40            tour.Stops.Add(stop + 1);
41          }
42        }
43
44        if (data.BestKnownTourVehicleAssignment != null) {
45          if (data.BestKnownTourVehicleAssignment.Length != solution.VehicleAssignment.Length)
46            throw new InvalidDataException("Number of vehicles of the best known tour does not match the number vehicles of the instance.");
47          for (int i = 0; i < data.BestKnownTourVehicleAssignment.Length; i++)
48            solution.VehicleAssignment[i] = data.BestKnownTourVehicleAssignment[i];
49        }
50
51        return solution;
52      } else {
53        return null;
54      }
55    }
56
57    protected abstract IVRPProblemInstance CreateProblemInstance();
58
59    public VRPInstanceDescription Interpret(IVRPData data) {
60      VRPInstanceDescription result = new VRPInstanceDescription();
61      result.Name = data.Name;
62      result.Description = data.Description;
63
64      IVRPProblemInstance problem = CreateProblemInstance();
65      Interpret(data, problem);
66      result.ProblemInstance = problem;
67
68      result.BestKnownQuality = data.BestKnownQuality;
69      result.BestKnownSolution = GetBestKnowTour(data, problem);
70
71      return result;
72    }
73  }
74}
Note: See TracBrowser for help on using the repository browser.