[7871] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17226] | 3 | * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[7871] | 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 |
|
---|
[8053] | 22 | using HeuristicLab.Data;
|
---|
[7871] | 23 | using HeuristicLab.Problems.Instances;
|
---|
| 24 | using HeuristicLab.Problems.VehicleRouting.ProblemInstances;
|
---|
[8649] | 25 | using HeuristicLab.Problems.VehicleRouting.Interfaces;
|
---|
[7871] | 26 |
|
---|
| 27 | namespace HeuristicLab.Problems.VehicleRouting.Interpreters {
|
---|
[9010] | 28 | public class CVRPInterpreter : VRPInterpreter, IVRPDataInterpreter<CVRPData> {
|
---|
[8649] | 29 | protected override IVRPProblemInstance CreateProblemInstance() {
|
---|
| 30 | return new CVRPProblemInstance();
|
---|
| 31 | }
|
---|
| 32 |
|
---|
| 33 | protected override void Interpret(IVRPData data, IVRPProblemInstance problemInstance) {
|
---|
[9010] | 34 | CVRPData cvrpData = (CVRPData)data;
|
---|
| 35 | CVRPProblemInstance problem = (CVRPProblemInstance)problemInstance;
|
---|
[8649] | 36 |
|
---|
[8053] | 37 | if (cvrpData.Coordinates != null)
|
---|
[7881] | 38 | problem.Coordinates = new DoubleMatrix(cvrpData.Coordinates);
|
---|
[7871] | 39 | if (cvrpData.MaximumVehicles != null)
|
---|
| 40 | problem.Vehicles.Value = (int)cvrpData.MaximumVehicles;
|
---|
| 41 | else
|
---|
| 42 | problem.Vehicles.Value = cvrpData.Dimension - 1;
|
---|
| 43 | problem.Capacity.Value = 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 | }
|
---|
| 51 | }
|
---|