GECCO 2016 is hosting the Workshop on Real-Parameter Black-Box Optimization Benchmarking (BBOB 2016), which will be the first time in the BBOB Workshop series where bi-objective problems are examined. This is particularly exciting for us since this competition allows anyone to test any optimization algorithm on a suite of 55 bi-objective problems. The bi-objective problems are constructed by selecting two single-objective functions with known characteristics. Many of the single-objective functions are well-known, such as the Schaffer and Schwefel problems, but additional transformations are applied to increase the difficulty of the functions. This is a perfect opportunity for anyone using the MOEA Framework to show off their optimization algorithm. In this post we will demonstrate how to connect the MOEA Framework to the BBOB 2016 test suite (which is part of the Coco Framework).
The termination condition determines when an optimization algorithm is completed. This post describes a new feature in the MOEA Framework where you can specify termination conditions for an algorithm. We now provide built-in support for fixing the maximum number of evaluations or the maximum wallclock time, but other means can be devised.
If you have used the MOEA Framework in the past, you may have noticed it does not support many plotting options. Yes, it has the Diagnostic Tool for plotting the runtime outputs for an algorithm, but it can only display data generated in the tool. If you were running algorithms programatically, there were not plotting options...until today.
|
Who we are
Keyboard Scientist is a blog about conducting science in a digital world, discussing topics ranging from programming, model design and analysis, and publishing. In addition, we post a range of topics concerning our open source optimization framework. Subscribe
Enter your e-mail address below to receive notifications of new posts.
Archives
January 2016
Categories |