Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Problems.VehicleRouting/3.3/Encodings/Potvin/PotvinEncoding.cs @ 4177

Last change on this file since 4177 was 4177, checked in by svonolfe, 12 years ago

Refactored VRP in preparation for the code review (#1039)

File size: 4.5 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;
29
30namespace HeuristicLab.Problems.VehicleRouting.Encodings.Potvin {
31  [Item("PotvinEncoding", "Represents a potvin encoding of VRP solutions. It is implemented as described in Potvin, J.-Y. and Bengio, S. (1996). The Vehicle Routing Problem with Time Windows - Part II: Genetic Search. INFORMS Journal of Computing, 8:165–172.")]
32  [StorableClass]
33  public class PotvinEncoding : Item, IVRPEncoding {
34    public override Image ItemImage {
35      get { return HeuristicLab.Common.Resources.VS2008ImageLibrary.Class; }
36    }
37   
38    #region IVRPEncoding Members
39    [Storable]
40    public ItemList<Tour> Tours { get; set; }
41
42    public int Cities {
43      get
44      {
45        int cities = 0;
46
47        foreach (Tour tour in Tours) {
48          cities += tour.Cities.Count;
49        }
50
51        return cities;
52      }
53    }
54    #endregion
55
56    [Storable]
57    public List<int> Unrouted { get; set; }
58
59    public override IDeepCloneable Clone(HeuristicLab.Common.Cloner cloner) {
60      PotvinEncoding clone = new PotvinEncoding();
61      cloner.RegisterClonedObject(this, clone);
62      clone.Tours = (ItemList<Tour>)cloner.Clone(this.Tours);
63      clone.Unrouted = new List<int>(Unrouted);
64      return clone;
65    }
66
67    public PotvinEncoding() {
68      Tours = new ItemList<Tour>();
69      Unrouted = new List<int>();
70    }
71   
72    public static PotvinEncoding ConvertFrom(IVRPEncoding encoding) {
73      PotvinEncoding solution = new PotvinEncoding();
74
75      solution.Tours.AddRange(
76        encoding.Tours);
77
78      return solution;
79    }
80
81    public static PotvinEncoding ConvertFrom(List<int> route) {
82      PotvinEncoding solution = new PotvinEncoding();
83
84      Tour tour = new Tour();
85      for (int i = 0; i < route.Count; i++) {
86        if (route[i] == 0) {
87          if (tour.Cities.Count > 0) {
88            solution.Tours.Add(tour);
89            tour = new Tour();
90          }
91        } else {
92          tour.Cities.Add(route[i]);
93        }
94      }
95
96      return solution;
97    }
98
99    public bool FindInsertionPlace(
100      DoubleArray dueTimeArray,
101      DoubleArray serviceTimeArray, DoubleArray readyTimeArray, DoubleArray demandArray, DoubleValue capacity,
102      DoubleMatrix coordinates, ILookupParameter<DoubleMatrix> distanceMatrix, BoolValue useDistanceMatrix,
103      int city, int routeToAvoid, out int route, out int place) {
104      route = -1;
105      place = -1;
106      double minDetour = 0;
107
108      for (int tour = 0; tour < Tours.Count; tour++) {
109        if (tour != routeToAvoid) {
110          for (int i = 0; i <= Tours[tour].Cities.Count; i++) {
111            double length = Tours[tour].GetLength(coordinates, distanceMatrix, useDistanceMatrix);
112
113            Tours[tour].Cities.Insert(i, city);
114
115            if (Tours[tour].Feasible(dueTimeArray, serviceTimeArray, readyTimeArray, demandArray,
116              capacity, coordinates, distanceMatrix, useDistanceMatrix)) {
117              double newLength = Tours[tour].GetLength(coordinates, distanceMatrix, useDistanceMatrix);
118
119              double detour = newLength - length;
120
121              if (route <= 0 || detour < minDetour) {
122                route = tour;
123                place = i;
124                minDetour = detour;
125              }
126            }
127
128            Tours[tour].Cities.RemoveAt(i);
129          }
130        }
131      }
132
133      return route >= 0 && place >= 0;
134    }
135  }
136}
Note: See TracBrowser for help on using the repository browser.