| 1 | using HEAL.Attic;
|
|---|
| 2 | #region License Information
|
|---|
| 3 | /* HeuristicLab
|
|---|
| 4 | * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
|---|
| 5 | *
|
|---|
| 6 | * This file is part of HeuristicLab.
|
|---|
| 7 | *
|
|---|
| 8 | * HeuristicLab is free software: you can redistribute it and/or modify
|
|---|
| 9 | * it under the terms of the GNU General Public License as published by
|
|---|
| 10 | * the Free Software Foundation, either version 3 of the License, or
|
|---|
| 11 | * (at your option) any later version.
|
|---|
| 12 | *
|
|---|
| 13 | * HeuristicLab is distributed in the hope that it will be useful,
|
|---|
| 14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|---|
| 15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|---|
| 16 | * GNU General Public License for more details.
|
|---|
| 17 | *
|
|---|
| 18 | * You should have received a copy of the GNU General Public License
|
|---|
| 19 | * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
|
|---|
| 20 | */
|
|---|
| 21 | #endregion
|
|---|
| 22 |
|
|---|
| 23 | namespace HeuristicLab.Optimization {
|
|---|
| 24 | [StorableType("365f0117-1f29-4bc2-8a76-4ee5676306a4")]
|
|---|
| 25 | /// <summary>
|
|---|
| 26 | /// This is only a marker interface to prevent operators that expect to work with a single quality value
|
|---|
| 27 | /// and/or a single maximization flag to appear in multi-objective algorithms.
|
|---|
| 28 | /// </summary>
|
|---|
| 29 | /// <remarks>
|
|---|
| 30 | /// Marker interfaces are typically not a good design, however specifying a reasonable non-empty common
|
|---|
| 31 | /// interface for all single-objective operators is difficult. There are many different variants of
|
|---|
| 32 | /// single-ojective operators with specific needs that can currently only be abstracted by an empty interface.
|
|---|
| 33 | /// In the following, please find a list of different kinds of single-objective operators.
|
|---|
| 34 | /// <list type="bullet">
|
|---|
| 35 | /// <item>
|
|---|
| 36 | /// <term>Evaluators</term>
|
|---|
| 37 | /// <description>These only need a quality parameter, but not a maximization parameter.</description>
|
|---|
| 38 | /// </item>
|
|---|
| 39 | /// <item>
|
|---|
| 40 | /// <term>Population-based operators</term>
|
|---|
| 41 | /// <description>These require the quality parameter to be a scope-tree lookup, e.g. analyzers, crossovers, single-objective replacers and selectors.</description>
|
|---|
| 42 | /// </item>
|
|---|
| 43 | /// <item>
|
|---|
| 44 | /// <term>Problem-specific operators</term>
|
|---|
| 45 | /// <description>They may perform multiple operations on a solution, evaluate and select without taking into account maximization or the evaluator, e.g. many improvement operators.</description>
|
|---|
| 46 | /// </item>
|
|---|
| 47 | /// <item>
|
|---|
| 48 | /// <term>Other single-objective operators</term>
|
|---|
| 49 | /// <description>They would need both a quality, and a maximization parameter, and may be population-based or not.</description>
|
|---|
| 50 | /// </item>
|
|---|
| 51 | /// </list>
|
|---|
| 52 | /// </remarks>
|
|---|
| 53 | public interface ISingleObjectiveOperator { }
|
|---|
| 54 | }
|
|---|
