04b12455d0
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@683 331e1502-861f-0410-8da2-ba01fb791d7f
469 lines
41 KiB
HTML
469 lines
41 KiB
HTML
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
|
|
<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
|
|
<title>ParadisEO-MOEOMovingObjects: moeoIBMOLS.h Source File</title>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css">
|
|
<link href="tabs.css" rel="stylesheet" type="text/css">
|
|
</head><body>
|
|
<!-- Generated by Doxygen 1.4.7 -->
|
|
<div class="tabs">
|
|
<ul>
|
|
<li><a href="main.html"><span>Main Page</span></a></li>
|
|
<li><a href="classes.html"><span>Classes</span></a></li>
|
|
<li id="current"><a href="files.html"><span>Files</span></a></li>
|
|
<li>
|
|
<form action="search.php" method="get">
|
|
<table cellspacing="0" cellpadding="0" border="0">
|
|
<tr>
|
|
<td><label> <u>S</u>earch for </label></td>
|
|
<td><input type="text" name="query" value="" size="20" accesskey="s"/></td>
|
|
</tr>
|
|
</table>
|
|
</form>
|
|
</li>
|
|
</ul></div>
|
|
<h1>moeoIBMOLS.h</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-</span>
|
|
<a name="l00002"></a>00002
|
|
<a name="l00003"></a>00003 <span class="comment">//-----------------------------------------------------------------------------</span>
|
|
<a name="l00004"></a>00004 <span class="comment">// moeoIBMOLS.h</span>
|
|
<a name="l00005"></a>00005 <span class="comment">// (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007</span>
|
|
<a name="l00006"></a>00006 <span class="comment">/*</span>
|
|
<a name="l00007"></a>00007 <span class="comment"> This library...</span>
|
|
<a name="l00008"></a>00008 <span class="comment"></span>
|
|
<a name="l00009"></a>00009 <span class="comment"> Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr</span>
|
|
<a name="l00010"></a>00010 <span class="comment"> */</span>
|
|
<a name="l00011"></a>00011 <span class="comment">//-----------------------------------------------------------------------------</span>
|
|
<a name="l00012"></a>00012
|
|
<a name="l00013"></a>00013 <span class="preprocessor">#ifndef MOEOIBMOLS_H_</span>
|
|
<a name="l00014"></a>00014 <span class="preprocessor"></span><span class="preprocessor">#define MOEOIBMOLS_H_</span>
|
|
<a name="l00015"></a>00015 <span class="preprocessor"></span>
|
|
<a name="l00016"></a>00016 <span class="preprocessor">#include <math.h></span>
|
|
<a name="l00017"></a>00017 <span class="preprocessor">#include <eoContinue.h></span>
|
|
<a name="l00018"></a>00018 <span class="preprocessor">#include <eoEvalFunc.h></span>
|
|
<a name="l00019"></a>00019 <span class="preprocessor">#include <eoPop.h></span>
|
|
<a name="l00020"></a>00020 <span class="preprocessor">#include <moMove.h></span>
|
|
<a name="l00021"></a>00021 <span class="preprocessor">#include <moMoveInit.h></span>
|
|
<a name="l00022"></a>00022 <span class="preprocessor">#include <moNextMove.h></span>
|
|
<a name="l00023"></a>00023 <span class="preprocessor">#include <algo/moeoLS.h></span>
|
|
<a name="l00024"></a>00024 <span class="preprocessor">#include <archive/moeoArchive.h></span>
|
|
<a name="l00025"></a>00025 <span class="preprocessor">#include <fitness/moeoBinaryIndicatorBasedFitnessAssignment.h></span>
|
|
<a name="l00026"></a>00026 <span class="preprocessor">#include <move/moeoMoveIncrEval.h></span>
|
|
<a name="l00027"></a>00027
|
|
<a name="l00032"></a>00032 <span class="keyword">template</span> < <span class="keyword">class</span> MOEOT, <span class="keyword">class</span> Move >
|
|
<a name="l00033"></a><a class="code" href="classmoeoIBMOLS.html">00033</a> <span class="keyword">class </span><a class="code" href="classmoeoIBMOLS.html">moeoIBMOLS</a> : <span class="keyword">public</span> <a class="code" href="classmoeoLS.html">moeoLS</a> < MOEOT, eoPop < MOEOT > & >
|
|
<a name="l00034"></a>00034 {
|
|
<a name="l00035"></a>00035 <span class="keyword">public</span>:
|
|
<a name="l00036"></a>00036
|
|
<a name="l00038"></a><a class="code" href="classmoeoIBMOLS.html#d3433001dcc9a6e2a967aa5d64163935">00038</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> MOEOT::ObjectiveVector <a class="code" href="classmoeoIBMOLS.html#d3433001dcc9a6e2a967aa5d64163935">ObjectiveVector</a>;
|
|
<a name="l00039"></a>00039
|
|
<a name="l00040"></a>00040
|
|
<a name="l00050"></a><a class="code" href="classmoeoIBMOLS.html#6d6a39ad3d5e4c298d450d801098e274">00050</a> <a class="code" href="classmoeoIBMOLS.html#6d6a39ad3d5e4c298d450d801098e274">moeoIBMOLS</a>(
|
|
<a name="l00051"></a>00051 moMoveInit < Move > & _moveInit,
|
|
<a name="l00052"></a>00052 moNextMove < Move > & _nextMove,
|
|
<a name="l00053"></a>00053 eoEvalFunc < MOEOT > & _eval,
|
|
<a name="l00054"></a>00054 moeoMoveIncrEval < Move > & _moveIncrEval,
|
|
<a name="l00055"></a>00055 moeoBinaryIndicatorBasedFitnessAssignment < MOEOT > & _fitnessAssignment,
|
|
<a name="l00056"></a>00056 eoContinue < MOEOT > & _continuator
|
|
<a name="l00057"></a>00057 ) :
|
|
<a name="l00058"></a>00058 <a class="code" href="classmoeoIBMOLS.html#b4b4908b893edd52d6fa24085d2a89e5">moveInit</a>(_moveInit),
|
|
<a name="l00059"></a>00059 <a class="code" href="classmoeoIBMOLS.html#8b8ebbd6eb6c82caa796160b4be2a86b">nextMove</a>(_nextMove),
|
|
<a name="l00060"></a>00060 <a class="code" href="classmoeoIBMOLS.html#e9acda4b2f61f8960109a8c6fd52551e">eval</a>(_eval),
|
|
<a name="l00061"></a>00061 <a class="code" href="classmoeoIBMOLS.html#6c38636061bd03c4be809277e2dc257a">moveIncrEval</a>(_moveIncrEval),
|
|
<a name="l00062"></a>00062 <a class="code" href="classmoeoIBMOLS.html#0c858da33922736b74d9875766cec9d7">fitnessAssignment</a> (_fitnessAssignment),
|
|
<a name="l00063"></a>00063 <a class="code" href="classmoeoIBMOLS.html#c15985c0bb5d9ba835f35d99d7c42b14">continuator</a> (_continuator)
|
|
<a name="l00064"></a>00064 {}
|
|
<a name="l00065"></a>00065
|
|
<a name="l00066"></a>00066
|
|
<a name="l00073"></a><a class="code" href="classmoeoIBMOLS.html#fd788bbc4f956dec932dba2a4d4479b6">00073</a> <span class="keywordtype">void</span> <a class="code" href="classmoeoIBMOLS.html#fd788bbc4f956dec932dba2a4d4479b6">operator() </a>(eoPop < MOEOT > & _pop, moeoArchive < MOEOT > & _arch)
|
|
<a name="l00074"></a>00074 {
|
|
<a name="l00075"></a>00075 <span class="comment">// evaluation of the objective values</span>
|
|
<a name="l00076"></a>00076 <span class="comment">/*</span>
|
|
<a name="l00077"></a>00077 <span class="comment"> for (unsigned int i=0; i<_pop.size(); i++)</span>
|
|
<a name="l00078"></a>00078 <span class="comment"> {</span>
|
|
<a name="l00079"></a>00079 <span class="comment"> eval(_pop[i]);</span>
|
|
<a name="l00080"></a>00080 <span class="comment"> }</span>
|
|
<a name="l00081"></a>00081 <span class="comment"> */</span>
|
|
<a name="l00082"></a>00082 <span class="comment">// fitness assignment for the whole population</span>
|
|
<a name="l00083"></a>00083 <a class="code" href="classmoeoIBMOLS.html#0c858da33922736b74d9875766cec9d7">fitnessAssignment</a>(_pop);
|
|
<a name="l00084"></a>00084 <span class="comment">// creation of a local archive</span>
|
|
<a name="l00085"></a>00085 moeoArchive < MOEOT > archive;
|
|
<a name="l00086"></a>00086 <span class="comment">// creation of another local archive (for the stopping criteria)</span>
|
|
<a name="l00087"></a>00087 moeoArchive < MOEOT > previousArchive;
|
|
<a name="l00088"></a>00088 <span class="comment">// update the archive with the initial population</span>
|
|
<a name="l00089"></a>00089 archive.<a class="code" href="classmoeoArchive.html#6df0acd84cab4cb53682f2e6ca850e9a">update</a>(_pop);
|
|
<a name="l00090"></a>00090 <span class="keywordflow">do</span>
|
|
<a name="l00091"></a>00091 {
|
|
<a name="l00092"></a>00092 previousArchive.<a class="code" href="classmoeoArchive.html#6df0acd84cab4cb53682f2e6ca850e9a">update</a>(archive);
|
|
<a name="l00093"></a>00093 <a class="code" href="classmoeoIBMOLS.html#fce770398602972b5d67c52638687d43">oneStep</a>(_pop);
|
|
<a name="l00094"></a>00094 archive.<a class="code" href="classmoeoArchive.html#6df0acd84cab4cb53682f2e6ca850e9a">update</a>(_pop);
|
|
<a name="l00095"></a>00095 } <span class="keywordflow">while</span> ( (! archive.<a class="code" href="classmoeoArchive.html#937088a6054ba1b50db651f50dda3a72">equals</a>(previousArchive)) && (<a class="code" href="classmoeoIBMOLS.html#c15985c0bb5d9ba835f35d99d7c42b14">continuator</a>(_arch)) );
|
|
<a name="l00096"></a>00096 _arch.<a class="code" href="classmoeoArchive.html#6df0acd84cab4cb53682f2e6ca850e9a">update</a>(archive);
|
|
<a name="l00097"></a>00097 }
|
|
<a name="l00098"></a>00098
|
|
<a name="l00099"></a>00099
|
|
<a name="l00100"></a>00100 <span class="keyword">private</span>:
|
|
<a name="l00101"></a>00101
|
|
<a name="l00103"></a><a class="code" href="classmoeoIBMOLS.html#b4b4908b893edd52d6fa24085d2a89e5">00103</a> moMoveInit < Move > & <a class="code" href="classmoeoIBMOLS.html#b4b4908b893edd52d6fa24085d2a89e5">moveInit</a>;
|
|
<a name="l00105"></a><a class="code" href="classmoeoIBMOLS.html#8b8ebbd6eb6c82caa796160b4be2a86b">00105</a> moNextMove < Move > & <a class="code" href="classmoeoIBMOLS.html#8b8ebbd6eb6c82caa796160b4be2a86b">nextMove</a>;
|
|
<a name="l00107"></a><a class="code" href="classmoeoIBMOLS.html#e9acda4b2f61f8960109a8c6fd52551e">00107</a> eoEvalFunc < MOEOT > & <a class="code" href="classmoeoIBMOLS.html#e9acda4b2f61f8960109a8c6fd52551e">eval</a>;
|
|
<a name="l00109"></a><a class="code" href="classmoeoIBMOLS.html#6c38636061bd03c4be809277e2dc257a">00109</a> moeoMoveIncrEval < Move > & <a class="code" href="classmoeoIBMOLS.html#6c38636061bd03c4be809277e2dc257a">moveIncrEval</a>;
|
|
<a name="l00111"></a><a class="code" href="classmoeoIBMOLS.html#0c858da33922736b74d9875766cec9d7">00111</a> moeoBinaryIndicatorBasedFitnessAssignment < MOEOT > & <a class="code" href="classmoeoIBMOLS.html#0c858da33922736b74d9875766cec9d7">fitnessAssignment</a>;
|
|
<a name="l00113"></a><a class="code" href="classmoeoIBMOLS.html#c15985c0bb5d9ba835f35d99d7c42b14">00113</a> eoContinue < MOEOT > & <a class="code" href="classmoeoIBMOLS.html#c15985c0bb5d9ba835f35d99d7c42b14">continuator</a>;
|
|
<a name="l00114"></a>00114
|
|
<a name="l00115"></a>00115
|
|
<a name="l00120"></a><a class="code" href="classmoeoIBMOLS.html#fce770398602972b5d67c52638687d43">00120</a> <span class="keywordtype">void</span> <a class="code" href="classmoeoIBMOLS.html#fce770398602972b5d67c52638687d43">oneStep</a> (eoPop < MOEOT > & _pop)
|
|
<a name="l00121"></a>00121 {
|
|
<a name="l00122"></a>00122 <span class="comment">// the move</span>
|
|
<a name="l00123"></a>00123 Move move;
|
|
<a name="l00124"></a>00124 <span class="comment">// the objective vector and the fitness of the current solution</span>
|
|
<a name="l00125"></a>00125 <a class="code" href="classmoeoIBMOLS.html#d3433001dcc9a6e2a967aa5d64163935">ObjectiveVector</a> x_objVec;
|
|
<a name="l00126"></a>00126 <span class="keywordtype">double</span> x_fitness;
|
|
<a name="l00127"></a>00127 <span class="comment">// the index, the objective vector and the fitness of the worst solution in the population (-1 implies that the worst is the newly created one)</span>
|
|
<a name="l00128"></a>00128 <span class="keywordtype">int</span> worst_idx;
|
|
<a name="l00129"></a>00129 <a class="code" href="classmoeoIBMOLS.html#d3433001dcc9a6e2a967aa5d64163935">ObjectiveVector</a> worst_objVec;
|
|
<a name="l00130"></a>00130 <span class="keywordtype">double</span> worst_fitness;
|
|
<a name="l00132"></a>00132 <span class="comment">// the indexes and the objective vectors of the extreme non-dominated points</span>
|
|
<a name="l00133"></a>00133 <span class="keywordtype">int</span> ext_0_idx, ext_1_idx;
|
|
<a name="l00134"></a>00134 <a class="code" href="classmoeoIBMOLS.html#d3433001dcc9a6e2a967aa5d64163935">ObjectiveVector</a> ext_0_objVec, ext_1_objVec;
|
|
<a name="l00135"></a>00135 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> ind;
|
|
<a name="l00137"></a>00137 <span class="comment">// the index of the current solution to be explored</span>
|
|
<a name="l00138"></a>00138 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=0;
|
|
<a name="l00139"></a>00139 <span class="comment">// initilization of the move for the first individual</span>
|
|
<a name="l00140"></a>00140 <a class="code" href="classmoeoIBMOLS.html#b4b4908b893edd52d6fa24085d2a89e5">moveInit</a>(move, _pop[i]);
|
|
<a name="l00141"></a>00141 <span class="keywordflow">while</span> (i<_pop.size() && <a class="code" href="classmoeoIBMOLS.html#c15985c0bb5d9ba835f35d99d7c42b14">continuator</a>(_pop))
|
|
<a name="l00142"></a>00142 {
|
|
<a name="l00143"></a>00143 <span class="comment">// x = one neigbour of pop[i]</span>
|
|
<a name="l00144"></a>00144 <span class="comment">// evaluate x in the objective space</span>
|
|
<a name="l00145"></a>00145 x_objVec = <a class="code" href="classmoeoIBMOLS.html#6c38636061bd03c4be809277e2dc257a">moveIncrEval</a>(move, _pop[i]);
|
|
<a name="l00146"></a>00146 <span class="comment">// update every fitness values to take x into account and compute the fitness of x</span>
|
|
<a name="l00147"></a>00147 x_fitness = <a class="code" href="classmoeoIBMOLS.html#0c858da33922736b74d9875766cec9d7">fitnessAssignment</a>.updateByAdding(_pop, x_objVec);
|
|
<a name="l00148"></a>00148
|
|
<a name="l00152"></a>00152 <span class="comment">// extreme solutions (min only!)</span>
|
|
<a name="l00153"></a>00153 ext_0_idx = -1;
|
|
<a name="l00154"></a>00154 ext_0_objVec = x_objVec;
|
|
<a name="l00155"></a>00155 ext_1_idx = -1;
|
|
<a name="l00156"></a>00156 ext_1_objVec = x_objVec;
|
|
<a name="l00157"></a>00157 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> k=0; k<_pop.size(); k++)
|
|
<a name="l00158"></a>00158 {
|
|
<a name="l00159"></a>00159 <span class="comment">// ext_0</span>
|
|
<a name="l00160"></a>00160 <span class="keywordflow">if</span> (_pop[k].objectiveVector()[0] < ext_0_objVec[0])
|
|
<a name="l00161"></a>00161 {
|
|
<a name="l00162"></a>00162 ext_0_idx = k;
|
|
<a name="l00163"></a>00163 ext_0_objVec = _pop[k].objectiveVector();
|
|
<a name="l00164"></a>00164 }
|
|
<a name="l00165"></a>00165 <span class="keywordflow">else</span> <span class="keywordflow">if</span> ( (_pop[k].objectiveVector()[0] == ext_0_objVec[0]) && (_pop[k].objectiveVector()[1] < ext_0_objVec[1]) )
|
|
<a name="l00166"></a>00166 {
|
|
<a name="l00167"></a>00167 ext_0_idx = k;
|
|
<a name="l00168"></a>00168 ext_0_objVec = _pop[k].objectiveVector();
|
|
<a name="l00169"></a>00169 }
|
|
<a name="l00170"></a>00170 <span class="comment">// ext_1</span>
|
|
<a name="l00171"></a>00171 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (_pop[k].objectiveVector()[1] < ext_1_objVec[1])
|
|
<a name="l00172"></a>00172 {
|
|
<a name="l00173"></a>00173 ext_1_idx = k;
|
|
<a name="l00174"></a>00174 ext_1_objVec = _pop[k].objectiveVector();
|
|
<a name="l00175"></a>00175 }
|
|
<a name="l00176"></a>00176 <span class="keywordflow">else</span> <span class="keywordflow">if</span> ( (_pop[k].objectiveVector()[1] == ext_1_objVec[1]) && (_pop[k].objectiveVector()[0] < ext_1_objVec[0]) )
|
|
<a name="l00177"></a>00177 {
|
|
<a name="l00178"></a>00178 ext_1_idx = k;
|
|
<a name="l00179"></a>00179 ext_1_objVec = _pop[k].objectiveVector();
|
|
<a name="l00180"></a>00180 }
|
|
<a name="l00181"></a>00181 }
|
|
<a name="l00182"></a>00182 <span class="comment">// worst init</span>
|
|
<a name="l00183"></a>00183 <span class="keywordflow">if</span> (ext_0_idx == -1)
|
|
<a name="l00184"></a>00184 {
|
|
<a name="l00185"></a>00185 ind = 0;
|
|
<a name="l00186"></a>00186 <span class="keywordflow">while</span> (ind == ext_1_idx)
|
|
<a name="l00187"></a>00187 {
|
|
<a name="l00188"></a>00188 ind++;
|
|
<a name="l00189"></a>00189 }
|
|
<a name="l00190"></a>00190 worst_idx = ind;
|
|
<a name="l00191"></a>00191 worst_objVec = _pop[ind].objectiveVector();
|
|
<a name="l00192"></a>00192 worst_fitness = _pop[ind].fitness();
|
|
<a name="l00193"></a>00193 }
|
|
<a name="l00194"></a>00194 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ext_1_idx == -1)
|
|
<a name="l00195"></a>00195 {
|
|
<a name="l00196"></a>00196 ind = 0;
|
|
<a name="l00197"></a>00197 <span class="keywordflow">while</span> (ind == ext_0_idx)
|
|
<a name="l00198"></a>00198 {
|
|
<a name="l00199"></a>00199 ind++;
|
|
<a name="l00200"></a>00200 }
|
|
<a name="l00201"></a>00201 worst_idx = ind;
|
|
<a name="l00202"></a>00202 worst_objVec = _pop[ind].objectiveVector();
|
|
<a name="l00203"></a>00203 worst_fitness = _pop[ind].fitness();
|
|
<a name="l00204"></a>00204 }
|
|
<a name="l00205"></a>00205 <span class="keywordflow">else</span>
|
|
<a name="l00206"></a>00206 {
|
|
<a name="l00207"></a>00207 worst_idx = -1;
|
|
<a name="l00208"></a>00208 worst_objVec = x_objVec;
|
|
<a name="l00209"></a>00209 worst_fitness = x_fitness;
|
|
<a name="l00210"></a>00210 }
|
|
<a name="l00214"></a>00214
|
|
<a name="l00215"></a>00215 <span class="comment">// who is the worst ?</span>
|
|
<a name="l00216"></a>00216 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> j=0; j<_pop.size(); j++)
|
|
<a name="l00217"></a>00217 {
|
|
<a name="l00218"></a>00218 <span class="keywordflow">if</span> ( (j!=ext_0_idx) && (j!=ext_1_idx) )
|
|
<a name="l00219"></a>00219 {
|
|
<a name="l00220"></a>00220 <span class="keywordflow">if</span> (_pop[j].fitness() < worst_fitness)
|
|
<a name="l00221"></a>00221 {
|
|
<a name="l00222"></a>00222 worst_idx = j;
|
|
<a name="l00223"></a>00223 worst_objVec = _pop[j].objectiveVector();
|
|
<a name="l00224"></a>00224 worst_fitness = _pop[j].fitness();
|
|
<a name="l00225"></a>00225 }
|
|
<a name="l00226"></a>00226 }
|
|
<a name="l00227"></a>00227 }
|
|
<a name="l00228"></a>00228 <span class="comment">// if the worst solution is the new one</span>
|
|
<a name="l00229"></a>00229 <span class="keywordflow">if</span> (worst_idx == -1)
|
|
<a name="l00230"></a>00230 {
|
|
<a name="l00231"></a>00231 <span class="comment">// if all its neighbours have been explored,</span>
|
|
<a name="l00232"></a>00232 <span class="comment">// let's explore the neighborhoud of the next individual</span>
|
|
<a name="l00233"></a>00233 <span class="keywordflow">if</span> (! <a class="code" href="classmoeoIBMOLS.html#8b8ebbd6eb6c82caa796160b4be2a86b">nextMove</a>(move, _pop[i]))
|
|
<a name="l00234"></a>00234 {
|
|
<a name="l00235"></a>00235 i++;
|
|
<a name="l00236"></a>00236 <span class="keywordflow">if</span> (i<_pop.size())
|
|
<a name="l00237"></a>00237 {
|
|
<a name="l00238"></a>00238 <span class="comment">// initilization of the move for the next individual</span>
|
|
<a name="l00239"></a>00239 <a class="code" href="classmoeoIBMOLS.html#b4b4908b893edd52d6fa24085d2a89e5">moveInit</a>(move, _pop[i]);
|
|
<a name="l00240"></a>00240 }
|
|
<a name="l00241"></a>00241 }
|
|
<a name="l00242"></a>00242 }
|
|
<a name="l00243"></a>00243 <span class="comment">// if the worst solution is located before _pop[i]</span>
|
|
<a name="l00244"></a>00244 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (worst_idx <= i)
|
|
<a name="l00245"></a>00245 {
|
|
<a name="l00246"></a>00246 <span class="comment">// the new solution takes place insteed of _pop[worst_idx]</span>
|
|
<a name="l00247"></a>00247 _pop[worst_idx] = _pop[i];
|
|
<a name="l00248"></a>00248 move(_pop[worst_idx]);
|
|
<a name="l00249"></a>00249 _pop[worst_idx].objectiveVector(x_objVec);
|
|
<a name="l00250"></a>00250 _pop[worst_idx].fitness(x_fitness);
|
|
<a name="l00251"></a>00251 <span class="comment">// let's explore the neighborhoud of the next individual</span>
|
|
<a name="l00252"></a>00252 i++;
|
|
<a name="l00253"></a>00253 <span class="keywordflow">if</span> (i<_pop.size())
|
|
<a name="l00254"></a>00254 {
|
|
<a name="l00255"></a>00255 <span class="comment">// initilization of the move for the next individual</span>
|
|
<a name="l00256"></a>00256 <a class="code" href="classmoeoIBMOLS.html#b4b4908b893edd52d6fa24085d2a89e5">moveInit</a>(move, _pop[i]);
|
|
<a name="l00257"></a>00257 }
|
|
<a name="l00258"></a>00258 }
|
|
<a name="l00259"></a>00259 <span class="comment">// if the worst solution is located after _pop[i]</span>
|
|
<a name="l00260"></a>00260 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (worst_idx > i)
|
|
<a name="l00261"></a>00261 {
|
|
<a name="l00262"></a>00262 <span class="comment">// the new solution takes place insteed of _pop[i+1] and _pop[worst_idx] is deleted</span>
|
|
<a name="l00263"></a>00263 _pop[worst_idx] = _pop[i+1];
|
|
<a name="l00264"></a>00264 _pop[i+1] = _pop[i];
|
|
<a name="l00265"></a>00265 move(_pop[i+1]);
|
|
<a name="l00266"></a>00266 _pop[i+1].objectiveVector(x_objVec);
|
|
<a name="l00267"></a>00267 _pop[i+1].fitness(x_fitness);
|
|
<a name="l00268"></a>00268 <span class="comment">// let's explore the neighborhoud of the individual _pop[i+2]</span>
|
|
<a name="l00269"></a>00269 i += 2;
|
|
<a name="l00270"></a>00270 <span class="keywordflow">if</span> (i<_pop.size())
|
|
<a name="l00271"></a>00271 {
|
|
<a name="l00272"></a>00272 <span class="comment">// initilization of the move for the next individual</span>
|
|
<a name="l00273"></a>00273 <a class="code" href="classmoeoIBMOLS.html#b4b4908b893edd52d6fa24085d2a89e5">moveInit</a>(move, _pop[i]);
|
|
<a name="l00274"></a>00274 }
|
|
<a name="l00275"></a>00275 }
|
|
<a name="l00276"></a>00276 <span class="comment">// update fitness values</span>
|
|
<a name="l00277"></a>00277 <a class="code" href="classmoeoIBMOLS.html#0c858da33922736b74d9875766cec9d7">fitnessAssignment</a>.updateByDeleting(_pop, worst_objVec);
|
|
<a name="l00278"></a>00278 }
|
|
<a name="l00279"></a>00279 }
|
|
<a name="l00280"></a>00280
|
|
<a name="l00281"></a>00281
|
|
<a name="l00282"></a>00282
|
|
<a name="l00283"></a>00283
|
|
<a name="l00284"></a>00284
|
|
<a name="l00285"></a>00285
|
|
<a name="l00286"></a>00286
|
|
<a name="l00287"></a>00287
|
|
<a name="l00288"></a>00288
|
|
<a name="l00289"></a>00289
|
|
<a name="l00290"></a>00290
|
|
<a name="l00291"></a>00291
|
|
<a name="l00292"></a>00292
|
|
<a name="l00293"></a>00293 <span class="comment">// INUTILE !!!!</span>
|
|
<a name="l00294"></a>00294
|
|
<a name="l00295"></a>00295
|
|
<a name="l00296"></a>00296
|
|
<a name="l00297"></a>00297
|
|
<a name="l00298"></a>00298
|
|
<a name="l00299"></a>00299
|
|
<a name="l00304"></a><a class="code" href="classmoeoIBMOLS.html#9d811733d8e7508a7c48615c8ff0f990">00304</a> <span class="keywordtype">void</span> <a class="code" href="classmoeoIBMOLS.html#9d811733d8e7508a7c48615c8ff0f990">new_oneStep</a> (eoPop < MOEOT > & _pop)
|
|
<a name="l00305"></a>00305 {
|
|
<a name="l00306"></a>00306 <span class="comment">// the move</span>
|
|
<a name="l00307"></a>00307 Move move;
|
|
<a name="l00308"></a>00308 <span class="comment">// the objective vector and the fitness of the current solution</span>
|
|
<a name="l00309"></a>00309 <a class="code" href="classmoeoIBMOLS.html#d3433001dcc9a6e2a967aa5d64163935">ObjectiveVector</a> x_objVec;
|
|
<a name="l00310"></a>00310 <span class="keywordtype">double</span> x_fitness;
|
|
<a name="l00311"></a>00311 <span class="comment">// the index, the objective vector and the fitness of the worst solution in the population (-1 implies that the worst is the newly created one)</span>
|
|
<a name="l00312"></a>00312 <span class="keywordtype">int</span> worst_idx;
|
|
<a name="l00313"></a>00313 <a class="code" href="classmoeoIBMOLS.html#d3433001dcc9a6e2a967aa5d64163935">ObjectiveVector</a> worst_objVec;
|
|
<a name="l00314"></a>00314 <span class="keywordtype">double</span> worst_fitness;
|
|
<a name="l00316"></a>00316 <span class="comment">// the index of the extreme non-dominated points</span>
|
|
<a name="l00317"></a>00317 <span class="keywordtype">int</span> ext_0_idx, ext_1_idx;
|
|
<a name="l00318"></a>00318 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> ind;
|
|
<a name="l00320"></a>00320 <span class="comment">// the index current of the current solution to be explored</span>
|
|
<a name="l00321"></a>00321 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=0;
|
|
<a name="l00322"></a>00322 <span class="comment">// initilization of the move for the first individual</span>
|
|
<a name="l00323"></a>00323 <a class="code" href="classmoeoIBMOLS.html#b4b4908b893edd52d6fa24085d2a89e5">moveInit</a>(move, _pop[i]);
|
|
<a name="l00324"></a>00324 <span class="keywordflow">while</span> (i<_pop.size() && <a class="code" href="classmoeoIBMOLS.html#c15985c0bb5d9ba835f35d99d7c42b14">continuator</a>(_pop))
|
|
<a name="l00325"></a>00325 {
|
|
<a name="l00326"></a>00326 <span class="comment">// x = one neigbour of pop[i]</span>
|
|
<a name="l00327"></a>00327 <span class="comment">// evaluate x in the objective space</span>
|
|
<a name="l00328"></a>00328 x_objVec = <a class="code" href="classmoeoIBMOLS.html#6c38636061bd03c4be809277e2dc257a">moveIncrEval</a>(move, _pop[i]);
|
|
<a name="l00329"></a>00329 <span class="comment">// update every fitness values to take x into account and compute the fitness of x</span>
|
|
<a name="l00330"></a>00330 x_fitness = <a class="code" href="classmoeoIBMOLS.html#0c858da33922736b74d9875766cec9d7">fitnessAssignment</a>.updateByAdding(_pop, x_objVec);
|
|
<a name="l00331"></a>00331
|
|
<a name="l00335"></a>00335 <span class="comment">// extremes solutions</span>
|
|
<a name="l00336"></a>00336 <a class="code" href="classmoeoIBMOLS_1_1OneObjectiveComparator.html">OneObjectiveComparator</a> comp0(0);
|
|
<a name="l00337"></a>00337 ext_0_idx = std::min_element(_pop.begin(), _pop.end(), comp0) - _pop.begin();
|
|
<a name="l00338"></a>00338 <a class="code" href="classmoeoIBMOLS_1_1OneObjectiveComparator.html">OneObjectiveComparator</a> comp1(1);
|
|
<a name="l00339"></a>00339 ext_1_idx = std::min_element(_pop.begin(), _pop.end(), comp1) - _pop.begin();
|
|
<a name="l00340"></a>00340 <span class="comment">// new = extreme ?</span>
|
|
<a name="l00341"></a>00341 <span class="keywordflow">if</span> (x_objVec[0] < _pop[ext_0_idx].objectiveVector()[0])
|
|
<a name="l00342"></a>00342 {
|
|
<a name="l00343"></a>00343 ext_0_idx = -1;
|
|
<a name="l00344"></a>00344 }
|
|
<a name="l00345"></a>00345 <span class="keywordflow">else</span> <span class="keywordflow">if</span> ( (x_objVec[0] == _pop[ext_0_idx].objectiveVector()[0]) && (x_objVec[1] < _pop[ext_0_idx].objectiveVector()[1]) )
|
|
<a name="l00346"></a>00346 {
|
|
<a name="l00347"></a>00347 ext_0_idx = -1;
|
|
<a name="l00348"></a>00348 }
|
|
<a name="l00349"></a>00349 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (x_objVec[1] < _pop[ext_1_idx].objectiveVector()[1])
|
|
<a name="l00350"></a>00350 {
|
|
<a name="l00351"></a>00351 ext_1_idx = -1;
|
|
<a name="l00352"></a>00352 }
|
|
<a name="l00353"></a>00353 <span class="keywordflow">else</span> <span class="keywordflow">if</span> ( (x_objVec[1] == _pop[ext_1_idx].objectiveVector()[1]) && (x_objVec[0] < _pop[ext_1_idx].objectiveVector()[0]) )
|
|
<a name="l00354"></a>00354 {
|
|
<a name="l00355"></a>00355 ext_1_idx = -1;
|
|
<a name="l00356"></a>00356 }
|
|
<a name="l00357"></a>00357 <span class="comment">// worst init</span>
|
|
<a name="l00358"></a>00358 <span class="keywordflow">if</span> (ext_0_idx == -1)
|
|
<a name="l00359"></a>00359 {
|
|
<a name="l00360"></a>00360 ind = 0;
|
|
<a name="l00361"></a>00361 <span class="keywordflow">while</span> (ind == ext_1_idx)
|
|
<a name="l00362"></a>00362 {
|
|
<a name="l00363"></a>00363 ind++;
|
|
<a name="l00364"></a>00364 }
|
|
<a name="l00365"></a>00365 worst_idx = ind;
|
|
<a name="l00366"></a>00366 worst_objVec = _pop[ind].objectiveVector();
|
|
<a name="l00367"></a>00367 worst_fitness = _pop[ind].fitness();
|
|
<a name="l00368"></a>00368 }
|
|
<a name="l00369"></a>00369 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ext_1_idx == -1)
|
|
<a name="l00370"></a>00370 {
|
|
<a name="l00371"></a>00371 ind = 0;
|
|
<a name="l00372"></a>00372 <span class="keywordflow">while</span> (ind == ext_0_idx)
|
|
<a name="l00373"></a>00373 {
|
|
<a name="l00374"></a>00374 ind++;
|
|
<a name="l00375"></a>00375 }
|
|
<a name="l00376"></a>00376 worst_idx = ind;
|
|
<a name="l00377"></a>00377 worst_objVec = _pop[ind].objectiveVector();
|
|
<a name="l00378"></a>00378 worst_fitness = _pop[ind].fitness();
|
|
<a name="l00379"></a>00379 }
|
|
<a name="l00380"></a>00380 <span class="keywordflow">else</span>
|
|
<a name="l00381"></a>00381 {
|
|
<a name="l00382"></a>00382 worst_idx = -1;
|
|
<a name="l00383"></a>00383 worst_objVec = x_objVec;
|
|
<a name="l00384"></a>00384 worst_fitness = x_fitness;
|
|
<a name="l00385"></a>00385 }
|
|
<a name="l00389"></a>00389
|
|
<a name="l00390"></a>00390 <span class="comment">// who is the worst ?</span>
|
|
<a name="l00391"></a>00391 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> j=0; j<_pop.size(); j++)
|
|
<a name="l00392"></a>00392 {
|
|
<a name="l00393"></a>00393 <span class="keywordflow">if</span> ( (j!=ext_0_idx) && (j!=ext_1_idx) )
|
|
<a name="l00394"></a>00394 {
|
|
<a name="l00395"></a>00395 <span class="keywordflow">if</span> (_pop[j].fitness() < worst_fitness)
|
|
<a name="l00396"></a>00396 {
|
|
<a name="l00397"></a>00397 worst_idx = j;
|
|
<a name="l00398"></a>00398 worst_objVec = _pop[j].objectiveVector();
|
|
<a name="l00399"></a>00399 worst_fitness = _pop[j].fitness();
|
|
<a name="l00400"></a>00400 }
|
|
<a name="l00401"></a>00401 }
|
|
<a name="l00402"></a>00402 }
|
|
<a name="l00403"></a>00403 <span class="comment">// if the worst solution is the new one</span>
|
|
<a name="l00404"></a>00404 <span class="keywordflow">if</span> (worst_idx == -1)
|
|
<a name="l00405"></a>00405 {
|
|
<a name="l00406"></a>00406 <span class="comment">// if all its neighbours have been explored,</span>
|
|
<a name="l00407"></a>00407 <span class="comment">// let's explore the neighborhoud of the next individual</span>
|
|
<a name="l00408"></a>00408 <span class="keywordflow">if</span> (! <a class="code" href="classmoeoIBMOLS.html#8b8ebbd6eb6c82caa796160b4be2a86b">nextMove</a>(move, _pop[i]))
|
|
<a name="l00409"></a>00409 {
|
|
<a name="l00410"></a>00410 i++;
|
|
<a name="l00411"></a>00411 <span class="keywordflow">if</span> (i<_pop.size())
|
|
<a name="l00412"></a>00412 {
|
|
<a name="l00413"></a>00413 <span class="comment">// initilization of the move for the next individual</span>
|
|
<a name="l00414"></a>00414 <a class="code" href="classmoeoIBMOLS.html#b4b4908b893edd52d6fa24085d2a89e5">moveInit</a>(move, _pop[i]);
|
|
<a name="l00415"></a>00415 }
|
|
<a name="l00416"></a>00416 }
|
|
<a name="l00417"></a>00417 }
|
|
<a name="l00418"></a>00418 <span class="comment">// if the worst solution is located before _pop[i]</span>
|
|
<a name="l00419"></a>00419 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (worst_idx <= i)
|
|
<a name="l00420"></a>00420 {
|
|
<a name="l00421"></a>00421 <span class="comment">// the new solution takes place insteed of _pop[worst_idx]</span>
|
|
<a name="l00422"></a>00422 _pop[worst_idx] = _pop[i];
|
|
<a name="l00423"></a>00423 move(_pop[worst_idx]);
|
|
<a name="l00424"></a>00424 _pop[worst_idx].objectiveVector(x_objVec);
|
|
<a name="l00425"></a>00425 _pop[worst_idx].fitness(x_fitness);
|
|
<a name="l00426"></a>00426 <span class="comment">// let's explore the neighborhoud of the next individual</span>
|
|
<a name="l00427"></a>00427 i++;
|
|
<a name="l00428"></a>00428 <span class="keywordflow">if</span> (i<_pop.size())
|
|
<a name="l00429"></a>00429 {
|
|
<a name="l00430"></a>00430 <span class="comment">// initilization of the move for the next individual</span>
|
|
<a name="l00431"></a>00431 <a class="code" href="classmoeoIBMOLS.html#b4b4908b893edd52d6fa24085d2a89e5">moveInit</a>(move, _pop[i]);
|
|
<a name="l00432"></a>00432 }
|
|
<a name="l00433"></a>00433 }
|
|
<a name="l00434"></a>00434 <span class="comment">// if the worst solution is located after _pop[i]</span>
|
|
<a name="l00435"></a>00435 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (worst_idx > i)
|
|
<a name="l00436"></a>00436 {
|
|
<a name="l00437"></a>00437 <span class="comment">// the new solution takes place insteed of _pop[i+1] and _pop[worst_idx] is deleted</span>
|
|
<a name="l00438"></a>00438 _pop[worst_idx] = _pop[i+1];
|
|
<a name="l00439"></a>00439 _pop[i+1] = _pop[i];
|
|
<a name="l00440"></a>00440 move(_pop[i+1]);
|
|
<a name="l00441"></a>00441 _pop[i+1].objectiveVector(x_objVec);
|
|
<a name="l00442"></a>00442 _pop[i+1].fitness(x_fitness);
|
|
<a name="l00443"></a>00443 <span class="comment">// let's explore the neighborhoud of the individual _pop[i+2]</span>
|
|
<a name="l00444"></a>00444 i += 2;
|
|
<a name="l00445"></a>00445 <span class="keywordflow">if</span> (i<_pop.size())
|
|
<a name="l00446"></a>00446 {
|
|
<a name="l00447"></a>00447 <span class="comment">// initilization of the move for the next individual</span>
|
|
<a name="l00448"></a>00448 <a class="code" href="classmoeoIBMOLS.html#b4b4908b893edd52d6fa24085d2a89e5">moveInit</a>(move, _pop[i]);
|
|
<a name="l00449"></a>00449 }
|
|
<a name="l00450"></a>00450 }
|
|
<a name="l00451"></a>00451 <span class="comment">// update fitness values</span>
|
|
<a name="l00452"></a>00452 <a class="code" href="classmoeoIBMOLS.html#0c858da33922736b74d9875766cec9d7">fitnessAssignment</a>.updateByDeleting(_pop, worst_objVec);
|
|
<a name="l00453"></a>00453 }
|
|
<a name="l00454"></a>00454 }
|
|
<a name="l00455"></a>00455
|
|
<a name="l00456"></a>00456
|
|
<a name="l00457"></a>00457
|
|
<a name="l00458"></a>00458
|
|
<a name="l00459"></a>00459
|
|
<a name="l00460"></a>00460
|
|
<a name="l00462"></a><a class="code" href="classmoeoIBMOLS_1_1OneObjectiveComparator.html">00462</a> <span class="keyword">class </span><a class="code" href="classmoeoIBMOLS_1_1OneObjectiveComparator.html">OneObjectiveComparator</a> : <span class="keyword">public</span> <a class="code" href="classmoeoComparator.html">moeoComparator</a> < MOEOT >
|
|
<a name="l00463"></a>00463 {
|
|
<a name="l00464"></a>00464 <span class="keyword">public</span>:
|
|
<a name="l00465"></a><a class="code" href="classmoeoIBMOLS_1_1OneObjectiveComparator.html#09ee419d143aa29bb05d48c358655bb1">00465</a> <a class="code" href="classmoeoIBMOLS_1_1OneObjectiveComparator.html#09ee419d143aa29bb05d48c358655bb1">OneObjectiveComparator</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> _obj) : <a class="code" href="classmoeoIBMOLS_1_1OneObjectiveComparator.html#724ca0379e42fdffe4ec0d788cd52f43">obj</a>(_obj)
|
|
<a name="l00466"></a>00466 {
|
|
<a name="l00467"></a>00467 <span class="keywordflow">if</span> (<a class="code" href="classmoeoIBMOLS_1_1OneObjectiveComparator.html#724ca0379e42fdffe4ec0d788cd52f43">obj</a> > MOEOT::ObjectiveVector::nObjectives())
|
|
<a name="l00468"></a>00468 {
|
|
<a name="l00469"></a>00469 <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">"Problem with the index of objective in OneObjectiveComparator"</span>);
|
|
<a name="l00470"></a>00470 }
|
|
<a name="l00471"></a>00471 }
|
|
<a name="l00472"></a><a class="code" href="classmoeoIBMOLS_1_1OneObjectiveComparator.html#44685d0ab08fede366bb404fe7f36302">00472</a> <span class="keyword">const</span> <span class="keywordtype">bool</span> <a class="code" href="classmoeoIBMOLS_1_1OneObjectiveComparator.html#44685d0ab08fede366bb404fe7f36302">operator()</a>(<span class="keyword">const</span> MOEOT & _moeo1, <span class="keyword">const</span> MOEOT & _moeo2)
|
|
<a name="l00473"></a>00473 {
|
|
<a name="l00474"></a>00474 <span class="keywordflow">if</span> (_moeo1.objectiveVector()[<a class="code" href="classmoeoIBMOLS_1_1OneObjectiveComparator.html#724ca0379e42fdffe4ec0d788cd52f43">obj</a>] < _moeo2.objectiveVector()[<a class="code" href="classmoeoIBMOLS_1_1OneObjectiveComparator.html#724ca0379e42fdffe4ec0d788cd52f43">obj</a>])
|
|
<a name="l00475"></a>00475 {
|
|
<a name="l00476"></a>00476 <span class="keywordflow">return</span> <span class="keyword">true</span>;
|
|
<a name="l00477"></a>00477 }
|
|
<a name="l00478"></a>00478 <span class="keywordflow">else</span>
|
|
<a name="l00479"></a>00479 {
|
|
<a name="l00480"></a>00480 <span class="keywordflow">return</span> (_moeo1.objectiveVector()[<a class="code" href="classmoeoIBMOLS_1_1OneObjectiveComparator.html#724ca0379e42fdffe4ec0d788cd52f43">obj</a>] == _moeo2.objectiveVector()[<a class="code" href="classmoeoIBMOLS_1_1OneObjectiveComparator.html#724ca0379e42fdffe4ec0d788cd52f43">obj</a>]) && (_moeo1.objectiveVector()[(<a class="code" href="classmoeoIBMOLS_1_1OneObjectiveComparator.html#724ca0379e42fdffe4ec0d788cd52f43">obj</a>+1)%2] < _moeo2.objectiveVector()[(<a class="code" href="classmoeoIBMOLS_1_1OneObjectiveComparator.html#724ca0379e42fdffe4ec0d788cd52f43">obj</a>+1)%2]);
|
|
<a name="l00481"></a>00481 }
|
|
<a name="l00482"></a>00482 }
|
|
<a name="l00483"></a>00483 <span class="keyword">private</span>:
|
|
<a name="l00484"></a><a class="code" href="classmoeoIBMOLS_1_1OneObjectiveComparator.html#724ca0379e42fdffe4ec0d788cd52f43">00484</a> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="classmoeoIBMOLS_1_1OneObjectiveComparator.html#724ca0379e42fdffe4ec0d788cd52f43">obj</a>;
|
|
<a name="l00485"></a>00485 };
|
|
<a name="l00487"></a>00487
|
|
<a name="l00488"></a>00488
|
|
<a name="l00489"></a>00489
|
|
<a name="l00490"></a>00490
|
|
<a name="l00491"></a>00491 };
|
|
<a name="l00492"></a>00492
|
|
<a name="l00493"></a>00493 <span class="preprocessor">#endif </span><span class="comment">/*MOEOIBMOLS_H_*/</span>
|
|
</pre></div><hr size="1"><address style="align: right;"><small>Generated on Mon Oct 8 10:35:51 2007 for ParadisEO-MOEOMovingObjects by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.4.7 </small></address>
|
|
</body>
|
|
</html>
|