Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HiveHiveEngine/HeuristicLab.Optimization/3.3/Interfaces/IMoveOperator.cs @ 11544

Last change on this file since 11544 was 7259, checked in by swagner, 13 years ago

Updated year of copyrights to 2012 (#1716)

File size: 3.2 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2012 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
22using HeuristicLab.Core;
23
24namespace HeuristicLab.Optimization {
25  /// <summary>
26  /// The basic interface that marks all move operators.
27  /// </summary>
28  /// <remarks>
29  /// A group of move operators that belong together should derive an interface from this one
30  /// and implement the interface in each operator.<br />
31  /// In an algorithm one can thus find out all move operators that belong together, by grouping operators
32  /// according to the most specific interface derived from this interface that they implement.<br /><br />
33  /// A concrete example:<br />
34  /// You have a solution representation <c>MyRep</c> and there you have a move <c>MyRepMove</c> that you want
35  /// to make available to the friendly GUIs. So in <c>MyRep</c> you derive an interface <c>IMyRepMoveOperator</c>.<br />
36  /// Now you need to implement at least three operators that handle these moves: A MoveGenerator, a MoveMaker, and a MoveEvaluator.
37  /// Note: The MoveEvaluator should be implemented in the problem plugin if you choose to separate representation and problem.<br />
38  /// In each of these operators you implement <c>IMyRepMoveOperator</c> as well as the appropriate operator specific interface.
39  /// For a MoveGenerator that would be one of <c>IExhaustiveMoveGenerator</c>, <c>ISingleMoveGenerator</c>,
40  /// or <c>IMultiMoveGenerator</c>, for a MoveMaker that would be <c>IMoveMaker</c>, and for a MoveEvaluator that would
41  /// either be <c>ISingleObjectiveMoveEvaluator</c> or <c>IMultiObjectiveMoveEvaluator</c>.<br />
42  /// If you have this you need to make sure that an instance of all your operators are loaded in the Operators collection of your IProblem
43  /// and you can select them in the respective algorithms.<br /><br />
44  /// For Tabu Search support you will need two additional operators: A TabuChecker (e.g. derived from <see cref="TabuChecker" />),
45  /// and a TabuMaker.<br /><br />
46  /// If you decide later that you want another move, e.g. <c>MyRepMove2</c>, you would do as before and group them under
47  /// the interface <c>IMyRepMove2Operator</c>.<br /><br />
48  /// If you want to make use of multiple different moves, all your operators would need to know about all the moves that you plan
49  /// to use.<br /><br />
50  /// Take a look at the Permutation and TSP plugin to see how this looks like in real code.
51  /// </remarks>
52  public interface IMoveOperator : IOperator {
53  }
54}
Note: See TracBrowser for help on using the repository browser.