search

ash-aldujaili / BMOBench

Black-Box Multi-Objective Optimization Benchmarking Platform
Other
12 stars 12 forks source link

Question: About large-scale and discrete BBMO-Benchmarking #9

Open foufa89 opened 5 years ago

foufa89 commented 5 years ago

Dear @ash-aldujaili;

I would like to test the performance of a modified algorithm developed to solve a real-world problem that has these characteristics : (1)Multi-Objective (2)Discrete (3) Black-box (4)Large-scale.

How we can do this if it is possible? and if there are no such test problems, is it sufficient to show its performance on the real-world problem only? (where the true Pareto Front is unknown)

Best regards,

ash-aldujaili commented 5 years ago

Hi @foufa89,

For bi-objective, discrete, and black-box, you can refer to https://numbbo.github.io/workshops/BBOB-2019/index.html

I am not aware of large-scale, multiobjective benchmarks.

foufa89 commented 5 years ago

Thank you,

If some test problems of these BBOBenchmarks ( https://numbbo.github.io/workshops/BBOB-2019/index.html) are scalable, I think that we can have the 4 needed characteristics!! or no?

For large-scale multi-objective benchmarks: Cheng, R., Jin, Y., & Olhofer, M. (2017). Test problems for large-scale multiobjective and many-objective optimization. IEEE transactions on cybernetics, 47(12), 4108-4121.