source: trunk/sources/HeuristicLab.Problems.VehicleRouting/3.4/Interpreters/MDCVRPTWInterpreter.cs @ 8053

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

#1722 fixed more licensing information and source formatting

File size: 3.0 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2012 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;
26
27namespace HeuristicLab.Problems.VehicleRouting.Interpreters {
28  public class MDCVRPTWInterpreter : IVRPDataInterpreter<MDCVRPTWData> {
29    public VRPInstanceDescription Interpret(IVRPData data) {
30      MDCVRPTWData cvrpData = data as MDCVRPTWData;
31
32      VRPInstanceDescription result = new VRPInstanceDescription();
33      result.Name = cvrpData.Name;
34      result.Description = cvrpData.Description;
35
36      MDCVRPTWProblemInstance problem = new MDCVRPTWProblemInstance();
37      if (cvrpData.Coordinates != null)
38        problem.Coordinates = new DoubleMatrix(cvrpData.Coordinates);
39      if (cvrpData.MaximumVehicles != null)
40        problem.Vehicles.Value = (int)cvrpData.MaximumVehicles;
41      else
42        problem.Vehicles.Value = cvrpData.Dimension - 1;
43      problem.Capacity = new DoubleArray(cvrpData.Capacity);
44      problem.Demand = new DoubleArray(cvrpData.Demands);
45      if (cvrpData.DistanceMeasure != DistanceMeasure.Euclidean) {
46        problem.UseDistanceMatrix.Value = true;
47        problem.DistanceMatrix = new DoubleMatrix(cvrpData.GetDistanceMatrix());
48      }
49
50      problem.Depots.Value = cvrpData.Depots;
51      problem.VehicleDepotAssignment = new IntArray(cvrpData.VehicleDepotAssignment);
52
53      problem.ReadyTime = new DoubleArray(cvrpData.ReadyTimes);
54      problem.ServiceTime = new DoubleArray(cvrpData.ServiceTimes);
55      problem.DueTime = new DoubleArray(cvrpData.DueTimes);
56      result.ProblemInstance = problem;
57
58      result.BestKnownQuality = cvrpData.BestKnownQuality;
59      if (cvrpData.BestKnownTour != null) {
60        PotvinEncoding solution = new PotvinEncoding(problem);
61
62        for (int i = 0; i < cvrpData.BestKnownTour.GetLength(0); i++) {
63          Tour tour = new Tour();
64          solution.Tours.Add(tour);
65
66          foreach (int stop in cvrpData.BestKnownTour[i]) {
67            tour.Stops.Add(stop + 1);
68          }
69        }
70
71        result.BestKnownSolution = solution;
72      }
73
74      return result;
75    }
76  }
77}
Note: See TracBrowser for help on using the repository browser.