* New tree configuration of the project:
.../
... + -- EO
| |
| |
+-- src ----- + -- EDO
| |
| |
+-- test + -- MO
| |
| |
+-- tutorial + -- MOEO
| |
| |
+-- doc + -- SMP
| |
| |
... + -- EOMPI
|
|
+ -- EOSERIAL
Question for current maintainers: ./README: new release?
Also:
* Moving out eompi & eoserial modules (issue #2).
* Correction of the errors when executing "make doc" command.
* Adding a solution for the conflicting headers problem (see the two CMake Cache
Values: PROJECT_TAG & PROJECT_HRS_INSTALL_SUBPATH) (issue #1)
* Header inclusions:
** src: changing absolute paths into relative paths ('#include <...>' -> '#include "..."')
** test, tutorial: changing relative paths into absolute paths ('#include "..."' -> '#include <...>')
* Moving out some scripts from EDO -> to the root
* Add a new script for compilation and installation (see build_gcc_linux_install)
* Compilation with uBLAS library or EDO module: now ok
* Minor modifications on README & INSTALL files
* Comment eompi failed tests with no end
*** TODO: CPack (debian (DEB) & RedHat (RPM) packages) (issues #6 & #7) ***
This commit is contained in:
Adèle Harrissart
parent
515bd5943d
commit
490e837f7a
2359 changed files with 7688 additions and 16329 deletions
|
|
@ -1,241 +0,0 @@
|
|||
//-----------------------------------------------------------------------------
|
||||
/** testNeighborhood.cpp
|
||||
*
|
||||
* JH - 09/04/10
|
||||
*
|
||||
*/
|
||||
//-----------------------------------------------------------------------------
|
||||
|
||||
// standard includes
|
||||
#define HAVE_SSTREAM
|
||||
|
||||
#include <stdexcept> // runtime_error
|
||||
#include <iostream> // cout
|
||||
#include <sstream> // ostrstream, istrstream
|
||||
#include <fstream>
|
||||
#include <string.h>
|
||||
|
||||
// the general include for eo
|
||||
#include <eo>
|
||||
#include <ga.h>
|
||||
|
||||
using namespace std;
|
||||
|
||||
//----------------------------------------------------------------------------
|
||||
|
||||
//Representation and initializer
|
||||
#include <eoInt.h>
|
||||
#include <eoInit.h>
|
||||
|
||||
// fitness function
|
||||
#include <eval/queenEval.h>
|
||||
#include <eval/moFullEvalByModif.h>
|
||||
#include <eval/moFullEvalByCopy.h>
|
||||
|
||||
//Neighbors and Neighborhoods
|
||||
#include <problems/permutation/moShiftNeighbor.h>
|
||||
#include <problems/permutation/moSwapNeighbor.h>
|
||||
#include <problems/permutation/moSwapNeighborhood.h>
|
||||
#include <neighborhood/moRndWithReplNeighborhood.h>
|
||||
#include <neighborhood/moRndWithoutReplNeighborhood.h>
|
||||
#include <neighborhood/moOrderNeighborhood.h>
|
||||
|
||||
|
||||
// Define types of the representation solution, different neighbors and neighborhoods
|
||||
//-----------------------------------------------------------------------------
|
||||
typedef eoInt<unsigned int> Queen; //Permutation (Queen's problem representation)
|
||||
|
||||
typedef moSwapNeighbor<Queen> swapNeighbor ; //swap Neighbor
|
||||
typedef moSwapNeighborhood<Queen> swapNeighborhood; //classical swap Neighborhood
|
||||
|
||||
typedef moShiftNeighbor<Queen> shiftNeighbor; //shift Neighbor
|
||||
typedef moOrderNeighborhood<shiftNeighbor> orderShiftNeighborhood; //order shift Neighborhood (Indexed)
|
||||
typedef moRndWithoutReplNeighborhood<shiftNeighbor> rndWithoutReplShiftNeighborhood; //random without replacement shift Neighborhood (Indexed)
|
||||
typedef moRndWithReplNeighborhood<shiftNeighbor> rndWithReplShiftNeighborhood; //random with replacement shift Neighborhood (Indexed)
|
||||
|
||||
void main_function(int argc, char **argv)
|
||||
{
|
||||
/* =========================================================
|
||||
*
|
||||
* Parameters
|
||||
*
|
||||
* ========================================================= */
|
||||
|
||||
// First define a parser from the command-line arguments
|
||||
eoParser parser(argc, argv);
|
||||
|
||||
// For each parameter, define Parameter, read it through the parser,
|
||||
// and assign the value to the variable
|
||||
|
||||
eoValueParam<uint32_t> seedParam(time(0), "seed", "Random number seed", 'S');
|
||||
parser.processParam( seedParam );
|
||||
unsigned seed = seedParam.value();
|
||||
|
||||
// description of genotype
|
||||
eoValueParam<unsigned int> vecSizeParam(8, "vecSize", "Genotype size", 'V');
|
||||
parser.processParam( vecSizeParam, "Representation" );
|
||||
unsigned vecSize = vecSizeParam.value();
|
||||
|
||||
// the name of the "status" file where all actual parameter values will be saved
|
||||
string str_status = parser.ProgramName() + ".status"; // default value
|
||||
eoValueParam<string> statusParam(str_status.c_str(), "status", "Status file");
|
||||
parser.processParam( statusParam, "Persistence" );
|
||||
|
||||
// do the following AFTER ALL PARAMETERS HAVE BEEN PROCESSED
|
||||
// i.e. in case you need parameters somewhere else, postpone these
|
||||
if (parser.userNeedsHelp()) {
|
||||
parser.printHelp(cout);
|
||||
exit(1);
|
||||
}
|
||||
if (statusParam.value() != "") {
|
||||
ofstream os(statusParam.value().c_str());
|
||||
os << parser;// and you can use that file as parameter file
|
||||
}
|
||||
|
||||
/* =========================================================
|
||||
*
|
||||
* Random seed
|
||||
*
|
||||
* ========================================================= */
|
||||
|
||||
//reproducible random seed: if you don't change SEED above,
|
||||
// you'll aways get the same result, NOT a random run
|
||||
rng.reseed(seed);
|
||||
|
||||
|
||||
/* =========================================================
|
||||
*
|
||||
* Eval fitness function
|
||||
*
|
||||
* ========================================================= */
|
||||
|
||||
queenEval<Queen> fullEval;
|
||||
|
||||
|
||||
/* =========================================================
|
||||
*
|
||||
* Initializer of the solution
|
||||
*
|
||||
* ========================================================= */
|
||||
|
||||
eoInitPermutation<Queen> init(vecSize);
|
||||
|
||||
|
||||
/* =========================================================
|
||||
*
|
||||
* evaluation operators of a neighbor solution
|
||||
*
|
||||
* ========================================================= */
|
||||
|
||||
moFullEvalByModif<swapNeighbor> swapEval(fullEval);
|
||||
moFullEvalByCopy<shiftNeighbor> shiftEval(fullEval);
|
||||
|
||||
|
||||
/* =========================================================
|
||||
*
|
||||
* Neighbors and Neighborhoods
|
||||
*
|
||||
* ========================================================= */
|
||||
|
||||
swapNeighborhood swapNH;
|
||||
orderShiftNeighborhood orderShiftNH((vecSize-1) * (vecSize-1));
|
||||
rndWithoutReplShiftNeighborhood rndNoReplShiftNH((vecSize-1) * (vecSize-1));
|
||||
rndWithReplShiftNeighborhood rndReplShiftNH((vecSize-1) * (vecSize-1));
|
||||
|
||||
|
||||
/* =========================================================
|
||||
*
|
||||
* Init and eval a Queen
|
||||
*
|
||||
* ========================================================= */
|
||||
|
||||
Queen solution;
|
||||
|
||||
init(solution);
|
||||
|
||||
fullEval(solution);
|
||||
|
||||
std::cout << "Initial Solution:" << std::endl;
|
||||
std::cout << solution << std::endl << std::endl;
|
||||
|
||||
/* =========================================================
|
||||
*
|
||||
* Use classical Neighbor and Neighborhood (swap)
|
||||
*
|
||||
* ========================================================= */
|
||||
|
||||
std::cout << "SWAP NEIGHBORHOOD" << std::endl;
|
||||
std::cout << "-----------------" << std::endl;
|
||||
std::cout << "Neighbors List: (Neighbor -> fitness)" << std::endl;
|
||||
|
||||
swapNeighbor n1;
|
||||
swapNH.init(solution, n1);
|
||||
swapEval(solution,n1);
|
||||
n1.print();
|
||||
while (swapNH.cont(solution)) {
|
||||
swapNH.next(solution, n1);
|
||||
swapEval(solution,n1);
|
||||
n1.print();
|
||||
}
|
||||
|
||||
/* =========================================================
|
||||
*
|
||||
* Use indexed Neighborhood with shift operator
|
||||
*
|
||||
* ========================================================= */
|
||||
|
||||
std::cout << "\nSHIFT ORDER NEIGHBORHOOD" << std::endl;
|
||||
std::cout << "------------------------" << std::endl;
|
||||
std::cout << "Neighbors List: (key: Neighbor -> fitness)" << std::endl;
|
||||
|
||||
shiftNeighbor n2;
|
||||
|
||||
orderShiftNH.init(solution, n2);
|
||||
shiftEval(solution,n2);
|
||||
n2.print();
|
||||
while (orderShiftNH.cont(solution)) {
|
||||
orderShiftNH.next(solution, n2);
|
||||
shiftEval(solution,n2);
|
||||
n2.print();
|
||||
}
|
||||
|
||||
std::cout << "\nSHIFT RANDOM WITHOUT REPLACEMENT NEIGHBORHOOD" << std::endl;
|
||||
std::cout << "---------------------------------------------" << std::endl;
|
||||
std::cout << "Neighbors List: (key: Neighbor -> fitness)" << std::endl;
|
||||
|
||||
rndNoReplShiftNH.init(solution, n2);
|
||||
shiftEval(solution,n2);
|
||||
n2.print();
|
||||
while (rndNoReplShiftNH.cont(solution)) {
|
||||
rndNoReplShiftNH.next(solution, n2);
|
||||
shiftEval(solution,n2);
|
||||
n2.print();
|
||||
}
|
||||
|
||||
std::cout << "\nSHIFT RANDOM WITH REPLACEMENT NEIGHBORHOOD" << std::endl;
|
||||
std::cout << "---------------------------------------------" << std::endl;
|
||||
std::cout << "Neighbors List: (key: Neighbor -> fitness)" << std::endl;
|
||||
|
||||
rndReplShiftNH.init(solution, n2);
|
||||
shiftEval(solution,n2);
|
||||
n2.print();
|
||||
for (unsigned int i=0; i<100; i++) {
|
||||
rndReplShiftNH.next(solution, n2);
|
||||
shiftEval(solution,n2);
|
||||
n2.print();
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
// A main that catches the exceptions
|
||||
|
||||
int main(int argc, char **argv)
|
||||
{
|
||||
try {
|
||||
main_function(argc, argv);
|
||||
}
|
||||
catch (exception& e) {
|
||||
cout << "Exception: " << e.what() << '\n';
|
||||
}
|
||||
return 1;
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue