Skip to content

Commit 732c010

Browse files
kvdblomkvdblom
committed
Merge other info into textual description.
1 parent 10bce93 commit 732c010

3 files changed

Lines changed: 93 additions & 153 deletions

File tree

‎docs/index.html‎

Lines changed: 27 additions & 27 deletions
Original file line numberDiff line numberDiff line change
@@ -315,7 +315,7 @@ <h2>OPL &ndash; Optimisation problem library</h2>
315315
</tr>
316316
<tr>
317317
<td>CFD</td>
318-
<td></td>
318+
<td>expensive evaluations 30s-15m</td>
319319
<td>suite</td>
320320
<td>1-2</td>
321321
<td>scalable</td>
@@ -330,7 +330,7 @@ <h2>OPL &ndash; Optimisation problem library</h2>
330330
</tr>
331331
<tr>
332332
<td>GBEA</td>
333-
<td></td>
333+
<td>expensive evaluations 5s-35s</td>
334334
<td>suite</td>
335335
<td>1-2</td>
336336
<td>scalable</td>
@@ -345,7 +345,7 @@ <h2>OPL &ndash; Optimisation problem library</h2>
345345
</tr>
346346
<tr>
347347
<td>Car structure</td>
348-
<td></td>
348+
<td>54 constraints</td>
349349
<td>suite</td>
350350
<td>2</td>
351351
<td>144-222</td>
@@ -375,7 +375,7 @@ <h2>OPL &ndash; Optimisation problem library</h2>
375375
</tr>
376376
<tr>
377377
<td>JSEC2019</td>
378-
<td></td>
378+
<td>expensive evaluations 3s; 22 constraints</td>
379379
<td>single</td>
380380
<td>1-5</td>
381381
<td>32</td>
@@ -480,7 +480,7 @@ <h2>OPL &ndash; Optimisation problem library</h2>
480480
</tr>
481481
<tr>
482482
<td>SBOX-COST</td>
483-
<td></td>
483+
<td>problems from BBOB but allows instances with the optimum close to the boundary</td>
484484
<td>suite</td>
485485
<td>1</td>
486486
<td>scalable</td>
@@ -495,7 +495,7 @@ <h2>OPL &ndash; Optimisation problem library</h2>
495495
</tr>
496496
<tr>
497497
<td>ρMNK-Landscapes</td>
498-
<td></td>
498+
<td>tunable variable and objective dimensions; tunable multimodality and correlation between objectives</td>
499499
<td>generator</td>
500500
<td>scalable</td>
501501
<td>scalable</td>
@@ -510,7 +510,7 @@ <h2>OPL &ndash; Optimisation problem library</h2>
510510
</tr>
511511
<tr>
512512
<td>mUBQP</td>
513-
<td></td>
513+
<td>tunable variable and objective dimensions; tunable density and correlation between objectives</td>
514514
<td>generator</td>
515515
<td>scalable</td>
516516
<td>scalable</td>
@@ -525,7 +525,7 @@ <h2>OPL &ndash; Optimisation problem library</h2>
525525
</tr>
526526
<tr>
527527
<td>ρmTSP</td>
528-
<td></td>
528+
<td>tunable variable and objective dimensions; tunable instance type (euclidian/random); tunable correlation between objectives</td>
529529
<td>generator</td>
530530
<td>scalable</td>
531531
<td>scalable</td>
@@ -555,7 +555,7 @@ <h2>OPL &ndash; Optimisation problem library</h2>
555555
</tr>
556556
<tr>
557557
<td>Ealain</td>
558-
<td></td>
558+
<td>Real-world-like, easily extensible to increase complexity</td>
559559
<td>generator</td>
560560
<td>1+</td>
561561
<td>scalable</td>
@@ -564,13 +564,13 @@ <h2>OPL &ndash; Optimisation problem library</h2>
564564
<td>optional</td>
565565
<td>no</td>
566566
<td>optional</td>
567-
<td></td>
567+
<td>Real-world-like</td>
568568
<td><a href="https://doi.org/10.1145/3638530.3654299" target="_blank">https://doi.org/10.1145/3638530.3654299</a></td>
569569
<td><a href="https://github.com/qrenau/Ealain" target="_blank">https://github.com/qrenau/Ealain</a></td>
570570
</tr>
571571
<tr>
572572
<td>MA-BBOB</td>
573-
<td></td>
573+
<td>Generator that creates affine combinations of BBOB functions</td>
574574
<td>generator</td>
575575
<td>1</td>
576576
<td>scalable</td>
@@ -579,13 +579,13 @@ <h2>OPL &ndash; Optimisation problem library</h2>
579579
<td>no</td>
580580
<td>no</td>
581581
<td>no</td>
582-
<td></td>
582+
<td>artificial</td>
583583
<td><a href="https://doi.org/10.1145/3673908" target="_blank">https://doi.org/10.1145/3673908</a></td>
584584
<td><a href="https://github.com/IOHprofiler/IOHexperimenter/blob/master/example/Competitions/MA-BBOB/Example_MABBOB.ipynb" target="_blank">https://github.com/IOHprofiler/IOHexperimenter/blob/master/example/Competitions/MA-BBOB/Example_MABBOB.ipynb</a></td>
585585
</tr>
586586
<tr>
587587
<td>MPM2</td>
588-
<td></td>
588+
<td>nonlinear nonseparable nonsymmetric; scalable in terms of time to evaluate the objective function</td>
589589
<td>generator</td>
590590
<td>1</td>
591591
<td>scalable</td>
@@ -600,7 +600,7 @@ <h2>OPL &ndash; Optimisation problem library</h2>
600600
</tr>
601601
<tr>
602602
<td>Convex DTLZ2</td>
603-
<td></td>
603+
<td>Variant of DTLZ2 with a convex Pareto front (instead of concave)</td>
604604
<td>single</td>
605605
<td>2+</td>
606606
<td>scalable</td>
@@ -615,7 +615,7 @@ <h2>OPL &ndash; Optimisation problem library</h2>
615615
</tr>
616616
<tr>
617617
<td>Inverted DTLZ1</td>
618-
<td></td>
618+
<td>Variant of DTLZ1 with an inverted Pareto front</td>
619619
<td>single</td>
620620
<td>2+</td>
621621
<td>scalable</td>
@@ -630,7 +630,7 @@ <h2>OPL &ndash; Optimisation problem library</h2>
630630
</tr>
631631
<tr>
632632
<td>Minus DTLZ</td>
633-
<td></td>
633+
<td>Variant of DTLZ that minimises the inverse of the base DTLZ functions</td>
634634
<td>suite</td>
635635
<td>2+</td>
636636
<td>scalable</td>
@@ -645,7 +645,7 @@ <h2>OPL &ndash; Optimisation problem library</h2>
645645
</tr>
646646
<tr>
647647
<td>Minus WFG</td>
648-
<td></td>
648+
<td>Variant of WFG that minimises the inverse of the base WFG functions</td>
649649
<td>suite</td>
650650
<td>2+</td>
651651
<td>scalable</td>
@@ -660,7 +660,7 @@ <h2>OPL &ndash; Optimisation problem library</h2>
660660
</tr>
661661
<tr>
662662
<td>L1-ZDT</td>
663-
<td></td>
663+
<td>Variant of ZDT with linkages between variables within one of two groups but not between variables in a different group; Linear recombination operators can potentially take advantage of the problem structure</td>
664664
<td>suite</td>
665665
<td>2</td>
666666
<td>scalable</td>
@@ -675,7 +675,7 @@ <h2>OPL &ndash; Optimisation problem library</h2>
675675
</tr>
676676
<tr>
677677
<td>L2-ZDT</td>
678-
<td></td>
678+
<td>Variant of ZDT with linkages between all variables; Linear recombination operators can potentially take advantage of the problem structure</td>
679679
<td>suite</td>
680680
<td>2</td>
681681
<td>scalable</td>
@@ -690,7 +690,7 @@ <h2>OPL &ndash; Optimisation problem library</h2>
690690
</tr>
691691
<tr>
692692
<td>L3-ZDT</td>
693-
<td></td>
693+
<td>Variant of L2-ZDT using a mapping to prevent linear recombination operators from potentially taking advantage of the problem structure</td>
694694
<td>suite</td>
695695
<td>2</td>
696696
<td>scalable</td>
@@ -705,7 +705,7 @@ <h2>OPL &ndash; Optimisation problem library</h2>
705705
</tr>
706706
<tr>
707707
<td>L2-DTLZ</td>
708-
<td></td>
708+
<td>Variant of DTLZ2 and DTLZ3 with linkages between all variables; Linear recombination operators can potentially take advantage of the problem structure</td>
709709
<td>suite</td>
710710
<td>2+</td>
711711
<td>scalable</td>
@@ -720,7 +720,7 @@ <h2>OPL &ndash; Optimisation problem library</h2>
720720
</tr>
721721
<tr>
722722
<td>L3-DTLZ</td>
723-
<td></td>
723+
<td>Variant of L2-DTLZ using a mapping to prevent linear recombination operators from potentially taking advantage of the problem structure</td>
724724
<td>suite</td>
725725
<td>2+</td>
726726
<td>scalable</td>
@@ -750,7 +750,7 @@ <h2>OPL &ndash; Optimisation problem library</h2>
750750
</tr>
751751
<tr>
752752
<td>MODAct - multiobjective design of actuators</td>
753-
<td>Realistic Constrained Multi-Objective Optimization Benchmark Problems from Design</td>
753+
<td>Realistic Constrained Multi-Objective Optimization Benchmark Problems from Design. Need the https://github.com/epfl-lamd/modact package installed; evaluation times around 20ms</td>
754754
<td>suite</td>
755755
<td>2 3 4 or 5</td>
756756
<td>20</td>
@@ -765,7 +765,7 @@ <h2>OPL &ndash; Optimisation problem library</h2>
765765
</tr>
766766
<tr>
767767
<td>IOHClustering</td>
768-
<td>Set of benchmark problems from clustering: optimization task is selecting cluster centers for a given set of data, with the number of clusters defining problem dimensionality. Includes both a suite and a generator</td>
768+
<td>Set of benchmark problems from clustering: optimization task is selecting cluster centers for a given set of data, with the number of clusters defining problem dimensionality. Includes both a suite and a generator. Based on ML clustering datasets</td>
769769
<td>suite; generator</td>
770770
<td>1</td>
771771
<td>scalable</td>
@@ -780,7 +780,7 @@ <h2>OPL &ndash; Optimisation problem library</h2>
780780
</tr>
781781
<tr>
782782
<td>GNBG-II</td>
783-
<td>Generalized Numerical Benchmark Generator (version 2)</td>
783+
<td>Generalized Numerical Benchmark Generator (version 2). Also in IOH https://github.com/IOHprofiler/IOHGNBG</td>
784784
<td>suite; generator</td>
785785
<td>1</td>
786786
<td>scalable</td>
@@ -870,7 +870,7 @@ <h2>OPL &ndash; Optimisation problem library</h2>
870870
</tr>
871871
<tr>
872872
<td>CEC2013</td>
873-
<td>suite used for cec2013 competition</td>
873+
<td>suite used for cec2013 competition. Also in IOH https://github.com/IOHprofiler/IOHexperimenter</td>
874874
<td>suite</td>
875875
<td>1</td>
876876
<td>scalable</td>
@@ -885,7 +885,7 @@ <h2>OPL &ndash; Optimisation problem library</h2>
885885
</tr>
886886
<tr>
887887
<td>CEC2022</td>
888-
<td>suite used for cec2022 competition</td>
888+
<td>suite used for cec2022 competition. Also in IOH https://github.com/IOHprofiler/IOHexperimenter</td>
889889
<td>suite</td>
890890
<td>1</td>
891891
<td>scalable</td>

0 commit comments

Comments
 (0)