[7881] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[16140] | 3 | * Copyright (C) 2002-2018 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[7881] | 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.Text.RegularExpressions;
|
---|
| 26 |
|
---|
| 27 | namespace HeuristicLab.Problems.Instances.VehicleRouting {
|
---|
| 28 | class CordeauParser {
|
---|
| 29 | private string file;
|
---|
| 30 | private Stream stream;
|
---|
| 31 | private string problemName;
|
---|
| 32 | private int cities;
|
---|
| 33 | private int depots;
|
---|
| 34 | private int vehicles;
|
---|
| 35 | private List<double> capacity;
|
---|
| 36 | private List<double> xCoord;
|
---|
| 37 | private List<double> yCoord;
|
---|
| 38 | private List<double> demand;
|
---|
| 39 | private List<double> readyTime;
|
---|
| 40 | private List<double> dueTime;
|
---|
| 41 | private List<double> serviceTime;
|
---|
| 42 |
|
---|
| 43 | public int Cities {
|
---|
| 44 | get {
|
---|
| 45 | return cities;
|
---|
| 46 | }
|
---|
| 47 | }
|
---|
| 48 |
|
---|
| 49 | public int Depots {
|
---|
| 50 | get {
|
---|
| 51 | return depots;
|
---|
| 52 | }
|
---|
| 53 | }
|
---|
| 54 |
|
---|
| 55 | public int Vehicles {
|
---|
| 56 | get {
|
---|
| 57 | return vehicles;
|
---|
| 58 | }
|
---|
| 59 | }
|
---|
| 60 |
|
---|
| 61 | public double[] Capacity {
|
---|
| 62 | get {
|
---|
| 63 | return capacity.ToArray();
|
---|
| 64 | }
|
---|
| 65 | }
|
---|
| 66 |
|
---|
| 67 | public double[,] Coordinates {
|
---|
| 68 | get {
|
---|
| 69 | double[] x = xCoord.ToArray();
|
---|
| 70 | double[] y = yCoord.ToArray();
|
---|
| 71 | double[,] coord = new double[x.Length, 2];
|
---|
| 72 | for (int i = 0; i < x.Length; i++) {
|
---|
| 73 | coord[i, 0] = x[i];
|
---|
| 74 | coord[i, 1] = y[i];
|
---|
| 75 | }
|
---|
| 76 | return coord;
|
---|
| 77 | }
|
---|
| 78 | }
|
---|
| 79 |
|
---|
| 80 | public double[] Demands {
|
---|
| 81 | get {
|
---|
| 82 | return demand.ToArray();
|
---|
| 83 | }
|
---|
| 84 | }
|
---|
| 85 |
|
---|
| 86 | public double[] Readytimes {
|
---|
| 87 | get {
|
---|
| 88 | return readyTime.ToArray();
|
---|
| 89 | }
|
---|
| 90 | }
|
---|
| 91 |
|
---|
| 92 | public double[] Duetimes {
|
---|
| 93 | get {
|
---|
| 94 | return dueTime.ToArray();
|
---|
| 95 | }
|
---|
| 96 | }
|
---|
| 97 |
|
---|
| 98 | public double[] Servicetimes {
|
---|
| 99 | get {
|
---|
| 100 | return serviceTime.ToArray();
|
---|
| 101 | }
|
---|
| 102 | }
|
---|
| 103 |
|
---|
| 104 | public String ProblemName {
|
---|
| 105 | get {
|
---|
| 106 | return problemName;
|
---|
| 107 | }
|
---|
| 108 | }
|
---|
| 109 |
|
---|
| 110 | public CordeauParser() {
|
---|
| 111 | capacity = new List<double>();
|
---|
| 112 | xCoord = new List<double>();
|
---|
| 113 | yCoord = new List<double>();
|
---|
| 114 | demand = new List<double>();
|
---|
| 115 | readyTime = new List<double>();
|
---|
| 116 | dueTime = new List<double>();
|
---|
| 117 | serviceTime = new List<double>();
|
---|
| 118 | }
|
---|
| 119 |
|
---|
[8053] | 120 | public CordeauParser(string file)
|
---|
| 121 | : this() {
|
---|
[7881] | 122 | this.file = file;
|
---|
| 123 | }
|
---|
| 124 |
|
---|
[8053] | 125 | public CordeauParser(Stream stream)
|
---|
| 126 | : this() {
|
---|
[7881] | 127 | this.stream = stream;
|
---|
| 128 | }
|
---|
| 129 |
|
---|
[8053] | 130 | public void Parse() {
|
---|
| 131 | string line;
|
---|
| 132 | Regex reg = new Regex(@"-?\d+(\.\d+)?");
|
---|
| 133 | MatchCollection m;
|
---|
[7881] | 134 |
|
---|
[8053] | 135 | StreamReader reader;
|
---|
| 136 | if (stream != null) {
|
---|
| 137 | reader = new StreamReader(stream);
|
---|
| 138 | } else {
|
---|
| 139 | reader = new StreamReader(file);
|
---|
| 140 | problemName = Path.GetFileNameWithoutExtension(file);
|
---|
| 141 | }
|
---|
[7881] | 142 |
|
---|
[8053] | 143 | using (reader) {
|
---|
| 144 | List<double> depotXcoord = new List<double>();
|
---|
| 145 | List<double> depotYcoord = new List<double>();
|
---|
| 146 | List<double> depotReadyTime = new List<double>();
|
---|
| 147 | List<double> depotDueTime = new List<double>();
|
---|
[7881] | 148 |
|
---|
[8053] | 149 | List<double> routeDueTime = new List<double>();
|
---|
[7881] | 150 |
|
---|
[8053] | 151 | line = reader.ReadLine();
|
---|
[7881] | 152 |
|
---|
[8053] | 153 | m = reg.Matches(line);
|
---|
| 154 | if (m.Count != 4)
|
---|
| 155 | throw new InvalidDataException("File has wrong format!");
|
---|
[7881] | 156 |
|
---|
[8053] | 157 | int type = int.Parse(m[0].Value);
|
---|
| 158 | if (type != 2 && type != 6)
|
---|
| 159 | throw new InvalidDataException("Unsupported instance type");
|
---|
[7881] | 160 |
|
---|
[8053] | 161 | bool timeWindows = type == 6;
|
---|
| 162 | vehicles = int.Parse(m[1].Value);
|
---|
| 163 | cities = int.Parse(m[2].Value);
|
---|
| 164 | depots = int.Parse(m[3].Value);
|
---|
| 165 | line = reader.ReadLine();
|
---|
[7881] | 166 |
|
---|
[8053] | 167 | for (int i = 0; i < depots; i++) {
|
---|
| 168 | m = reg.Matches(line);
|
---|
| 169 | if (m.Count != 2) { continue; }
|
---|
[7881] | 170 |
|
---|
[8053] | 171 | routeDueTime.Add(double.Parse(m[0].Value, System.Globalization.CultureInfo.InvariantCulture));
|
---|
| 172 | capacity.Add(double.Parse(m[1].Value, System.Globalization.CultureInfo.InvariantCulture));
|
---|
[7881] | 173 |
|
---|
[8053] | 174 | line = reader.ReadLine();
|
---|
| 175 | }
|
---|
[7881] | 176 |
|
---|
[8053] | 177 | while ((line != null)) {
|
---|
| 178 | m = reg.Matches(line);
|
---|
[7881] | 179 |
|
---|
[8053] | 180 | if (demand.Count < cities) {
|
---|
| 181 | xCoord.Add(double.Parse(m[1].Value, System.Globalization.CultureInfo.InvariantCulture));
|
---|
| 182 | yCoord.Add(double.Parse(m[2].Value, System.Globalization.CultureInfo.InvariantCulture));
|
---|
| 183 | demand.Add((double)int.Parse(m[4].Value, System.Globalization.CultureInfo.InvariantCulture));
|
---|
| 184 | serviceTime.Add(int.Parse(m[3].Value));
|
---|
[7881] | 185 |
|
---|
[8053] | 186 | if (timeWindows) {
|
---|
| 187 | readyTime.Add(int.Parse(m[m.Count - 2].Value));
|
---|
| 188 | dueTime.Add(int.Parse(m[m.Count - 1].Value));
|
---|
| 189 | } else {
|
---|
| 190 | readyTime.Add(0);
|
---|
| 191 | dueTime.Add(double.MaxValue);
|
---|
| 192 | }
|
---|
| 193 | } else {
|
---|
| 194 | depotXcoord.Add(double.Parse(m[1].Value, System.Globalization.CultureInfo.InvariantCulture));
|
---|
| 195 | depotYcoord.Add(double.Parse(m[2].Value, System.Globalization.CultureInfo.InvariantCulture));
|
---|
[7881] | 196 |
|
---|
[8053] | 197 | if (timeWindows) {
|
---|
| 198 | depotReadyTime.Add(int.Parse(m[m.Count - 2].Value));
|
---|
| 199 | depotDueTime.Add(int.Parse(m[m.Count - 1].Value));
|
---|
| 200 | } else {
|
---|
| 201 | depotReadyTime.Add(0);
|
---|
| 202 | depotDueTime.Add(double.MaxValue);
|
---|
| 203 | }
|
---|
| 204 | }
|
---|
[7881] | 205 |
|
---|
[8053] | 206 | line = reader.ReadLine();
|
---|
| 207 | }
|
---|
[7881] | 208 |
|
---|
[8053] | 209 | for (int i = 0; i < depotDueTime.Count; i++) {
|
---|
| 210 | if (!timeWindows) {
|
---|
| 211 | depotDueTime[i] = routeDueTime[i];
|
---|
| 212 | }
|
---|
| 213 | if (depotDueTime[i] < double.Epsilon)
|
---|
| 214 | depotDueTime[i] = double.MaxValue;
|
---|
| 215 | }
|
---|
[7881] | 216 |
|
---|
[8053] | 217 | xCoord.InsertRange(0, depotXcoord);
|
---|
| 218 | yCoord.InsertRange(0, depotYcoord);
|
---|
| 219 | readyTime.InsertRange(0, depotReadyTime);
|
---|
| 220 | dueTime.InsertRange(0, depotDueTime);
|
---|
| 221 |
|
---|
| 222 | List<double> originalCapacities = new List<double>(capacity);
|
---|
| 223 | capacity.Clear();
|
---|
| 224 | for (int i = 0; i < depots; i++) {
|
---|
| 225 | for (int j = 0; j < vehicles; j++) {
|
---|
| 226 | capacity.Add(originalCapacities[i]);
|
---|
| 227 | }
|
---|
| 228 | }
|
---|
| 229 | vehicles *= depots;
|
---|
| 230 | }
|
---|
| 231 | }
|
---|
[7881] | 232 | }
|
---|
| 233 | }
|
---|