Multi-Verse Optimizer toolbox

A toolbox for the Multi-Verse Optimizer (MVO) algorithm

This is a simple toolbox with a use-friendly graphical interface, which is very suitable for those without high programming skills.
The parameters of the MVO algorithm can be easily defined in the toolbox.
The default name of the objective function is CostFunction. If you have a look at the CostFunction.m file, you may notice that the cost function gets the variables in a vector ([x1 x2 ... xn]) and returns the objective value. You can either write you objective function in this file or create a new file and pass its name to the toolbox. Remember to follow the same structure for input and output if you decided to go for the second option.
The lower bounds and upper bounds of variables should also be written as lb1,lb2,...,lbn and ub1,ub2,...,ubn. If all of the variables have equal lower and/or upper bounds you can just define lb and ub as two single number numbers: lb, ub.

Just run the MVO_toolbox.m file and enjoy!

This is the source codes of the paper:

Seyedali Mirjalili, Seyed Mohammad Mirjalili, Abdolreza Hatamlou, " Multi-Verse Optimizer: a nature-inspired algorithm for global optimization " , Neural Computing and Applications, in press, 2015, DOI: http://dx.doi.org/10.1007/s00521-015-1870-7

Link: http://link.springer.com/article/10.1007%2Fs00521-015-1870-7

More information can be found in: http://www.alimirjalili.com/MVO.html

I have a number of relevant courses in this area. You can enrol via the following links with 95% discount:

*******************************************************************************************************************************************
A course on “Optimization Problems and Algorithms: how to understand, formulation, and solve optimization problems”:
https://www.udemy.com/optimisation/?couponCode=MATHWORKSREF

A course on “Introduction to Genetic Algorithms: Theory and Applications”
https://www.udemy.com/geneticalgorithm/?couponCode=MATHWORKSREF
*******************************************************************************************************************************************