Researchers who have previously simulated experimental optimization problems are highly encouraged to submit their examples to this database, as every new problem benefits the community by enlarging the test domain of the different tested algorithms. The only rules for submission are that your problem should be placable in the standard form

$\begin{array}{rll} \mathop {\rm minimize} \limits_{\bf u} & \phi_p ({\bf u}) & \\ {\rm subject\;to} & g_{p,j} ({\bf u}) \leq 0, & j = 1,...,n_{g_p} \\ & g_{j} ({\bf u}) \leq 0, & j = 1,...,n_{g} \\ & u_i^L \leq u_i \leq u_i^U, & i = 1,...,n_u \end{array}$

and that it be based on a real-world case study (and is not just a constructed mathematical example). Please write to gene.a.bunin@ccapprox.info if you have a submission request, as this process is not automated.

You are also welcome to submit new algorithms, or to submit refined versions of already stored ones - in the latter case, you may choose to keep the old version(s) or to only provide test results for the latest version if you feel this to be the best or most representative. The only rule is that the algorithm be compatable with the testing code used here - i.e., that it can be incorporated into the main algorithm file in a manner that yields a new set of decision variables when the command

[u(k+2,:),output] = algo(u,phiphat,gphat,sigmaphi,sigmag,uL,uU,algonum,input);

is executed. Not all algorithms are applicable to all classes of problems, and so your algorithm will be tested for those problem classes that it is applicable for. There is no need for you to test it yourself, although you are more than welcome to do so if you want to verify that the results reported here are correct (all of the code necessary for testing being provided). As with the test problems, researchers are highly encouraged to submit their algorithms, whether they be performant or not, as this will help in deciphering the links between algorithmic characteristics and performances for different metrics and problem types. It is important as well to keep in mind that this is not a competition, though some competitive spirit as we try to collectively write better and better algorithms is certainly encouraged. To submit your algorithm, please mail its code, together with a basic algorithm description, to gene.a.bunin@ccapprox.info. This is not a single-step submission process, however, and additional interaction to finalize the algorithm details will follow.

Finally, all of the algorithms considered here are open-source and available for use/modification by any user of the database. Commercial algorithms are not accepted for testing as they are inaccessible to the general user.