1  #region License Information


2  /* HeuristicLab


3  * Copyright (C) 20022010 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 System.Linq;


25  using System.Text;


26  using HeuristicLab.Optimization;


27  using HeuristicLab.Core;


28  using HeuristicLab.Data;


29  using HeuristicLab.Problems.VehicleRouting.ProblemInstances;


30 


31  namespace HeuristicLab.Problems.VehicleRouting.Interfaces {


32  public interface IVRPProblemInstance: IItem {


33  IValueParameter<IVRPEvaluator> EvaluatorParameter { get; }


34  IVRPEvaluator MoveEvaluator { get; }


35  IValueParameter<IVRPCreator> SolutionCreatorParameter { get; }


36  IValueParameter<DoubleValue> BestKnownQualityParameter { get; }


37  IValueParameter<VRPSolution> BestKnownSolutionParameter { get; }


38  IEnumerable<IOperator> Operators { get; }


39 


40  DoubleMatrix Coordinates { get; }


41  DoubleMatrix DistanceMatrix { get; }


42  BoolValue UseDistanceMatrix { get; }


43  IntValue Vehicles { get; }


44  DoubleArray Demand { get; }


45  IntValue Cities { get; }


46 


47  DoubleValue FleetUsageFactor { get; }


48  DoubleValue DistanceFactor { get; }


49 


50  double GetDistance(int start, int end);


51  bool Feasible(IVRPEncoding solution);


52  bool Feasible(Tour tour);


53  VRPEvaluation Evaluate(IVRPEncoding solution);


54  VRPEvaluation Evaluate(Tour tour);


55  bool Feasible(VRPEvaluation eval);


56  double GetInsertionCosts(VRPEvaluation eval, int customer, int tour, int index, out bool feasible);


57  }


58  }

