git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@34 331e1502-861f-0410-8da2-ba01fb791d7f

trunk/paradiseo-mo/examples/tsp/mimetic.cpp

@@ -0,0 +1,98 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+// "mimetic.cpp"
+
+// (c) OPAC Team, LIFL, 2003
+
+/* This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+   
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+   
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA
+   
+   Contact: cahon@lifl.fr
+*/
+
+#include <eoEasyEA.h>
+#include <eoGenContinue.h>
+#include <eoStochTournamentSelect.h>
+#include <eoSGATransform.h>
+#include <eoSelectNumber.h>
+
+#include <moHC.h>
+#include <moFirstImprSelect.h>
+#include <moBestImprSelect.h>
+#include <moRandImprSelect.h>
+
+#include "share/graph.h"
+#include "share/route.h"
+#include "share/route_init.h"
+#include "share/route_eval.h"
+#include "share/order_xover.h"
+
+#include "share/two_opt.h"
+#include "share/two_opt_init.h"
+#include "share/two_opt_next.h"
+#include "share/two_opt_incr_eval.h"
+
+int main (int __argc, char * __argv []) {
+  
+  if (__argc != 2) {
+    
+    std :: cerr << "Usage : ./mimetic [instance]" << std :: endl ;
+    return 1 ;
+  }
+
+  Graph :: load (__argv [1]) ; // Instance
+
+  RouteInit init ; // Sol. Random Init.
+
+  RouteEval full_eval ; // Full Evaluator
+   
+  eoPop <Route> pop (100, init) ; // Population
+  apply <Route> (full_eval, pop) ;
+
+  std :: cout << "[From] " << pop.best_element () << std :: endl ;
+  
+  eoGenContinue <Route> cont (1000) ; /* Continuator (A fixed number of
+					 1000 iterations */
+ 
+  eoStochTournamentSelect <Route> select_one ; // Selector
+
+  eoSelectNumber <Route> select (select_one, 100) ;
+
+  OrderXover cross ; // Order Crossover
+
+  TwoOptInit two_opt_init ; // Init.
+   
+  TwoOptNext two_opt_next ; // Explorer.
+  
+  TwoOptIncrEval two_opt_incr_eval ; // Eff. eval.
+  
+  moRandImprSelect <TwoOpt> two_opt_select ; // Stochastic Neigh. Selector
+
+  moHC <TwoOpt> hill_climb (two_opt_init, two_opt_next, two_opt_incr_eval, two_opt_select, full_eval) ;
+ 
+  eoSGATransform <Route> transform (cross, 1, hill_climb, 0.01) ; 
+  
+  eoElitism <Route> merge (1) ; // Use of Elistism
+  
+  eoStochTournamentTruncate <Route> reduce (0.7) ; // Stoch. Replacement
+  
+  eoEasyEA <Route> ea (cont, full_eval, select, transform, merge, reduce) ;
+  
+  ea (pop) ;
+  
+  std :: cout << "[To] " << pop.best_element () << std :: endl ;
+    
+  return 0 ;
+}
+