@@ -101,7 +101,7 @@ <h2>OPL – Optimisation problem library</h2>
101101 < td > </ td >
102102 < td > Parameters of the modules of the Automatic Train Operation are optimized; Parameters for the trajectory planning (first module) are maximum velocity (v_max), weighting of objectives (energy, time, comfort) in planning (lambda_e, lambda_s, lambda_t), step width (ds), maximum lateral acceleration (aq_max); as control module a PID controller is implemented, where the ki and kp parameters are optimized. The objectives are minimizing travel time and energy consumption. The evaluation takes several minutes, because the pipeline includes also a simulation.</ td >
103103 < td > </ td >
104- < td > Carolin Mensendiek; Henrik Zeipel; Oliver Ludger Preuß; Moritz Vinzent Seiler; Walter Sextro; Heike Trautmann, < a href ="https://doi.org/10.1145/3795101.3805368 "> https://doi.org/10.1145/3795101.3805368</ a > | Multi-Objective Pipeline Optimisation and Configuration of Automatic Train Operation Trajectories </ td >
104+ < td > Multi-Objective Pipeline Optimisation and Configuration of Automatic Train Operation Trajectories, Carolin Mensendiek; Henrik Zeipel; Oliver Ludger Preuß; Moritz Vinzent Seiler; Walter Sextro; Heike Trautmann, < a href ="https://doi.org/10.1145/3795101.3805368 "> https://doi.org/10.1145/3795101.3805368</ a > </ td >
105105 < td > </ td >
106106 < td > unimodal</ td >
107107 < td > </ td >
@@ -132,7 +132,7 @@ <h2>OPL – Optimisation problem library</h2>
132132 < td > > =2</ td >
133133 < td > 2</ td >
134134 < td > </ td >
135- < td > unknown | box </ td >
135+ < td > box | unknown </ td >
136136 < td > > =2</ td >
137137 < td > </ td >
138138 < td > </ td >
@@ -154,7 +154,7 @@ <h2>OPL – Optimisation problem library</h2>
154154 < td > </ td >
155155 < td > BSO-toolbox</ td >
156156 < td > C++</ td >
157- < td > {'1 second ', '40 seconds '}</ td >
157+ < td > {'40 seconds ', '1 second '}</ td >
158158 < td > < a href ="https://github.com/TUe-excellent-buildings/BSO-toolbox "> https://github.com/TUe-excellent-buildings/BSO-toolbox</ a > </ td >
159159 < td > Building Spatial Design toolbox (TU/e)</ td >
160160 < td > </ td >
@@ -214,7 +214,7 @@ <h2>OPL – Optimisation problem library</h2>
214214 < td > 26</ td >
215215 < td > 1</ td >
216216 < td > noisy</ td >
217- < td > unknown | box </ td >
217+ < td > box | unknown </ td >
218218 < td > > =14</ td >
219219 < td > </ td >
220220 < td > noisy</ td >
@@ -661,7 +661,7 @@ <h2>OPL – Optimisation problem library</h2>
661661 < td > gen_ealain</ td >
662662 < td > Ealain</ td >
663663 < td > Generator</ td >
664- < td > binary | integer | continuous </ td >
664+ < td > binary | continuous | integer </ td >
665665 < td > > =3</ td >
666666 < td > [1, 10, 2, 3, 4, 5, 6, 7, 8, 9]</ td >
667667 < td > dynamic | multi-fidelity</ td >
@@ -890,11 +890,11 @@ <h2>OPL – Optimisation problem library</h2>
890890 < td > </ td >
891891 < td > > =1</ td >
892892 < td > </ td >
893- < td > IOHexperimenter | MA-BBOB (IOHexperimenter)</ td >
893+ < td > MA-BBOB (IOHexperimenter) | IOHexperimenter </ td >
894894 < td > C++/Python</ td >
895895 < td > </ td >
896- < td > < a href ="https://github.com/IOHprofiler/IOHexperimenter "> https://github.com/IOHprofiler/IOHexperimenter</ a > | < a href ="https://github.com/IOHprofiler/IOHexperimenter/blob/master/example/Competitions/MA-BBOB/Example_MABBOB.ipynb "> https://github.com/IOHprofiler/IOHexperimenter/blob/master/example/Competitions/MA-BBOB/Example_MABBOB.ipynb </ a > </ td >
897- < td > IOHprofiler experimenter framework | Example notebook for MA-BBOB in IOHexperimenter</ td >
896+ < td > < a href ="https://github.com/IOHprofiler/IOHexperimenter/blob/master/example/Competitions/MA-BBOB/Example_MABBOB.ipynb "> https://github.com/IOHprofiler/IOHexperimenter/blob/master/example/Competitions/MA-BBOB/Example_MABBOB.ipynb </ a > | < a href ="https://github.com/IOHprofiler/IOHexperimenter "> https://github.com/IOHprofiler/IOHexperimenter</ a > </ td >
897+ < td > Example notebook for MA-BBOB in IOHexperimenter | IOHprofiler experimenter framework </ td >
898898 < td > </ td >
899899 < td > </ td >
900900 < td > </ td >
@@ -1030,7 +1030,7 @@ <h2>OPL – Optimisation problem library</h2>
10301030 < td > gen_randoptgen</ td >
10311031 < td > RandOptGen</ td >
10321032 < td > Generator</ td >
1033- < td > binary | integer | continuous </ td >
1033+ < td > binary | continuous | integer </ td >
10341034 < td > > =3</ td >
10351035 < td > [1, 10, 2, 3, 4, 5, 6, 7, 8, 9]</ td >
10361036 < td > </ td >
@@ -1194,7 +1194,7 @@ <h2>OPL – Optimisation problem library</h2>
11941194 < td > suite_amvop</ td >
11951195 < td > AMVOP</ td >
11961196 < td > Suite</ td >
1197- < td > categorical | integer | continuous </ td >
1197+ < td > categorical | continuous | integer </ td >
11981198 < td > > =3</ td >
11991199 < td > 1</ td >
12001200 < td > </ td >
@@ -1525,7 +1525,7 @@ <h2>OPL – Optimisation problem library</h2>
15251525 < td > continuous</ td >
15261526 < td > > =1</ td >
15271527 < td > [10, 2, 3, 4, 5, 6, 7, 8, 9]</ td >
1528- < td > noisy </ td >
1528+ < td > </ td >
15291529 < td > </ td >
15301530 < td > </ td >
15311531 < td > </ td >
@@ -1648,7 +1648,7 @@ <h2>OPL – Optimisation problem library</h2>
16481648 < td > continuous</ td >
16491649 < td > > =1</ td >
16501650 < td > [10, 2, 3, 4, 5, 6, 7, 8, 9]</ td >
1651- < td > dynamic | noisy </ td >
1651+ < td > </ td >
16521652 < td > unknown</ td >
16531653 < td > > =1</ td >
16541654 < td > unknown</ td >
@@ -1710,11 +1710,11 @@ <h2>OPL – Optimisation problem library</h2>
17101710 < td > </ td >
17111711 < td > > =1</ td >
17121712 < td > </ td >
1713- < td > IOHexperimenter | CEC2013 reference code</ td >
1713+ < td > CEC2013 reference code | IOHexperimenter </ td >
17141714 < td > C++/Python</ td >
17151715 < td > </ td >
1716- < td > < a href ="https://github.com/IOHprofiler/IOHexperimenter "> https://github.com/IOHprofiler/IOHexperimenter </ a > | < a href ="https://github.com/P-N-Suganthan/CEC2013 "> https://github.com/P-N-Suganthan/CEC2013 </ a > </ td >
1717- < td > IOHprofiler experimenter framework | Suganthan's reference implementation</ td >
1716+ < td > < a href ="https://github.com/P-N-Suganthan/CEC2013 "> https://github.com/P-N-Suganthan/CEC2013 </ a > | < a href ="https://github.com/IOHprofiler/IOHexperimenter "> https://github.com/IOHprofiler/IOHexperimenter </ a > </ td >
1717+ < td > Suganthan's reference implementation | IOHprofiler experimenter framework </ td >
17181718 < td > </ td >
17191719 < td > </ td >
17201720 < td > </ td >
@@ -1833,11 +1833,11 @@ <h2>OPL – Optimisation problem library</h2>
18331833 < td > </ td >
18341834 < td > > =1</ td >
18351835 < td > </ td >
1836- < td > IOHexperimenter | CEC2022 reference code</ td >
1836+ < td > CEC2022 reference code | IOHexperimenter </ td >
18371837 < td > C++/Python</ td >
18381838 < td > </ td >
1839- < td > < a href ="https://github.com/IOHprofiler/IOHexperimenter "> https://github.com/IOHprofiler/IOHexperimenter </ a > | < a href ="https://github.com/P-N-Suganthan/2022-SO-BO "> https://github.com/P-N-Suganthan/2022-SO-BO </ a > </ td >
1840- < td > IOHprofiler experimenter framework | Suganthan's reference implementation</ td >
1839+ < td > < a href ="https://github.com/P-N-Suganthan/2022-SO-BO "> https://github.com/P-N-Suganthan/2022-SO-BO </ a > | < a href ="https://github.com/IOHprofiler/IOHexperimenter "> https://github.com/IOHprofiler/IOHexperimenter </ a > </ td >
1840+ < td > Suganthan's reference implementation | IOHprofiler experimenter framework </ td >
18411841 < td > </ td >
18421842 < td > </ td >
18431843 < td > </ td >
@@ -1876,7 +1876,7 @@ <h2>OPL – Optimisation problem library</h2>
18761876 < td > </ td >
18771877 < td > CFD test problem suite</ td >
18781878 < td > </ td >
1879- < td > {'15m ', '30s '}</ td >
1879+ < td > {'30s ', '15m '}</ td >
18801880 < td > < a href ="https://bitbucket.org/arahat/cfd-test-problem-suite "> https://bitbucket.org/arahat/cfd-test-problem-suite</ a > </ td >
18811881 < td > Expensive real-world CFD-based test problems</ td >
18821882 < td > </ td >
@@ -1932,7 +1932,7 @@ <h2>OPL – Optimisation problem library</h2>
19321932 < td > suite_cuter</ td >
19331933 < td > CUTEr</ td >
19341934 < td > Suite</ td >
1935- < td > binary | integer | continuous </ td >
1935+ < td > binary | continuous | integer </ td >
19361936 < td > > =3</ td >
19371937 < td > 1</ td >
19381938 < td > </ td >
@@ -1973,11 +1973,11 @@ <h2>OPL – Optimisation problem library</h2>
19731973 < td > suite_cutest</ td >
19741974 < td > CUTEst</ td >
19751975 < td > Suite</ td >
1976- < td > binary | integer | continuous </ td >
1976+ < td > binary | continuous | integer </ td >
19771977 < td > > =3</ td >
19781978 < td > 1</ td >
19791979 < td > </ td >
1980- < td > unknown | box </ td >
1980+ < td > box | unknown </ td >
19811981 < td > > =2</ td >
19821982 < td > </ td >
19831983 < td > </ td >
@@ -2178,11 +2178,11 @@ <h2>OPL – Optimisation problem library</h2>
21782178 < td > suite_expobench</ td >
21792179 < td > EXPObench</ td >
21802180 < td > Suite</ td >
2181- < td > continuous | integer | categorical </ td >
2181+ < td > categorical | continuous | integer </ td >
21822182 < td > 30-405</ td >
21832183 < td > 1</ td >
21842184 < td > noisy</ td >
2185- < td > unknown | box </ td >
2185+ < td > box | unknown </ td >
21862186 < td > > =2</ td >
21872187 < td > </ td >
21882188 < td > ["observational", "real-life"]</ td >
@@ -2204,7 +2204,7 @@ <h2>OPL – Optimisation problem library</h2>
22042204 < td > 10-135</ td >
22052205 < td > EXPObench</ td >
22062206 < td > Python</ td >
2207- < td > {'80 seconds', '2 seconds'}</ td >
2207+ < td > {'2 seconds', '80 seconds'}</ td >
22082208 < td > < a href ="https://github.com/AlgTUDelft/ExpensiveOptimBenchmark "> https://github.com/AlgTUDelft/ExpensiveOptimBenchmark</ a > </ td >
22092209 < td > EXPensive Optimization benchmark library (wind farm layout, gas filter design, pipe shape, hyperparameter tuning, hospital simulation)</ td >
22102210 < td > </ td >
@@ -2632,7 +2632,7 @@ <h2>OPL – Optimisation problem library</h2>
26322632 < td > continuous</ td >
26332633 < td > > =1</ td >
26342634 < td > [10, 2, 3, 4, 5, 6, 7, 8, 9]</ td >
2635- < td > noisy </ td >
2635+ < td > </ td >
26362636 < td > </ td >
26372637 < td > </ td >
26382638 < td > </ td >
@@ -2696,7 +2696,7 @@ <h2>OPL – Optimisation problem library</h2>
26962696 < td > </ td >
26972697 < td > MECHBench</ td >
26982698 < td > Python</ td >
2699- < td > {'1 minute ', '7 minutes '}</ td >
2699+ < td > {'7 minutes ', '1 minute '}</ td >
27002700 < td > < a href ="https://github.com/BayesOptApp/MECHBench "> https://github.com/BayesOptApp/MECHBench</ a > </ td >
27012701 < td > Structural mechanics design optimization benchmark</ td >
27022702 < td > </ td >
@@ -2919,7 +2919,7 @@ <h2>OPL – Optimisation problem library</h2>
29192919 < td > unknown</ td >
29202920 < td > 0</ td >
29212921 < td > 2</ td >
2922- < td > dynamic | noisy </ td >
2922+ < td > </ td >
29232923 < td > unknown</ td >
29242924 < td > > =1</ td >
29252925 < td > unknown</ td >
@@ -3039,7 +3039,7 @@ <h2>OPL – Optimisation problem library</h2>
30393039 < td > suite_re</ td >
30403040 < td > RE</ td >
30413041 < td > Suite</ td >
3042- < td > integer | continuous </ td >
3042+ < td > continuous | integer </ td >
30433043 < td > 4-14</ td >
30443044 < td > [2, 3, 4, 5, 6, 7, 8, 9]</ td >
30453045 < td > </ td >
@@ -3080,7 +3080,7 @@ <h2>OPL – Optimisation problem library</h2>
30803080 < td > suite_rwmvop</ td >
30813081 < td > RWMVOP</ td >
30823082 < td > Suite</ td >
3083- < td > categorical | integer | continuous </ td >
3083+ < td > categorical | continuous | integer </ td >
30843084 < td > > =3</ td >
30853085 < td > 1</ td >
30863086 < td > </ td >
@@ -3165,7 +3165,7 @@ <h2>OPL – Optimisation problem library</h2>
31653165 < td > continuous</ td >
31663166 < td > > =1</ td >
31673167 < td > [10, 2, 3, 4, 5, 6, 7, 8, 9]</ td >
3168- < td > dynamic | noisy </ td >
3168+ < td > dynamic</ td >
31693169 < td > </ td >
31703170 < td > </ td >
31713171 < td > dynamic</ td >
@@ -3247,7 +3247,7 @@ <h2>OPL – Optimisation problem library</h2>
32473247 < td > continuous</ td >
32483248 < td > > =1</ td >
32493249 < td > 1</ td >
3250- < td > noisy | multi-fidelity</ td >
3250+ < td > multi-fidelity | noisy </ td >
32513251 < td > unknown</ td >
32523252 < td > > =2</ td >
32533253 < td > </ td >
@@ -3270,7 +3270,7 @@ <h2>OPL – Optimisation problem library</h2>
32703270 < td > </ td >
32713271 < td > TulipaEnergyModel.jl</ td >
32723272 < td > Julia / JuMP</ td >
3273- < td > {'minutes ', 'hours '}</ td >
3273+ < td > {'hours ', 'minutes '}</ td >
32743274 < td > < a href ="https://tulipaenergy.github.io/TulipaEnergyModel.jl/stable/ "> https://tulipaenergy.github.io/TulipaEnergyModel.jl/stable/</ a > | < a href ="https://github.com/TulipaEnergy/Tulipa-OBZ-CaseStudy "> https://github.com/TulipaEnergy/Tulipa-OBZ-CaseStudy</ a > </ td >
32753275 < td > Large linear program for optimal investment and operation of energy systems</ td >
32763276 < td > </ td >
0 commit comments