1  #region License Information


2  /* HeuristicLab


3  * Copyright (C) 20022015 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 


23  namespace HeuristicLab.Problems.Instances.Types {


24  /// <summary>


25  /// Describes instances of the Orienteering Problem (OP).


26  /// </summary>


27  public class OPData : TSPData {


28  /// <summary>


29  /// The maximum distance constraint for a Orienteering solution.


30  /// </summary>


31  public double MaximumDistance { get; set; }


32  /// <summary>


33  /// The scores of the points.


34  /// </summary>


35  public double[] Scores { get; set; }


36  /// <summary>


37  /// The penalty for each visited vertex.


38  /// </summary>


39  public double PointVisitingCosts { get; set; }


40  /// <summary>


41  /// Index of the starting point


42  /// </summary>


43  public int StartingPoint { get; set; }


44  /// <summary>


45  /// Index of the ending point.


46  /// </summary>


47  public int TerminalPoint { get; set; }


48  }


49  } 
