1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 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 |
|
---|
22 | using System;
|
---|
23 | using System.Collections.Generic;
|
---|
24 | using HeuristicLab.Core;
|
---|
25 | using HeuristicLab.Data;
|
---|
26 | using HeuristicLab.Problems.VehicleRouting.ProblemInstances;
|
---|
27 | using HEAL.Attic;
|
---|
28 |
|
---|
29 | namespace HeuristicLab.Problems.VehicleRouting.Interfaces {
|
---|
30 | [StorableType("B8E231D0-6BA9-4DCF-9585-95E46B280B47")]
|
---|
31 | public interface IVRPProblemInstance : IParameterizedNamedItem {
|
---|
32 | IVRPEvaluator SolutionEvaluator { get; set; }
|
---|
33 | IVRPEvaluator MoveEvaluator { get; }
|
---|
34 | IEnumerable<IOperator> Operators { get; }
|
---|
35 |
|
---|
36 | event EventHandler EvaluationChanged;
|
---|
37 |
|
---|
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 |
|
---|
48 | double[] GetCoordinates(int city);
|
---|
49 | double GetDemand(int city);
|
---|
50 | double GetDistance(int start, int end, IVRPEncodedSolution solution);
|
---|
51 | double GetInsertionDistance(int start, int customer, int end, IVRPEncodedSolution solution, out double startDistance, out double endDistance);
|
---|
52 | bool Feasible(IVRPEncodedSolution solution);
|
---|
53 | bool TourFeasible(Tour tour, IVRPEncodedSolution solution);
|
---|
54 | VRPEvaluation Evaluate(IVRPEncodedSolution solution);
|
---|
55 | VRPEvaluation EvaluateTour(Tour tour, IVRPEncodedSolution solution);
|
---|
56 | bool Feasible(VRPEvaluation eval);
|
---|
57 | double GetInsertionCosts(VRPEvaluation eval, IVRPEncodedSolution solution, int customer, int tour, int index, out bool feasible);
|
---|
58 | }
|
---|
59 | }
|
---|