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