Free cookie consent management tool by TermsFeed Policy Generator

source: branches/VRP/HeuristicLab.Problems.VehicleRouting/3.4/Encodings/Potvin/PotvinEncoding.cs @ 6837

Last change on this file since 6837 was 6771, checked in by svonolfe, 13 years ago

Corrected behavior of various operators when a solution contains more tours than vehicles (#1177)

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;
29using HeuristicLab.Problems.VehicleRouting.Encodings.General;
30using HeuristicLab.Problems.VehicleRouting.Variants;
31using HeuristicLab.Problems.VehicleRouting.Interfaces;
32using HeuristicLab.Problems.VehicleRouting.ProblemInstances;
33
34namespace HeuristicLab.Problems.VehicleRouting.Encodings.Potvin {
35  [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.")]
36  [StorableClass]
37  public class PotvinEncoding : TourEncoding {   
38    [Storable]
39    public List<int> Unrouted { get; set; }
40
41    public PotvinEncoding(IVRPProblemInstance instance)
42      : base(instance) {
43      Unrouted = new List<int>();
44    }
45
46    [StorableConstructor]
47    private PotvinEncoding(bool serializing)
48      : base(serializing) {
49    }
50
51    public override IDeepCloneable Clone(Cloner cloner) {
52      return new PotvinEncoding(this, cloner);
53    }
54
55    protected PotvinEncoding(PotvinEncoding original, Cloner cloner)
56      : base(original, cloner) {
57        this.Unrouted = new List<int>(original.Unrouted);
58    }
59
60    public static PotvinEncoding ConvertFrom(IVRPEncoding encoding, IVRPProblemInstance instance) {
61      PotvinEncoding solution = new PotvinEncoding(instance);
62
63      TourEncoding.ConvertFrom(encoding, solution, instance);
64
65      return solution;
66    }
67
68    public static PotvinEncoding ConvertFrom(List<int> route, IVRPProblemInstance instance) {
69      PotvinEncoding solution = new PotvinEncoding(instance);
70
71      TourEncoding.ConvertFrom(route, solution);
72
73      return solution;
74    }
75
76    public double GetTourLength(Tour tour) {
77      return tour.GetTourLength(ProblemInstance);
78    }
79
80    public int FindBestInsertionPlace(Tour tour, int city, int positionToAvoid = -1) {
81      int place = -1;
82      double minQuality = -1;
83
84      VRPEvaluation eval = ProblemInstance.Evaluate(tour);
85
86      for (int i = 0; i <= tour.Stops.Count; i++) {
87        if (positionToAvoid != i) {
88          bool feasible;
89          double quality = ProblemInstance.GetInsertionCosts(eval, city, 0, i, out feasible);
90          if (place < 0 || quality < minQuality) {
91            place = i;
92            minQuality = quality;
93          }
94        }
95      }
96
97      if (place == -1)
98        place = 0;
99
100      return place;
101    }
102
103    public bool FindInsertionPlace(int city, int routeToAvoid, bool allowInfeasible, out int route, out int place) {
104      route = -1;
105      place = -1;
106      double minDetour = double.MaxValue;
107
108      VRPEvaluation eval = ProblemInstance.Evaluate(this);
109      bool originalFeasible = ProblemInstance.Feasible(eval);
110
111      for (int tour = 0; tour < Tours.Count; tour++) {
112        if (tour != routeToAvoid) {
113          double length = eval.Quality;
114
115          for (int i = 0; i <= Tours[tour].Stops.Count; i++) {
116            bool feasible;
117            double detour = ProblemInstance.GetInsertionCosts(eval, city, tour, i, out feasible);
118           
119            if (feasible || allowInfeasible) {
120              if (route < 0 || detour < minDetour) {
121                route = tour;
122                place = i;
123                minDetour = detour;
124              }
125            }
126          }
127        }
128      }
129
130      return route >= 0 && place >= 0;
131    }
132  }
133}
Note: See TracBrowser for help on using the repository browser.