nojhan/paradiseo
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Ref added

Browse source 
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1602 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
jhumeau 2009-07-02 09:42:04 +00:00
commit 26c5bfa7e6
2 changed files with 21 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

7
contribution/branches/MOLS/src2/moeoPLS1.h
View file

@ -44,7 +44,12 @@
#include <moeoExhaustiveNeighborhoodExplorer.h>
/**
* A class to design dominance based local searches
* PLS1 algorithm
*
* Paquete L, Chiarandini M, St ̈ tzle T (2004) Pareto local optimum sets in the biobjective
* traveling salesman problem: An experimental study. In: Metaheuristics for Multiobjective
* Optimisation, Lecture Notes in Economics and Mathematical Systems, vol 535, Springer-
* Verlag, Berlin, Germany, chap 7, pp 177–199
*/
template < class Move >
class moeoPLS1 : public moeoUnifiedDominanceBasedLS < Move >