Description 
GODLIKE (Global Optimum Determination by Linking and Interchanging Kindred Evaluators) is a generization of various populationbased global optimization schemes. Also, it handles both single and multiobjective optimization, simply by adding additional objective functions.
GODLIKE solves optimization problems using relatively basic implementations of a genetic algorithm, differential evolution, particle swarm optimization and adaptive simulated annealing algorithms. Its power comes from the fact that these different algorithms run simultaneously (linked), and members from each population are occasionally swapped (interchanged) to decrease the chances of convergence to a local minimizer.
It is primarily intended to increase ROBUSTNESS, not efficiency as it usually requires more function evaluations than any of the algorithms separately. Its also inteded to do away with the need to finetune these algorithms each and every time you encounter an optimization problem, AND to generalize optimization itself (it's both a single and multiobjective optimizer), AND to generate simple plots to be used in quick reports etc.
BASIC EXAMPLES:
(singleobjective)
% extended rosenbruck function
rosen = @(X) sum( 100*(X(:, 2:2:end)  X(:, 1:2:end1).^2).^2 + (1  X(:, 1:2:end1)).^2, 2);
% call GODLIKE
GODLIKE(rosen, 250, 10*ones(1,10), 10*ones(1,10), 'ms')
will produce a reasonably accurate approximation to the global minimum of the 10dimensional rosenbruck problem
( sol ~ ([1,1,1,...]), fval ~ 0 )
(multiobjective optimization)
% basic SinCos Pareto front
GODLIKE({@sin;@cos}, 100, 0, 2*pi, [], 'display', 'plot')
will generate a nice plot of the problem's Pareto front. Some more examples are included in the GODLIKE_DEMO.m, included in the ZIP.
======================================
MAJOR CHANGES
(see the changelog for more detailed changes)
======================================
(06/Aug/2009)
 Objective functions can now accept any 2dimensional input. Your objective function should accept arguments equal in size to either [lb] or [ub], and return a simple scalar.
 I discovered I made some *severe* mistakes in the implementation of the global optimization algorithms. This caused large inefficiencies or inaccurate results. Most (hopefully all) of these mistakes are corrected now.
 Added 2more options for the algorithms: NetWorkTopology & ReHeat (see doc)
 Changed the [MinDescent] criterion to the more MATLABstyle 'TolX' and 'TolFun' options
