source: trunk/sources/HeuristicLab.Problems.VehicleRouting/3.4/Interfaces/IVRPProblemInstance.cs @ 8651

Last change on this file since 8651 was 8651, checked in by svonolfe, 10 years ago

Imrpoved VRP problem instance view (#1953)

File size: 2.3 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2012 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.Problems.VehicleRouting.ProblemInstances;
27
28namespace HeuristicLab.Problems.VehicleRouting.Interfaces {
29  public interface IVRPProblemInstance : IParameterizedNamedItem {
30    IVRPEvaluator SolutionEvaluator { get; set; }
31    IVRPEvaluator MoveEvaluator { get; }
32    IEnumerable<IOperator> Operators { get; }
33
34    event EventHandler EvaluationChanged;
35
36    DoubleMatrix Coordinates { get; }
37    DoubleMatrix DistanceMatrix { get; }
38    BoolValue UseDistanceMatrix { get; }
39    IntValue Vehicles { get; }
40    DoubleArray Demand { get; }
41    IntValue Cities { get; }
42
43    DoubleValue FleetUsageFactor { get; }
44    DoubleValue DistanceFactor { get; }
45
46    double[] GetCoordinates(int city);
47    double GetDemand(int city);
48    double GetDistance(int start, int end, IVRPEncoding solution);
49    double GetInsertionDistance(int start, int customer, int end, IVRPEncoding solution, out double startDistance, out double endDistance);
50    bool Feasible(IVRPEncoding solution);
51    bool TourFeasible(Tour tour, IVRPEncoding solution);
52    VRPEvaluation Evaluate(IVRPEncoding solution);
53    VRPEvaluation EvaluateTour(Tour tour, IVRPEncoding solution);
54    bool Feasible(VRPEvaluation eval);
55    double GetInsertionCosts(VRPEvaluation eval, IVRPEncoding solution, int customer, int tour, int index, out bool feasible);
56  }
57}
Note: See TracBrowser for help on using the repository browser.