Archiving Benchmarks

The following plots compare the performance of archiving algorithms in moocore and moarchiving.

The sequences are generated using generate_ndset() and generate_sequence().

The source code for the benchmarks below can be found at multi-objective/moocore .

Unbounded Archiving

This benchmark compares moocore.UnboundedArchive() and moarchiving.get_mo_archive. Each archive is given the number of points in the x-axis, one at a time. We measure the CPU time required to archive the whole sequence of points and divide it by the number of points, which gives an estimation of the time to process each point for different input sizes. In addition, the plots show the total time required by filter_dominated() to process the input sequence. The time required by filter_dominated() can be seen as an upper-bound.

2D

3D

4D