320c6b06ff
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@497 331e1502-861f-0410-8da2-ba01fb791d7f
139 lines
12 KiB
HTML
139 lines
12 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-MOEO: moeoFrontByFrontCrowdingDiversityAssignment.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>moeoFrontByFrontCrowdingDiversityAssignment.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">// moeoFrontByFrontCrowdingDiversityAssignment.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 MOEOFRONTBYFRONTCROWDINGDIVERSITYASSIGNMENT_H_</span>
|
|
<a name="l00014"></a>00014 <span class="preprocessor"></span><span class="preprocessor">#define MOEOFRONTBYFRONTCROWDINGDIVERSITYASSIGNMENT_H_</span>
|
|
<a name="l00015"></a>00015 <span class="preprocessor"></span>
|
|
<a name="l00016"></a>00016 <span class="preprocessor">#include <diversity/moeoCrowdingDiversityAssignment.h></span>
|
|
<a name="l00017"></a>00017 <span class="preprocessor">#include <comparator/moeoFitnessThenDiversityComparator.h></span>
|
|
<a name="l00018"></a>00018
|
|
<a name="l00024"></a>00024 <span class="keyword">template</span> < <span class="keyword">class</span> MOEOT >
|
|
<a name="l00025"></a><a class="code" href="classmoeoFrontByFrontCrowdingDiversityAssignment.html">00025</a> <span class="keyword">class </span><a class="code" href="classmoeoFrontByFrontCrowdingDiversityAssignment.html">moeoFrontByFrontCrowdingDiversityAssignment</a> : <span class="keyword">public</span> <a class="code" href="classmoeoCrowdingDiversityAssignment.html">moeoCrowdingDiversityAssignment</a> < MOEOT >
|
|
<a name="l00026"></a>00026 {
|
|
<a name="l00027"></a>00027 <span class="keyword">public</span>:
|
|
<a name="l00028"></a>00028
|
|
<a name="l00030"></a><a class="code" href="classmoeoFrontByFrontCrowdingDiversityAssignment.html#aebd424133b426cf6a2ec7b20743bbaf">00030</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> MOEOT::ObjectiveVector <a class="code" href="classmoeoFrontByFrontCrowdingDiversityAssignment.html#aebd424133b426cf6a2ec7b20743bbaf">ObjectiveVector</a>;
|
|
<a name="l00031"></a>00031
|
|
<a name="l00032"></a>00032
|
|
<a name="l00040"></a><a class="code" href="classmoeoFrontByFrontCrowdingDiversityAssignment.html#f73ff88bd29c49260e2ca859250e4b68">00040</a> <span class="keywordtype">void</span> <a class="code" href="classmoeoFrontByFrontCrowdingDiversityAssignment.html#f73ff88bd29c49260e2ca859250e4b68">updateByDeleting</a>(eoPop < MOEOT > & _pop, <a class="code" href="classmoeoFrontByFrontCrowdingDiversityAssignment.html#aebd424133b426cf6a2ec7b20743bbaf">ObjectiveVector</a> & _objVec)
|
|
<a name="l00041"></a>00041 {
|
|
<a name="l00042"></a>00042 std::cout << <span class="stringliteral">"WARNING : updateByDeleting not implemented in moeoFrontByFrontCrowdingDistanceDiversityAssignment"</span> << std::endl;
|
|
<a name="l00043"></a>00043 }
|
|
<a name="l00044"></a>00044
|
|
<a name="l00045"></a>00045
|
|
<a name="l00046"></a>00046 <span class="keyword">private</span>:
|
|
<a name="l00047"></a>00047
|
|
<a name="l00048"></a>00048 <span class="keyword">using</span> moeoCrowdingDiversityAssignment < MOEOT >::inf;
|
|
<a name="l00049"></a>00049 <span class="keyword">using</span> moeoCrowdingDiversityAssignment < MOEOT >::tiny;
|
|
<a name="l00050"></a>00050
|
|
<a name="l00055"></a><a class="code" href="classmoeoFrontByFrontCrowdingDiversityAssignment.html#1aa0ec7b94fbbf952636bcc21e1a9d16">00055</a> <span class="keywordtype">void</span> <a class="code" href="classmoeoFrontByFrontCrowdingDiversityAssignment.html#1aa0ec7b94fbbf952636bcc21e1a9d16">setDistances</a> (eoPop < MOEOT > & _pop)
|
|
<a name="l00056"></a>00056 {
|
|
<a name="l00057"></a>00057 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> a,b;
|
|
<a name="l00058"></a>00058 <span class="keywordtype">double</span> min, max, distance;
|
|
<a name="l00059"></a>00059 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> nObjectives = MOEOT::ObjectiveVector::nObjectives();
|
|
<a name="l00060"></a>00060 <span class="comment">// set diversity to 0 for every individual</span>
|
|
<a name="l00061"></a>00061 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=0; i<_pop.size(); i++)
|
|
<a name="l00062"></a>00062 {
|
|
<a name="l00063"></a>00063 _pop[i].diversity(0.0);
|
|
<a name="l00064"></a>00064 }
|
|
<a name="l00065"></a>00065 <span class="comment">// sort the whole pop according to fitness values</span>
|
|
<a name="l00066"></a>00066 moeoFitnessThenDiversityComparator < MOEOT > fitnessComparator;
|
|
<a name="l00067"></a>00067 std::sort(_pop.begin(), _pop.end(), fitnessComparator);
|
|
<a name="l00068"></a>00068 <span class="comment">// compute the crowding distance values for every individual "front" by "front" (front : from a to b)</span>
|
|
<a name="l00069"></a>00069 a = 0; <span class="comment">// the front starts at a</span>
|
|
<a name="l00070"></a>00070 <span class="keywordflow">while</span> (a < _pop.size())
|
|
<a name="l00071"></a>00071 {
|
|
<a name="l00072"></a>00072 b = <a class="code" href="classmoeoFrontByFrontCrowdingDiversityAssignment.html#ab8e153a4716375414ff2140fc3fa480">lastIndex</a>(_pop,a); <span class="comment">// the front ends at b</span>
|
|
<a name="l00073"></a>00073 <span class="comment">// if there is less than 2 individuals in the front...</span>
|
|
<a name="l00074"></a>00074 <span class="keywordflow">if</span> ((b-a) < 2)
|
|
<a name="l00075"></a>00075 {
|
|
<a name="l00076"></a>00076 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=a; i<=b; i++)
|
|
<a name="l00077"></a>00077 {
|
|
<a name="l00078"></a>00078 _pop[i].diversity(<a class="code" href="classmoeoCrowdingDiversityAssignment.html#e7f5dbe11427a5c264e70fe4e036242f">inf</a>());
|
|
<a name="l00079"></a>00079 }
|
|
<a name="l00080"></a>00080 }
|
|
<a name="l00081"></a>00081 <span class="comment">// else...</span>
|
|
<a name="l00082"></a>00082 <span class="keywordflow">else</span>
|
|
<a name="l00083"></a>00083 {
|
|
<a name="l00084"></a>00084 <span class="comment">// for each objective</span>
|
|
<a name="l00085"></a>00085 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> obj=0; obj<nObjectives; obj++)
|
|
<a name="l00086"></a>00086 {
|
|
<a name="l00087"></a>00087 <span class="comment">// sort in the descending order using the values of the objective 'obj'</span>
|
|
<a name="l00088"></a>00088 moeoOneObjectiveComparator < MOEOT > objComp(obj);
|
|
<a name="l00089"></a>00089 std::sort(_pop.begin()+a, _pop.begin()+b+1, objComp);
|
|
<a name="l00090"></a>00090 <span class="comment">// min & max</span>
|
|
<a name="l00091"></a>00091 min = _pop[b].objectiveVector()[obj];
|
|
<a name="l00092"></a>00092 max = _pop[a].objectiveVector()[obj];
|
|
<a name="l00093"></a>00093 <span class="comment">// avoid extreme case</span>
|
|
<a name="l00094"></a>00094 <span class="keywordflow">if</span> (min == max)
|
|
<a name="l00095"></a>00095 {
|
|
<a name="l00096"></a>00096 min -= <a class="code" href="classmoeoCrowdingDiversityAssignment.html#eb70be9c246dfa56b55a4ecc5454f778">tiny</a>();
|
|
<a name="l00097"></a>00097 max += <a class="code" href="classmoeoCrowdingDiversityAssignment.html#eb70be9c246dfa56b55a4ecc5454f778">tiny</a>();
|
|
<a name="l00098"></a>00098 }
|
|
<a name="l00099"></a>00099 <span class="comment">// set the diversity value to infiny for min and max</span>
|
|
<a name="l00100"></a>00100 _pop[a].diversity(<a class="code" href="classmoeoCrowdingDiversityAssignment.html#e7f5dbe11427a5c264e70fe4e036242f">inf</a>());
|
|
<a name="l00101"></a>00101 _pop[b].diversity(<a class="code" href="classmoeoCrowdingDiversityAssignment.html#e7f5dbe11427a5c264e70fe4e036242f">inf</a>());
|
|
<a name="l00102"></a>00102 <span class="comment">// set the diversity values for the other individuals</span>
|
|
<a name="l00103"></a>00103 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=a+1; i<b; i++)
|
|
<a name="l00104"></a>00104 {
|
|
<a name="l00105"></a>00105 distance = (_pop[i-1].objectiveVector()[obj] - _pop[i+1].objectiveVector()[obj]) / (max-min);
|
|
<a name="l00106"></a>00106 _pop[i].diversity(_pop[i].diversity() + distance);
|
|
<a name="l00107"></a>00107 }
|
|
<a name="l00108"></a>00108 }
|
|
<a name="l00109"></a>00109 }
|
|
<a name="l00110"></a>00110 <span class="comment">// go to the next front</span>
|
|
<a name="l00111"></a>00111 a = b+1;
|
|
<a name="l00112"></a>00112 }
|
|
<a name="l00113"></a>00113 }
|
|
<a name="l00114"></a>00114
|
|
<a name="l00115"></a>00115
|
|
<a name="l00121"></a><a class="code" href="classmoeoFrontByFrontCrowdingDiversityAssignment.html#ab8e153a4716375414ff2140fc3fa480">00121</a> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="classmoeoFrontByFrontCrowdingDiversityAssignment.html#ab8e153a4716375414ff2140fc3fa480">lastIndex</a> (eoPop < MOEOT > & _pop, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> _start)
|
|
<a name="l00122"></a>00122 {
|
|
<a name="l00123"></a>00123 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=_start;
|
|
<a name="l00124"></a>00124 <span class="keywordflow">while</span> ( (i<_pop.size()-1) && (_pop[i].fitness()==_pop[i+1].fitness()) )
|
|
<a name="l00125"></a>00125 {
|
|
<a name="l00126"></a>00126 i++;
|
|
<a name="l00127"></a>00127 }
|
|
<a name="l00128"></a>00128 <span class="keywordflow">return</span> i;
|
|
<a name="l00129"></a>00129 }
|
|
<a name="l00130"></a>00130
|
|
<a name="l00131"></a>00131 };
|
|
<a name="l00132"></a>00132
|
|
<a name="l00133"></a>00133 <span class="preprocessor">#endif </span><span class="comment">/*MOEOFRONTBYFRONTCROWDINGDIVERSITYASSIGNMENT_H_*/</span>
|
|
</pre></div><hr size="1"><address style="align: right;"><small>Generated on Mon Jul 2 16:05:01 2007 for ParadisEO-MOEO 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>
|