Free cookie consent management tool by TermsFeed Policy Generator

source: branches/PersistenceReintegration/HeuristicLab.Problems.VehicleRouting/3.4/Interfaces/IVRPProblemInstance.cs @ 15289

Last change on this file since 15289 was 14929, checked in by gkronber, 8 years ago

#2520 fixed unit tests for new persistence: loading & storing all samples

File size: 2.4 KB
RevLine 
[4362]1#region License Information
2/* HeuristicLab
[14185]3 * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
[4362]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;
[6607]26using HeuristicLab.Problems.VehicleRouting.ProblemInstances;
[14929]27using HeuristicLab.Persistence;
[4362]28
29namespace HeuristicLab.Problems.VehicleRouting.Interfaces {
[14929]30  [StorableType("4e582bac-b8b2-4f8b-b84c-839c50790188")]
[8651]31  public interface IVRPProblemInstance : IParameterizedNamedItem {
[8006]32    IVRPEvaluator SolutionEvaluator { get; set; }
[5867]33    IVRPEvaluator MoveEvaluator { get; }
[4362]34    IEnumerable<IOperator> Operators { get; }
35
[7852]36    event EventHandler EvaluationChanged;
37
[4362]38    DoubleMatrix Coordinates { get; }
39    DoubleMatrix DistanceMatrix { get; }
40    BoolValue UseDistanceMatrix { get; }
41    IntValue Vehicles { get; }
42    DoubleArray Demand { get; }
43    IntValue Cities { get; }
44
45    DoubleValue FleetUsageFactor { get; }
46    DoubleValue DistanceFactor { get; }
47
[6851]48    double[] GetCoordinates(int city);
49    double GetDemand(int city);
50    double GetDistance(int start, int end, IVRPEncoding solution);
[6854]51    double GetInsertionDistance(int start, int customer, int end, IVRPEncoding solution, out double startDistance, out double endDistance);
[4362]52    bool Feasible(IVRPEncoding solution);
[6838]53    bool TourFeasible(Tour tour, IVRPEncoding solution);
[6607]54    VRPEvaluation Evaluate(IVRPEncoding solution);
[6838]55    VRPEvaluation EvaluateTour(Tour tour, IVRPEncoding solution);
[6607]56    bool Feasible(VRPEvaluation eval);
[6851]57    double GetInsertionCosts(VRPEvaluation eval, IVRPEncoding solution, int customer, int tour, int index, out bool feasible);
[4362]58  }
59}
Note: See TracBrowser for help on using the repository browser.