EUVIMEDEUVIMED entdecken
Crossref

Speeding Up Local Search for the Indicator-Based Subset Selection Problem by a Candidate List Strategy

Keisuke Korogi, Ryoji Tanabe

IEEE Transactions on Evolutionary Computation · 2026-02 · 30 (1) · 156-170

DOI: 10.1109/tevc.2025.3538902 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Evolutionary Computation, 2026-02. Verfasst von Keisuke Korogi und 1 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 49 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In evolutionary multiobjective optimization, the indicator-based subset selection problem (ISSP) involves finding a subset of points that maximizes a given quality indicator. Local search (LS) is an effective approach for obtaining a high-quality subset in this problem. However, LS requires high computational cost, especially as the size of the point set and the number of objectives increase. To address this issue, this article proposes a candidate list strategy for LS in the ISSP. In the proposed strategy, each point in a given point set has a candidate list. During search, each point is only eligible to swap with unselected points in its associated candidate list. This restriction drastically reduces the number of swaps at each iteration of LS. We consider two types of candidate lists: 1) nearest neighbor list and 2) random neighbor list. This article investigates the effectiveness of the proposed candidate list strategy on various Pareto fronts (PFs). The results show that the proposed strategy with the nearest neighbor list can significantly speed up LS on continuous PFs without significantly compromising the subset quality. The results also show that the sequential use of the two lists can address the discontinuity of PFs.

Zitieren

APA

Korogi, K., & Tanabe, R. (2026). Speeding Up Local Search for the Indicator-Based Subset Selection Problem by a Candidate List Strategy. IEEE Transactions on Evolutionary Computation, 30(1), 156-170. https://doi.org/10.1109/tevc.2025.3538902

Vancouver

Korogi K, Tanabe R. Speeding Up Local Search for the Indicator-Based Subset Selection Problem by a Candidate List Strategy. IEEE Transactions on Evolutionary Computation. 2026;30(1):156-170. doi:10.1109/tevc.2025.3538902

BibTeX
@article{Korogi2026,
  author = {Korogi, Keisuke and Tanabe, Ryoji},
  title = {Speeding Up Local Search for the Indicator-Based Subset Selection Problem by a Candidate List Strategy},
  journal = {IEEE Transactions on Evolutionary Computation},
  year = {2026},
  volume = {30},
  number = {1},
  pages = {156--170},
  doi = {10.1109/tevc.2025.3538902}
}
Kostenlos starten →