Free cookie consent management tool by TermsFeed Policy Generator

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

Last change on this file since 11174 was 11170, checked in by ascheibe, 10 years ago

#2115 updated copyright year in stable branch

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