#region License Information /* HeuristicLab * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL) * * This file is part of HeuristicLab. * * HeuristicLab is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * HeuristicLab is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with HeuristicLab. If not, see . */ #endregion using HeuristicLab.Core; using HeuristicLab.Optimization; using HeuristicLab.Problems.VehicleRouting.ProblemInstances; using HeuristicLab.Persistence; namespace HeuristicLab.Problems.VehicleRouting.Interfaces { [StorableType("15d7fb98-cc08-4b08-a901-7f17f8c66a5e")] public interface IVRPEvaluator : IVRPOperator, ISingleObjectiveEvaluator { ILookupParameter VRPToursParameter { get; } VRPEvaluation Evaluate(IVRPProblemInstance instance, IVRPEncoding solution); VRPEvaluation EvaluateTour(IVRPProblemInstance instance, Tour tour, IVRPEncoding solution); bool Feasible(VRPEvaluation evaluation); double GetInsertionCosts(IVRPProblemInstance instance, IVRPEncoding solution, VRPEvaluation eval, int customer, int tour, int index, out bool feasible); } }