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.IO;
|
---|
23 |
|
---|
24 | namespace HeuristicLab.Problems.Instances.VehicleRouting {
|
---|
25 | public abstract class CordeauFormatInstanceProvider : VRPInstanceProvider<MDCVRPTWData> {
|
---|
26 | protected override MDCVRPTWData LoadData(Stream stream) {
|
---|
27 | return LoadInstance(new CordeauParser(stream));
|
---|
28 | }
|
---|
29 |
|
---|
30 | public override bool CanImportData {
|
---|
31 | get { return true; }
|
---|
32 | }
|
---|
33 | public override MDCVRPTWData ImportData(string path) {
|
---|
34 | return LoadInstance(new CordeauParser(path));
|
---|
35 | }
|
---|
36 |
|
---|
37 | private MDCVRPTWData LoadInstance(CordeauParser parser) {
|
---|
38 | parser.Parse();
|
---|
39 |
|
---|
40 | var instance = new MDCVRPTWData();
|
---|
41 | instance.Dimension = parser.Cities + 1;
|
---|
42 | instance.Depots = parser.Depots;
|
---|
43 | instance.Coordinates = parser.Coordinates;
|
---|
44 | instance.Capacity = parser.Capacity;
|
---|
45 | instance.Demands = parser.Demands;
|
---|
46 | instance.DistanceMeasure = DistanceMeasure.Euclidean;
|
---|
47 | instance.ReadyTimes = parser.Readytimes;
|
---|
48 | instance.ServiceTimes = parser.Servicetimes;
|
---|
49 | instance.DueTimes = parser.Duetimes;
|
---|
50 | instance.MaximumVehicles = parser.Vehicles;
|
---|
51 |
|
---|
52 | int depots = parser.Depots;
|
---|
53 | int vehicles = parser.Vehicles / parser.Depots;
|
---|
54 | instance.VehicleDepotAssignment = new int[depots * vehicles];
|
---|
55 | int index = 0;
|
---|
56 |
|
---|
57 | for (int i = 0; i < depots; i++)
|
---|
58 | for (int j = 0; j < vehicles; j++) {
|
---|
59 | instance.VehicleDepotAssignment[index] = i;
|
---|
60 | index++;
|
---|
61 | }
|
---|
62 |
|
---|
63 | instance.Name = parser.ProblemName;
|
---|
64 |
|
---|
65 | return instance;
|
---|
66 | }
|
---|
67 | }
|
---|
68 | }
|
---|