OPL- Optimisation problem library

Collection of optimisation problems and benchmark suites with information about high level properties like the type of decision variables, number of objectives, and the presenece of constraints. Where available references to papers describing the problem and implementations are included.

Contributing

Contributions and corrections are very welcome, through pull requests, issue reporting, or email.

Details to provide

It is often far easier for the creator of a problem/suite/generator, or someone working with it, to provide details about it than for someone new to it. Currently, the following specific details are being collected:

• Name of the problem/suite/generator
• Whether it concerns a suite, generator, or single problem
• Number of objectives (or available range)
• Number of variable dimensions (or available range)
• Type of variables (can be multiple) -- Be as specific as possible (e.g., integer/binary/categorical, rather than 'discrete')
• Whether the search space is subject to constraints or not (other than boundary constraints)
• Whether the problem(s) is/are dynamic or not
• Whether the problem(s) is/are noisy or not
• Whether the objective space is multimodal or not
• Whether objectives can be evaluated for multiple fidelities or not
• Any other info you feel is important
• A reference to a scientific publication on the problem/suite/generator (if available)
• A reference to a source code implementation of the problem/suite/generator (if available)

Contact

koen.vdblom@lip6.fr