[7881] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[14186] | 3 | * Copyright (C) 2002-2016 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 |
|
---|
| 24 | namespace HeuristicLab.Problems.Instances.VehicleRouting {
|
---|
[11294] | 25 | public class CordeauMDInstanceProvider : CordeauFormatInstanceProvider<MDCVRPData> {
|
---|
[7881] | 26 | public override string Name {
|
---|
[11292] | 27 | get { return "Cordeau (MDCVRP)"; }
|
---|
[7881] | 28 | }
|
---|
| 29 |
|
---|
| 30 | public override string Description {
|
---|
| 31 | get { return "Cordeau test set"; }
|
---|
| 32 | }
|
---|
[11280] | 33 |
|
---|
[7881] | 34 | public override Uri WebLink {
|
---|
[11292] | 35 | get { return new Uri(@"http://neo.lcc.uma.es/vrp/vrp-instances/multiple-depot-vrp-instances/"); }
|
---|
[7881] | 36 | }
|
---|
| 37 |
|
---|
| 38 | public override string ReferencePublication {
|
---|
[11292] | 39 | get {
|
---|
| 40 | return @"J.-F. Cordeau, M. Gendreau, G. Laporte. 1997.
|
---|
[11282] | 41 | A tabu search heuristic for periodic and multi-depot vehicle routing problems.
|
---|
[11292] | 42 | Networks, 30, pp. 105–119.";
|
---|
| 43 | }
|
---|
[7881] | 44 | }
|
---|
| 45 |
|
---|
| 46 | protected override string FileName {
|
---|
[11296] | 47 | get { return "CordeauMD"; }
|
---|
[7881] | 48 | }
|
---|
[11292] | 49 |
|
---|
| 50 | internal override MDCVRPData LoadInstance(CordeauParser parser) {
|
---|
| 51 | parser.Parse();
|
---|
| 52 |
|
---|
| 53 | var instance = new MDCVRPData();
|
---|
| 54 | instance.Dimension = parser.Cities + 1;
|
---|
| 55 | instance.Depots = parser.Depots;
|
---|
| 56 | instance.Coordinates = parser.Coordinates;
|
---|
| 57 | instance.Capacity = parser.Capacity;
|
---|
| 58 | instance.Demands = parser.Demands;
|
---|
| 59 | instance.DistanceMeasure = DistanceMeasure.Euclidean;
|
---|
| 60 | instance.MaximumVehicles = parser.Vehicles;
|
---|
| 61 |
|
---|
| 62 | int depots = parser.Depots;
|
---|
| 63 | int vehicles = parser.Vehicles / parser.Depots;
|
---|
| 64 | instance.VehicleDepotAssignment = new int[depots * vehicles];
|
---|
| 65 | int index = 0;
|
---|
| 66 |
|
---|
| 67 | for (int i = 0; i < depots; i++)
|
---|
| 68 | for (int j = 0; j < vehicles; j++) {
|
---|
| 69 | instance.VehicleDepotAssignment[index] = i;
|
---|
| 70 | index++;
|
---|
| 71 | }
|
---|
| 72 |
|
---|
| 73 | instance.Name = parser.ProblemName;
|
---|
| 74 |
|
---|
| 75 | return instance;
|
---|
| 76 | }
|
---|
[7881] | 77 | }
|
---|
| 78 | }
|
---|