Many-objective optimization problems (MaOPs) usually contain more than three objectives to be optimized simultaneously, which are extended from multi-objective optimization problems (MOPs). Due to the conflicts often arising in different objectives of MOPs, there exists no single optimal solution, but a set of trade-off solutions termed Pareto-optimal set (PS), and the mapping of PS on the objective space is termed Pareto-optimal front (PF) . During the last decades, evolutionary algorithms have become the popular and effective approach for tackling MOPs and MaOPs.
-
Notifications
You must be signed in to change notification settings - Fork 1
Many-objective optimization problems (MaOPs) usually contain more than three objectives to be optimized simultaneously, which are extended from multi-objective optimization problems (MOPs). Due to the conflicts often arising in different objectives of MOPs, there exists no single optimal solution, but a set of trade-off solutions termed Pareto-o…
songbai-liu/ManyobjectiveParticleSwarmOptimization
About
Many-objective optimization problems (MaOPs) usually contain more than three objectives to be optimized simultaneously, which are extended from multi-objective optimization problems (MOPs). Due to the conflicts often arising in different objectives of MOPs, there exists no single optimal solution, but a set of trade-off solutions termed Pareto-o…
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published