Free cookie consent management tool by TermsFeed Policy Generator

source: branches/2865-Tourplanning/HeuristicLab.Problems.VehicleRouting.Views/3.4/SingleDepotVRPView.cs @ 15529

Last change on this file since 15529 was 14185, checked in by swagner, 8 years ago

#2526: Updated year of copyrights in license headers

File size: 5.1 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2016 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 System.ComponentModel;
25using System.Data;
26using System.Drawing;
27using System.Text;
28using System.Windows.Forms;
29using HeuristicLab.MainForm;
30using HeuristicLab.Problems.VehicleRouting.ProblemInstances;
31using HeuristicLab.Data;
32
33namespace HeuristicLab.Problems.VehicleRouting.Views {
34  [View("SingleDepotVRPProblemInstance View")]
35  [Content(typeof(SingleDepotVRPProblemInstance), true)]
36  public partial class SingleDepotVRPView : VRPProblemInstanceView {
37    public new SingleDepotVRPProblemInstance Content {
38      get { return (SingleDepotVRPProblemInstance)base.Content; }
39      set { base.Content = value; }
40    }
41
42    public SingleDepotVRPView() {
43      InitializeComponent();
44    }
45
46    protected override void DrawVisualization(Bitmap bitmap) {
47      DoubleMatrix coordinates = Content.Coordinates;
48      DoubleMatrix distanceMatrix = Content.DistanceMatrix;
49      BoolValue useDistanceMatrix = Content.UseDistanceMatrix;
50
51      if ((coordinates != null) && (coordinates.Rows > 0) && (coordinates.Columns == 2)) {
52        double xMin = double.MaxValue, yMin = double.MaxValue, xMax = double.MinValue, yMax = double.MinValue;
53        for (int i = 0; i < coordinates.Rows; i++) {
54          if (xMin > coordinates[i, 0]) xMin = coordinates[i, 0];
55          if (yMin > coordinates[i, 1]) yMin = coordinates[i, 1];
56          if (xMax < coordinates[i, 0]) xMax = coordinates[i, 0];
57          if (yMax < coordinates[i, 1]) yMax = coordinates[i, 1];
58        }
59
60        int border = 20;
61        double xStep = xMax != xMin ? (bitmap.Width - 2 * border) / (xMax - xMin) : 1;
62        double yStep = yMax != yMin ? (bitmap.Height - 2 * border) / (yMax - yMin) : 1;
63
64        using (Graphics graphics = Graphics.FromImage(bitmap)) {
65          if (Solution != null) {
66             List<Tour> tours = Solution.GetTours();
67             List<Pen> pens = GetColors(tours.Count);
68
69            int currentTour = 0;
70            foreach (Tour tour in tours) {
71              Point[] tourPoints = new Point[tour.Stops.Count + 2];
72              Brush[] customerBrushes = new Brush[tour.Stops.Count];
73              int lastCustomer = 0;
74
75              for (int i = -1; i <= tour.Stops.Count; i++) {
76                int location = 0;
77
78                if (i == -1 || i == tour.Stops.Count)
79                  location = 0; //depot
80                else
81                  location = tour.Stops[i];
82
83                Point locationPoint = new Point(border + ((int)((coordinates[location, 0] - xMin) * xStep)),
84                                bitmap.Height - (border + ((int)((coordinates[location, 1] - yMin) * yStep))));
85                tourPoints[i + 1] = locationPoint;
86
87                if (i != -1 && i != tour.Stops.Count) {
88                  Brush customerBrush = Brushes.Black;
89                  customerBrushes[i] = customerBrush;
90                }
91                lastCustomer = location;
92              }
93
94              graphics.DrawPolygon(pens[currentTour], tourPoints);
95
96              for (int i = 0; i < tour.Stops.Count; i++) {
97                graphics.FillRectangle(customerBrushes[i], tourPoints[i + 1].X - 3, tourPoints[i + 1].Y - 3, 6, 6);
98              }
99
100              graphics.FillEllipse(Brushes.Blue, tourPoints[0].X - 5, tourPoints[0].Y - 5, 10, 10);
101
102              currentTour++;
103            }
104
105            for (int i = 0; i < pens.Count; i++)
106               pens[i].Dispose();
107          } else {
108            Point locationPoint;
109            //just draw customers
110            for (int i = 1; i < coordinates.Rows; i++) {
111              locationPoint = new Point(border + ((int)((coordinates[i, 0] - xMin) * xStep)),
112                              bitmap.Height - (border + ((int)((coordinates[i, 1] - yMin) * yStep))));
113
114              graphics.FillRectangle(Brushes.Black, locationPoint.X - 3, locationPoint.Y - 3, 6, 6);
115            }
116
117            locationPoint = new Point(border + ((int)((coordinates[0, 0] - xMin) * xStep)),
118                              bitmap.Height - (border + ((int)((coordinates[0, 1] - yMin) * yStep))));
119            graphics.FillEllipse(Brushes.Blue, locationPoint.X - 5, locationPoint.Y - 5, 10, 10);
120          }
121        }
122      }
123    }
124  }
125}
Note: See TracBrowser for help on using the repository browser.