paper-with-me

홈 › Papers

Solution Subset Selection for Final Decision Making in Evolutionary Multi-Objective Optimization

2020-06-15 · Hisao Ishibuchi, Lie Meng Pang, Ke Shang

In general, a multi-objective optimization problem does not have a single optimal solution but a set of Pareto optimal solutions, which forms the Pareto front in the objective space. Various evolutionary algorithms have been proposed to approximate the Pareto front using a pre-specified number of solutions. Hundreds of solutions are obtained by their single run. The selection of a single final solution from the obtained solutions is assumed to be done by a human decision maker. However, in many cases, the decision maker does not want to examine hundreds of solutions. Thus, it is needed to select a small subset of the obtained solutions. In this paper, we discuss subset selection from a viewpoint of the final decision making. First we briefly explain existing subset selection studies. Next we formulate an expected loss function for subset selection. We also show that the formulated function is the same as the IGD plus indicator. Then we report experimental results where the proposed approach is compared with other indicator-based subset selection methods.

📄 PDF Abstract BibTeX arXiv:2006.08156

Code (0)

등록된 구현이 없습니다.

Tasks

Decision MakingEvolutionary Algorithms

Similar Papers 제목 키워드 기반

Fair Feature Subset Selection using Multiobjective Genetic Algorithm

2022-04-30 · Ayaz Ur Rehman, Anas Nadeem, Muhammad Zubair Malik

The feature subset selection problem aims at selecting the relevant subset of features to improve the performance of a Machine Learning (ML) algorithm on training data. Some features in data can be inherently noisy, cost…

BIG-bench Machine LearningDecision MakingFairnessfeature selection

Benchmarking Subset Selection from Large Candidate Solution Sets in Evolutionary Multi-objective Optimization

2022-01-18 · Ke Shang, Tianye Shu, Hisao Ishibuchi, Yang Nan 외

In the evolutionary multi-objective optimization (EMO) field, the standard practice is to present the final population of an EMO algorithm as the output. However, it has been shown that the final population often include…

Benchmarking

SubCDM: Collective Decision-Making with a Swarm Subset

2025-08-01 · Samratul Fuady, Danesh Tarapore, Mohammad D. Soorati arxiv

Collective decision-making is a key function of autonomous robot swarms, enabling them to reach a consensus on actions based on environmental features. Existing strategies require the participation of all robots in the d…

Towards Decision Support in Dynamic Bi-Objective Vehicle Routing

2020-05-28 · Jakob Bossek, Christian Grimme, Günter Rudolph, Heike Trautmann

We consider a dynamic bi-objective vehicle routing problem, where a subset of customers ask for service over time. Therein, the distance traveled by a single vehicle and the number of unserved dynamic requests is minimiz…

Decision MakingDiversity

Extractive Explanations for Interpretable Text Ranking

2021-06-23 · Jurek Leonhardt, Koustav Rudra, Avishek Anand

Neural document ranking models perform impressively well due to superior language understanding gained from pre-training tasks. However, due to their complexity and large number of parameters, these (typically transforme…

Document RankingRetrievalSentence