1st Combinatorial Black-Box Optimization Competition (CBBOC)
July 11-15, 2015 @ GECCO 2015 in Madrid, Spain
http://web.mst.edu/~tauritzd/CBBOC/
*** SUBMISSIONS DUE
THIS COMING MONDAY 1 JUNE 2015 ***
This is CBBOC's inaugural year. It's designed to provide the GECCO community with detailed performance comparisons of a wide variety of meta-heuristics and hyper-heuristics on combinatorial
problems, where the real-world problems which induce combinatorial problems have been categorized into those with no training time (good fit for out-of-the-box algorithms such as the Parameter-less Population Pyramid), those with short training time (good
fit for typical evolutionary algorithms), and those with long training time (good fit for hyper-heuristics). Training and testing time is measured in terms of number of fitness evaluations, although wall time will be used to time-out algorithms taking infeasibly
long to complete. Competitors choose which category or categories they want to submit to. While trained differently, all three categories will be compared employing instances drawn from the same test set. This can create a Pareto set of winners, maximizing
solution quality while minimizing training time, with at most three nondominated points. The competition problems will be randomly generated by a meta-class based on NK-Landscapes, including - but not limited to - varying number of genes/bits (N), epistasis
size (K), epistasis model, fitness table, and maximum number of evaluations per instance.
For more detailed information, including API download links for C++, Java, and Python, see the CBBOC website (http://web.mst.edu/~tauritzd/CBBOC/).
CONTACT INFO
ORGANIZERS
Brian Goldman ([log in to unmask]), Michigan State University
Jerry Swan ([log in to unmask]), University of York
Daniel Tauritz ([log in to unmask]), Missouri University of Science and Technology