1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2010 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.Linq;
|
---|
25 | using System.Text;
|
---|
26 | using HeuristicLab.Problems.VehicleRouting.Interfaces;
|
---|
27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
28 | using HeuristicLab.Core;
|
---|
29 | using HeuristicLab.Parameters;
|
---|
30 | using HeuristicLab.Data;
|
---|
31 | using HeuristicLab.Optimization;
|
---|
32 | using HeuristicLab.PluginInfrastructure;
|
---|
33 | using HeuristicLab.Problems.VehicleRouting.Variants;
|
---|
34 | using HeuristicLab.Problems.VehicleRouting.Encodings;
|
---|
35 | using HeuristicLab.Common;
|
---|
36 |
|
---|
37 |
|
---|
38 | namespace HeuristicLab.Problems.VehicleRouting.ProblemInstances {
|
---|
39 | [Item("SingleDepotVRPEvaluator", "Represents a single depot VRP evaluator.")]
|
---|
40 | [StorableClass]
|
---|
41 | public class SingleDepotVRPEvaluator: VRPEvaluator {
|
---|
42 | protected override void EvaluateTour(VRPEvaluation eval, IVRPProblemInstance instance, Tour tour) {
|
---|
43 | double distance = 0.0;
|
---|
44 | double quality = 0.0;
|
---|
45 |
|
---|
46 | //simulate a tour, start and end at depot
|
---|
47 | for (int i = 0; i <= tour.Stops.Count; i++) {
|
---|
48 | int start = 0;
|
---|
49 | if (i > 0)
|
---|
50 | start = tour.Stops[i - 1];
|
---|
51 | int end = 0;
|
---|
52 | if (i < tour.Stops.Count)
|
---|
53 | end = tour.Stops[i];
|
---|
54 |
|
---|
55 | //drive there
|
---|
56 | double currentDistace = instance.GetDistance(start, end);
|
---|
57 | distance += currentDistace;
|
---|
58 | }
|
---|
59 |
|
---|
60 | //Fleet usage
|
---|
61 | quality += instance.FleetUsageFactor.Value;
|
---|
62 | //Distance
|
---|
63 | quality += instance.DistanceFactor.Value * distance;
|
---|
64 |
|
---|
65 | eval.Distance += distance;
|
---|
66 | eval.VehicleUtilization += 1;
|
---|
67 |
|
---|
68 | eval.Quality += quality;
|
---|
69 | }
|
---|
70 |
|
---|
71 | [StorableConstructor]
|
---|
72 | protected SingleDepotVRPEvaluator(bool deserializing) : base(deserializing) { }
|
---|
73 |
|
---|
74 | public SingleDepotVRPEvaluator() {
|
---|
75 | }
|
---|
76 |
|
---|
77 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
78 | return new SingleDepotVRPEvaluator(this, cloner);
|
---|
79 | }
|
---|
80 |
|
---|
81 | protected SingleDepotVRPEvaluator(SingleDepotVRPEvaluator original, Cloner cloner)
|
---|
82 | : base(original, cloner) {
|
---|
83 | }
|
---|
84 | }
|
---|
85 | } |
---|