class_easylocal__steepestdescent.html

来自「一个tabu search算法框架」· HTML 代码 · 共 403 行 · 第 1/2 页

HTML
403 行
字号
12
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
    "http://www.w3.org/TR/html4/loose.dtd">
<html>
<head>
  <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
  <title>EasyLocal++ Documentation</title>
  <link href="local.css" rel="stylesheet" type="text/css">
</head>

<body lang="en">

<table width="100%" border="0">
  <tbody>
    <tr>
      <td colspan="2"><h1 class="nojustify">EasyLocal++ Documentation</h1>
        <hr>
      </td>
    </tr>
    <tr>
      <td width="30" align="center">&nbsp;</td>
      <td>
<!-- Generated by Doxygen 1.2.5 on Sat Jun 9 18:59:36 2001 -->
<center>
<a class="qindex" href="index.html">Main Page</a> &nbsp; <a class="qindex" href="modules.html">Modules</a> &nbsp; <a class="qindex" href="namespaces.html">Namespace List</a> &nbsp; <a class="qindex" href="hierarchy.html">Class Hierarchy</a> &nbsp; <a class="qindex" href="classes.html">Alphabetical List</a> &nbsp; <a class="qindex" href="annotated.html">Compound List</a> &nbsp; <a class="qindex" href="files.html">File List</a> &nbsp; <a class="qindex" href="namespacemembers.html">Namespace Members</a> &nbsp; <a class="qindex" href="functions.html">Compound Members</a> &nbsp; <a class="qindex" href="globals.html">File Members</a> &nbsp; <a class="qindex" href="pages.html">Related Pages</a> &nbsp; </center>
<hr><h1>easylocal::SteepestDescent  Class Template Reference</h1><code>#include &lt;<a class="el" href="EasyLocal_h-source.html">EasyLocal.h</a>&gt;</code>
<p>
Inheritance diagram for easylocal::SteepestDescent<p><center><img src="class_easylocal__SteepestDescent_inherit_graph.gif" border="0" usemap="#easylocal::SteepestDescent_inherit_map" alt="Inheritance graph"></center>
<map name="easylocal::SteepestDescent_inherit_map">
<area href="class_easylocal__MoveRunner.html" shape="rect" coords="0,67,261,85">
<area href="class_easylocal__Runner.html" shape="rect" coords="35,0,227,19">
</map>
<center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center>Collaboration diagram for easylocal::SteepestDescent:<p><center><img src="class_easylocal__SteepestDescent_coll_graph.gif" border="0" usemap="#easylocal::SteepestDescent_coll_map" alt="Collaboration graph"></center>
<map name="easylocal::SteepestDescent_coll_map">
<area href="class_easylocal__MoveRunner.html" shape="rect" coords="109,165,371,184">
<area href="class_easylocal__Runner.html" shape="rect" coords="0,82,192,101">
<area href="class_easylocal__StateManager.html" shape="rect" coords="127,0,353,18">
<area href="class_easylocal__NeighborhoodExplorer.html" shape="rect" coords="307,82,621,101">
<area href="class_easylocal__ProhibitionManager.html" shape="rect" coords="377,0,607,18">
</map>
<center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center><a href="class_easylocal__SteepestDescent-members.html">List of all members.</a><h2>Public Methods</h2>
<ul>
<li>void <a class="el" href="class_easylocal__SteepestDescent.html#a0">Print</a> (std::ostream &amp;os=std::cout) const
<li>void <a class="el" href="class_easylocal__SteepestDescent.html#a1">ReadParameters</a> ()
</ul>
<h2>Protected Methods</h2>
<ul>
<li><a class="el" href="class_easylocal__SteepestDescent.html#b0">SteepestDescent</a> (<a class="el" href="class_easylocal__StateManager.html">StateManager</a>&lt; Input, State &gt; *s, <a class="el" href="class_easylocal__NeighborhoodExplorer.html">NeighborhoodExplorer</a>&lt; Input, State, Move &gt; *ne, Input *in=NULL)
<li>void <a class="el" href="class_easylocal__SteepestDescent.html#b1">InitializeRun</a> ()
<li>void <a class="el" href="class_easylocal__SteepestDescent.html#b2">TerminateRun</a> ()
<li>bool <a class="el" href="class_easylocal__SteepestDescent.html#b3">StopCriterion</a> ()
<li>bool <a class="el" href="class_easylocal__SteepestDescent.html#b4">AcceptableMove</a> ()
<li>void <a class="el" href="class_easylocal__SteepestDescent.html#b5">SelectMove</a> ()
</ul>
<hr><a name="_details"></a><h2>Detailed Description</h2>
<h3>template&lt;class Input, class State, class Move&gt;  class easylocal::SteepestDescent</h3>

The Steepest Descent runner performs a simple local search. At each step of the search, the best move in the neighborhood of current solution is selected and performed. It is worth noticing that this algorithm leads straightly to the  nearest local minimum of a given state. 
<p>

<p>
Definition at line <a class="el" href="EasyLocal_h-source.html#l00655">655</a> of file <a class="el" href="EasyLocal_h-source.html">EasyLocal.h</a>.<hr><h2>Constructor &amp; Destructor Documentation</h2>
<a name="b0" doxytag="easylocal::SteepestDescent::SteepestDescent"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
  <tr>
    <td class="md">
      <table cellpadding="0" cellspacing="0" border="0">
        <tr>
          <td colspan="2"><b>
template&lt;class Input, class State, class Move&gt;           </b></td>
        </tr>
        <tr>
          <td nowrap valign="top"><b> 
easylocal::SteepestDescent&lt; Input, State, Move &gt;::SteepestDescent&lt;Input, State, Move&gt; (
          </b></td>
          <td valign="bottom"><b>
<a class="el" href="class_easylocal__StateManager.html">StateManager</a>&lt; Input, State &gt; * <em>s</em>, 
          </b></td>
        </tr>
        <tr>
          <td></td>
          <td><b>
<a class="el" href="class_easylocal__NeighborhoodExplorer.html">NeighborhoodExplorer</a>&lt; Input, State, Move &gt; * <em>ne</em>, 
          </b></td>
        </tr>
        <tr>
          <td></td>
          <td><b>
Input * <em>in</em> = NULL&nbsp;)<code> [protected]</code>
          </b></td>
        </tr>

      </table>
    </td>
  </tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>
Constructs a steepest descent runner by linking it to a state manager,  a neighborhood explorer, and an input object.<dl compact><dt>
<b>Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>s</em>
&nbsp;</td><td>
 a pointer to a compatible state manager </td></tr>
<tr><td valign=top><em>ne</em>
&nbsp;</td><td>
 a pointer to a compatible neighborhood explorer </td></tr>
<tr><td valign=top><em>in</em>
&nbsp;</td><td>
 a poiter to an input object </td></tr>
</table>
</dl>
<p>
Definition at line <a class="el" href="EasyLocalTemplates_cpp-source.html#l01203">1203</a> of file <a class="el" href="EasyLocalTemplates_cpp-source.html">EasyLocalTemplates.cpp</a>.    </td>
  </tr>
</table>
<hr><h2>Member Function Documentation</h2>
<a name="b4" doxytag="easylocal::SteepestDescent::AcceptableMove"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
  <tr>
    <td class="md">
      <table cellpadding="0" cellspacing="0" border="0">
        <tr>
          <td colspan="2"><b>
template&lt;class Input, class State, class Move&gt;           </b></td>
        </tr>
        <tr>
          <td nowrap valign="top"><b> 
bool easylocal::SteepestDescent&lt; Input, State, Move &gt;::AcceptableMove (
          </b></td>
          <td valign="bottom"><b>
)<code> [protected, virtual]</code>
          </b></td>
        </tr>

      </table>
    </td>
  </tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>
A move is accepted if it is an improving one. 
<p>
Reimplemented from <a class="el" href="class_easylocal__MoveRunner.html#b8">easylocal::MoveRunner</a>.
<p>
Definition at line <a class="el" href="EasyLocalTemplates_cpp-source.html#l01237">1237</a> of file <a class="el" href="EasyLocalTemplates_cpp-source.html">EasyLocalTemplates.cpp</a>.    </td>
  </tr>
</table>
<a name="b1" doxytag="easylocal::SteepestDescent::InitializeRun"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
  <tr>
    <td class="md">
      <table cellpadding="0" cellspacing="0" border="0">
        <tr>
          <td colspan="2"><b>
template&lt;class Input, class State, class Move&gt;           </b></td>
        </tr>
        <tr>
          <td nowrap valign="top"><b> 
void easylocal::SteepestDescent&lt; Input, State, Move &gt;::InitializeRun (
          </b></td>
          <td valign="bottom"><b>
)<code> [protected, virtual]</code>
          </b></td>
        </tr>

      </table>
    </td>
  </tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>
Invokes the companion superclass method, and initializes the move cost at a negative value for fulfilling the stop criterion the first time 
<p>
Reimplemented from <a class="el" href="class_easylocal__MoveRunner.html#b1">easylocal::MoveRunner</a>.
<p>
Definition at line <a class="el" href="EasyLocalTemplates_cpp-source.html#l01219">1219</a> of file <a class="el" href="EasyLocalTemplates_cpp-source.html">EasyLocalTemplates.cpp</a>.    </td>
  </tr>
</table>
<a name="a0" doxytag="easylocal::SteepestDescent::Print"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
  <tr>
    <td class="md">
      <table cellpadding="0" cellspacing="0" border="0">
        <tr>
12

class_easylocal__steepestdescent.html - 源码说明

本页面展示了「一个tabu search算法框架」中的 class_easylocal__steepestdescent.html 源码文件，采用 HTML 编程语言编写，共 403 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫开发者社区收录了大量与Tabu Search相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?