[7883] | 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 |
|
---|
| 22 | using System;
|
---|
| 23 | using System.Collections.Generic;
|
---|
| 24 | using System.IO;
|
---|
| 25 | using System.Linq;
|
---|
| 26 | using System.Reflection;
|
---|
| 27 | using System.Text.RegularExpressions;
|
---|
| 28 | using ICSharpCode.SharpZipLib.Zip;
|
---|
| 29 | using HeuristicLab.Problems.Instances.TSPLIB;
|
---|
| 30 |
|
---|
| 31 | namespace HeuristicLab.Problems.Instances.VehicleRouting {
|
---|
[7887] | 32 | public abstract class GoldenFormatInstanceProvider : VRPInstanceProvider<CVRPTWData> {
|
---|
| 33 | protected override CVRPTWData LoadData(Stream stream) {
|
---|
[7883] | 34 | return LoadInstance(new GoldenParser(stream));
|
---|
| 35 | }
|
---|
| 36 |
|
---|
[7887] | 37 | public override CVRPTWData LoadData(string path) {
|
---|
[7883] | 38 | return LoadInstance(new GoldenParser(path));
|
---|
| 39 | }
|
---|
| 40 |
|
---|
[7887] | 41 | private CVRPTWData LoadInstance(GoldenParser parser) {
|
---|
[7883] | 42 | parser.Parse();
|
---|
| 43 |
|
---|
[7887] | 44 | var instance = new CVRPTWData();
|
---|
[7883] | 45 | instance.Dimension = parser.Vertices.GetLength(0) + 1;
|
---|
| 46 | instance.Coordinates = parser.Vertices;
|
---|
| 47 | instance.Capacity = parser.Capacity;
|
---|
| 48 | instance.Demands = parser.Demands;
|
---|
| 49 | switch (parser.WeightType) {
|
---|
| 50 | case GoldenParser.GoldenEdgeWeightType.EUC_2D:
|
---|
| 51 | instance.DistanceMeasure = DistanceMeasure.Euclidean; break;
|
---|
| 52 | case GoldenParser.GoldenEdgeWeightType.GEO:
|
---|
| 53 | instance.DistanceMeasure = DistanceMeasure.Geo; break;
|
---|
| 54 | default:
|
---|
| 55 | throw new InvalidDataException("The given edge weight is not supported by HeuristicLab.");
|
---|
| 56 | }
|
---|
| 57 |
|
---|
[7887] | 58 | instance.ReadyTimes = new double[instance.Dimension];
|
---|
| 59 | instance.ServiceTimes = new double[instance.Dimension];
|
---|
| 60 | instance.DueTimes = new double[instance.Dimension];
|
---|
| 61 |
|
---|
| 62 | for (int i = 0; i < instance.Dimension; i++) {
|
---|
| 63 | instance.ReadyTimes[i] = 0;
|
---|
| 64 | instance.ServiceTimes[i] = 0;
|
---|
| 65 | instance.DueTimes[i] = double.MaxValue;
|
---|
| 66 | }
|
---|
| 67 |
|
---|
| 68 | if(parser.Distance > 0)
|
---|
| 69 | instance.DueTimes[0] = parser.Distance;
|
---|
| 70 |
|
---|
| 71 | if (parser.Vehicles > 0)
|
---|
| 72 | instance.MaximumVehicles = parser.Vehicles;
|
---|
| 73 |
|
---|
[7883] | 74 | instance.Name = parser.ProblemName;
|
---|
| 75 | instance.Description = parser.Comment
|
---|
| 76 | + Environment.NewLine + Environment.NewLine
|
---|
| 77 | + GetInstanceDescription();
|
---|
| 78 |
|
---|
| 79 | return instance;
|
---|
| 80 | }
|
---|
| 81 | }
|
---|
| 82 | }
|
---|