Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Problems.VehicleRouting/3.3/Encodings/GVR/GVREncoding.cs @ 4352

Last change on this file since 4352 was 4352, checked in by svonolfe, 14 years ago

Merged r4351 of the VRP feature branch into trunk (#1039)

File size: 4.3 KB
Line 
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
22using HeuristicLab.Common;
23using HeuristicLab.Core;
24using HeuristicLab.Data;
25using HeuristicLab.Encodings.PermutationEncoding;
26using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
27using System.Drawing;
28using System.Collections.Generic;
29using HeuristicLab.Problems.VehicleRouting.Encodings.General;
30
31namespace HeuristicLab.Problems.VehicleRouting.Encodings.GVR {
32  [Item("GVREncoding", "Represents a potvin encoding of VRP solutions. It is implemented as described in Pereira, F.B. et al (2002). GVR: a New Genetic Representation for the Vehicle Routing Problem. AICS 2002, LNAI 2464, pp. 95-102.")]
33  [StorableClass]
34  public class GVREncoding : TourEncoding {
35    [Storable]
36    private DoubleValue capacity { get; set; }
37
38    [Storable]
39    private DoubleArray demand { get; set; }
40
41    public override List<Tour> GetTours(ILookupParameter<DoubleMatrix> distanceMatrix = null, int maxVehicles = int.MaxValue) {
42      List<Tour> tours = new List<Tour>();   
43
44      foreach (Tour tour in base.Tours) {
45        Tour newTour = new Tour();
46        double currentDemand = 0;
47
48        foreach (int city in tour.Cities) {
49          currentDemand += demand[city];
50
51          if (currentDemand > capacity.Value) {
52            if(newTour.Cities.Count > 0)
53              tours.Add(newTour);
54
55            newTour = new Tour();
56            newTour.Cities.Add(city);
57            currentDemand = demand[city];
58          } else {
59            newTour.Cities.Add(city);
60          }
61        }
62
63        if (newTour.Cities.Count > 0)
64          tours.Add(newTour);
65      }
66
67      //repair if there are too many vehicles used
68      while (tours.Count > maxVehicles) {
69        Tour tour = tours[tours.Count - 1];
70        tours[tours.Count - 2].Cities.AddRange(tour.Cities);
71
72        tours.Remove(tour);
73      }
74
75      return tours;
76    }
77   
78    public override IDeepCloneable Clone(HeuristicLab.Common.Cloner cloner) {
79      GVREncoding clone = new GVREncoding(capacity, demand);
80      cloner.RegisterClonedObject(this, clone);
81      clone.Tours = (ItemList<Tour>)cloner.Clone(this.Tours);
82     
83      return clone;
84    }
85
86    public GVREncoding(DoubleValue capacity, DoubleArray demand)
87      : base() {
88        this.capacity = capacity;
89        this.demand = demand;
90    }
91
92    [StorableConstructor]
93    private GVREncoding(bool serializing)
94      : base() {
95    }
96
97    public static GVREncoding ConvertFrom(IVRPEncoding encoding, DoubleValue capacity, DoubleArray demand,
98      ILookupParameter<DoubleMatrix> distanceMatrix) {
99      GVREncoding solution = new GVREncoding(capacity, demand);
100
101      TourEncoding.ConvertFrom(encoding, solution, distanceMatrix);
102
103      return solution;
104    }
105
106    public static GVREncoding ConvertFrom(List<int> route, DoubleValue capacity, DoubleArray demand) {
107      GVREncoding solution = new GVREncoding(capacity, demand);
108
109      TourEncoding.ConvertFrom(route, solution);
110
111      return solution;
112    }
113
114    internal void FindCustomer(int customer, out Tour tour, out int index) {
115      tour = null;
116      index = -1;
117
118      int currentTour = 0;
119      while (tour == null && currentTour < Tours.Count) {
120        int currentCity = 0;
121        while (tour == null && currentCity < Tours[currentTour].Cities.Count) {
122          if (Tours[currentTour].Cities[currentCity] == customer) {
123            tour = Tours[currentTour];
124            index = currentCity;
125          }
126
127          currentCity++;
128        }
129
130        currentTour++;
131      }
132    }
133  }
134}
Note: See TracBrowser for help on using the repository browser.