nojhan/paradiseo
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity
paradiseo/smp/tutorial/Lesson1
History
Eremey Valetov c1a44fd2a6 Add tutorial READMEs and fix tutorial return codes 
Add README.md files for moeo/tutorial/Lesson{1-4}, smp/tutorial/Lesson{1-4},
and mo/tutorial/Lesson9 — these tutorials had no documentation.

Fix return 1 → return 0 in 28 tutorial main() functions across mo/ and
smp/ that unconditionally returned failure status.
2026-02-28 19:26:10 -05:00
..
CMakeLists.txt Migration from SVN 2012-08-30 11:30:11 +02:00
lesson1_data.dat Migration from SVN 2012-08-30 11:30:11 +02:00
lesson1_eoEasyEA.cpp Add tutorial READMEs and fix tutorial return codes 2026-02-28 19:26:10 -05:00
lesson1_eoEasyEA.param Migration from SVN 2012-08-30 11:30:11 +02:00
parserStruct.h Update dead URLs in license headers and build config 2026-02-28 19:26:10 -05:00
QAP.h Update dead URLs in license headers and build config 2026-02-28 19:26:10 -05:00
QAPGA.h Update dead URLs in license headers and build config 2026-02-28 19:26:10 -05:00
README.md Add tutorial READMEs and fix tutorial return codes 2026-02-28 19:26:10 -05:00
utils.h Update dead URLs in license headers and build config 2026-02-28 19:26:10 -05:00

README.md

Master/Workers wrapping with eoEasyEA

Wraps a standard eoEasyEA with the ParadisEO-SMP parallel evaluation model, applied to the Quadratic Assignment Problem (QAP).

The QAP assigns facilities to locations to minimize cost (flow x distance). The representation is a permutation.

Running

From the build/smp/tutorial/Lesson1 directory:

./lesson1_eoEasyEA lesson1_eoEasyEA.param

How it works

The key idea: ParadisEO-SMP parallelizes evaluation by wrapping an existing sequential algorithm. The algorithm code itself stays the same. QAP.h defines the problem representation and evaluation, QAPGA.h defines the GA operators, and parserStruct.h + utils.h handle parameter parsing and instance loading. See also lesson1_data.dat for the problem instance.