Mathematics > Optimization and Control
[Submitted on 2 Jun 2022]
Title:Detection of Hidden Objectives and Interactive Objective Reduction
View PDFAbstract:In multi-objective optimization problems, there might exist hidden objectives that are important to the decision-maker but are not being optimized. On the other hand, there might also exist irrelevant objectives that are being optimized but are of less importance to the DM. The question that arises here is whether it is possible to detect and reduce irrelevant objectives without deteriorating the quality of the final results? In fact, when dealing with multi-objective problems, each objective implies a significant cost best avoided if possible. However, existing methods that pertain to the reduction of objectives are computationally intensive and ignore the preferences of the decision-maker. In this paper, we propose an approach to exploit the capabilities of interactive evolutionary multi-objective optimization algorithms (EMOAs) and the preference information provided by the decision-maker, to detect and eliminate the irrelevant objectives during the optimization process and replace them with hidden ones, if any. The proposed method, which is based on univariate feature selection, is computationally effective and can be integrated into any ranking-based interactive EMOA. Using synthetic problems developed in this study, we motivate different scenarios in the experiments and prove the effectiveness of the proposed method in improving the computational cost, the total number of objective evaluations, and the quality of the final solutions.
Submission history
From: Seyed Mahdi Shavarani [view email][v1] Thu, 2 Jun 2022 22:05:58 UTC (25,342 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.