Free cookie consent management tool by TermsFeed Policy Generator

source: branches/VRP/HeuristicLab.Problems.VehicleRouting/3.4/Encodings/Potvin/Creators/IterativeInsertionCreator.cs @ 7317

Last change on this file since 7317 was 6857, checked in by svonolfe, 13 years ago

Added vehicle assignment manipulator and move for multi depot instances (#1177)

File size: 5.8 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 System;
23using System.Collections.Generic;
24using HeuristicLab.Core;
25using HeuristicLab.Data;
26using HeuristicLab.Encodings.PermutationEncoding;
27using HeuristicLab.Optimization;
28using HeuristicLab.Parameters;
29using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
30using HeuristicLab.Common;
31using HeuristicLab.Problems.VehicleRouting.Interfaces;
32using HeuristicLab.Problems.VehicleRouting.ProblemInstances;
33using HeuristicLab.Problems.VehicleRouting.Variants;
34
35namespace HeuristicLab.Problems.VehicleRouting.Encodings.Potvin {
36  [Item("IterativeInsertionCreator", "Creates a randomly initialized VRP solution.")]
37  [StorableClass]
38  public sealed class IterativeInsertionCreator : PotvinCreator, IStochasticOperator {
39    #region IStochasticOperator Members
40    public ILookupParameter<IRandom> RandomParameter {
41      get { return (LookupParameter<IRandom>)Parameters["Random"]; }
42    }
43    #endregion
44
45    public IValueParameter<BoolValue> AdhereTimeWindowsParameter {
46      get { return (IValueParameter<BoolValue>)Parameters["AdhereTimeWindows"]; }
47    }
48
49    [StorableConstructor]
50    private IterativeInsertionCreator(bool deserializing) : base(deserializing) { }
51
52    public IterativeInsertionCreator()
53      : base() {
54      Parameters.Add(new LookupParameter<IRandom>("Random", "The pseudo random number generator."));
55      Parameters.Add(new ValueParameter<BoolValue>("AdhereTimeWindows", "Specifies if the time windows should be considered during construction.", new BoolValue(true)));
56    }
57
58    public override IDeepCloneable Clone(Cloner cloner) {
59      return new IterativeInsertionCreator(this, cloner);
60    }
61
62    private IterativeInsertionCreator(IterativeInsertionCreator original, Cloner cloner)
63      : base(original, cloner) {
64    }
65
66    private static double CalculateAngleToDepot(IVRPProblemInstance instance, int city) {
67      double dx = instance.GetCoordinates(0)[0];
68      double dy = instance.GetCoordinates(0)[1];
69
70      double cx = instance.GetCoordinates(city)[0];
71      double cy = instance.GetCoordinates(city)[1];
72
73      double alpha = Math.Atan((cx - dx) / (dy - cy)) * (180.0 / Math.PI);
74      if (cx > dx && cy > dy)
75        alpha = (90.0 + alpha) + 90.0;
76      else if (cx < dx && cy > dy)
77        alpha = alpha + 180.0;
78      else if (cx < dx && cy < dy)
79        alpha = (90.0 + alpha) + 270.0;
80
81      return alpha;
82    }
83
84    private static PotvinEncoding CreateSolution(IVRPProblemInstance instance, IRandom random, bool adhereTimeWindows) {
85      PotvinEncoding result = new PotvinEncoding(instance);
86
87      IPickupAndDeliveryProblemInstance pdp = instance as IPickupAndDeliveryProblemInstance;
88
89      List<int> customers = new List<int>();
90      for (int i = 1; i <= instance.Cities.Value; i++)
91        if(pdp == null || pdp.GetDemand(i) >= 0)
92          customers.Add(i);
93
94      customers.Sort(delegate(int city1, int city2)
95          {
96            double angle1 = CalculateAngleToDepot(instance, city1);
97            double angle2 = CalculateAngleToDepot(instance, city2);
98
99            return angle1.CompareTo(angle2);
100          });
101
102      Tour currentTour = new Tour();
103      result.Tours.Add(currentTour);
104
105      int j = random.Next(customers.Count);
106      for (int i = 0; i < customers.Count; i++) {
107        int index = (i + j) % customers.Count;
108
109        int stopIdx = 0;
110        if(currentTour.Stops.Count > 0)
111          result.FindBestInsertionPlace(currentTour, customers[index]);
112        currentTour.Stops.Insert(stopIdx, customers[index]);
113
114        if (pdp != null) {
115          stopIdx = result.FindBestInsertionPlace(currentTour, pdp.GetPickupDeliveryLocation(customers[index]));
116          currentTour.Stops.Insert(stopIdx, pdp.GetPickupDeliveryLocation(customers[index]));
117        }
118
119        CVRPEvaluation evaluation = instance.EvaluateTour(currentTour, result) as CVRPEvaluation;
120        if (result.Tours.Count < instance.Vehicles.Value &&
121          ((adhereTimeWindows && !instance.Feasible(evaluation)) || ((!adhereTimeWindows) && evaluation.Overload > double.Epsilon))) {
122            currentTour.Stops.Remove(customers[index]);
123            if (pdp != null)
124              currentTour.Stops.Remove(pdp.GetPickupDeliveryLocation(customers[index]));
125
126          if (currentTour.Stops.Count == 0)
127            result.Tours.Remove(currentTour);
128          currentTour = new Tour();
129          result.Tours.Add(currentTour);
130         
131          currentTour.Stops.Add(customers[index]);
132          if (pdp != null) {
133            currentTour.Stops.Add(pdp.GetPickupDeliveryLocation(customers[index]));
134          }
135        }
136      }
137
138      if (currentTour.Stops.Count == 0)
139        result.Tours.Remove(currentTour);
140
141      return result;
142    }
143
144    public override IOperation Apply() {
145      VRPToursParameter.ActualValue = CreateSolution(ProblemInstance, RandomParameter.ActualValue, AdhereTimeWindowsParameter.Value.Value);
146
147      return base.Apply();
148    }
149  }
150}
Note: See TracBrowser for help on using the repository browser.