meta-heuristic

I think it would be useful to have a grid search optimizer in this package. But its implementation would probably be quite different from other ones (sklearn, ...).

The requirements are:

• The grid search has to stop after n_iter instead of searching the entire search space
• The positions should not be precalculated at the beginning of the optimization (i have concerns about memory load).

Some problems/algorithms seem to have an inconsistent python exposition in terms of types.

For instance, in ../src/problems/dtlz.cpp we have:

dtlz::dtlz(unsigned prob_id, vector_double::size_type dim, vector_double::size_type fdim, unsigned alpha)

But in the ../pygmo/expose_problems_0.cpp it is exposed as:

dtlz_p.def(bp::init<unsigned, unsigned, unsigned, unsigned>

I

Migrate and test the Parameters classes from the openDse to the Opt4J project.