Decomposition-based algorithms seem promising for many-objective optimization problems. However, the issue of selecting a set of weighting vectors for more than two objectives is still unresolved and ad-hoc methods are predominantly used. In the present work, a novel concept is introduced which we call generalized decomposition. Generalized decomposition enables the analyst to adapt the generated distribution of Pareto optimal points, according to the preferences of the decision maker. Also it is shown that generalized decomposition unifies the three performance objectives in multi-objective optimization algorithms to only one, that of convergence to the Pareto front.
Follow Generalized Decomposition
You Might Also Like
Every customer interaction is vital to your business success and revenue growth. With Jiminny’s AI-powered conversation intelligence software, we take recording, capturing, and meticulous analysis of call recordings to the next level. Unlock call analytics that provide actionable insights with our call tracking software, empowering you to identify what's working and what's not. Seamlessly support your biggest objectives across the entire business landscape with our innovative call tracking system.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Generalized Decomposition!