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  IVRPEvaluator SolutionEvaluator { get; set; }


34  IVRPEvaluator MoveEvaluator { get; }


35  IEnumerable<IOperator> Operators { get; }


36 


37  event EventHandler EvaluationChanged;


38 


39  DoubleMatrix Coordinates { get; }


40  DoubleMatrix DistanceMatrix { get; }


41  BoolValue UseDistanceMatrix { get; }


42  IntValue Vehicles { get; }


43  DoubleArray Demand { get; }


44  IntValue Cities { get; }


45 


46  DoubleValue FleetUsageFactor { get; }


47  DoubleValue DistanceFactor { get; }


48 


49  double[] GetCoordinates(int city);


50  double GetDemand(int city);


51  double GetDistance(int start, int end, IVRPEncoding solution);


52  double GetInsertionDistance(int start, int customer, int end, IVRPEncoding solution, out double startDistance, out double endDistance);


53  bool Feasible(IVRPEncoding solution);


54  bool TourFeasible(Tour tour, IVRPEncoding solution);


55  VRPEvaluation Evaluate(IVRPEncoding solution);


56  VRPEvaluation EvaluateTour(Tour tour, IVRPEncoding solution);


57  bool Feasible(VRPEvaluation eval);


58  double GetInsertionCosts(VRPEvaluation eval, IVRPEncoding solution, int customer, int tour, int index, out bool feasible);


59  }


60  }

