Journal article · 2020 · Open access
Does Preference Always Help? A Holistic Study on Preference-Based Evolutionary Multiobjective Optimization Using Reference Points
IEEE Transactions on Evolutionary Computation, 24(6), 1078–1096 · Published 14 April 2020 · DOI 10.1109/tevc.2020.2987559
In brief
“Does Preference Always Help? A Holistic Study on Preference-Based Evolutionary Multiobjective Optimization Using Reference Points” is a 2020 journal article by Ke Li and 4 co-authors, published in IEEE Transactions on Evolutionary Computation. OpenAlex counts 91 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 91
- Most cited in
- 2023 (19)
- Field-weighted impact
- 8.35
- References
- 117
- Authors
- 5
Abstract
The ultimate goal of multiobjective optimization is to help a decision maker (DM) identify solution(s) of interest (SOI) achieving satisfactory tradeoffs among multiple conflicting criteria. This can be realized by leveraging DM's preference information in evolutionary multiobjective optimization (EMO). No consensus has been reached on the effectiveness brought by incorporating preference in EMO (either a priori or interactively) versus a posteriori decision making after a complete run of an EMO algorithm. Bearing this consideration in mind, this article: 1) provides a pragmatic overview of the existing developments of preference-based EMO (PBEMO) and 2) conducts a series of experiments to investigate the effectiveness brought by preference incorporation in EMO for approximating various SOI. In particular, the DM's preference information is elicited as a reference point, which represents her/his aspirations for different objectives. The experimental results demonstrate that preference incorporation in EMO does not always lead to a desirable approximation of SOI if the DM's preference information is not well utilized, nor does the DM elicit invalid preference information, which is not uncommon when encountering a black-box system. To a certain extent, this issue can be remedied through an interactive preference elicitation. Last but not the least, we find that a PBEMO algorithm is able to be generalized to approximate the whole PF given an appropriate setup of preference information.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Li, K., Liao, M., Deb, K., Min, G., & Yao, X. (2020). Does Preference Always Help? A Holistic Study on Preference-Based Evolutionary Multiobjective Optimization Using Reference Points. IEEE Transactions on Evolutionary Computation, 24(6), 1078–1096. https://doi.org/10.1109/tevc.2020.2987559
MLA 9
Li, Ke, et al. “Does Preference Always Help? A Holistic Study on Preference-Based Evolutionary Multiobjective Optimization Using Reference Points.” IEEE Transactions on Evolutionary Computation, vol. 24, no. 6, 2020, pp. 1078–1096. https://doi.org/10.1109/tevc.2020.2987559.
Chicago
Li, Ke, Minhui Liao, Kalyanmoy Deb, Geyong Min, and Xin Yao. 2020. “Does Preference Always Help? A Holistic Study on Preference-Based Evolutionary Multiobjective Optimization Using Reference Points.” IEEE Transactions on Evolutionary Computation 24 (6): 1078–1096. https://doi.org/10.1109/tevc.2020.2987559.
Harvard
Li, K. et al. (2020) ‘Does Preference Always Help? A Holistic Study on Preference-Based Evolutionary Multiobjective Optimization Using Reference Points’, IEEE Transactions on Evolutionary Computation, 24(6), pp. 1078–1096. doi:10.1109/tevc.2020.2987559.
IEEE
K. Li, M. Liao, K. Deb, G. Min, and X. Yao, “Does Preference Always Help? A Holistic Study on Preference-Based Evolutionary Multiobjective Optimization Using Reference Points,” IEEE Transactions on Evolutionary Computation, vol. 24, no. 6, pp. 1078–1096, 2020, doi: 10.1109/tevc.2020.2987559.
BibTeX
@article{li2020does,
title = {{Does Preference Always Help? A Holistic Study on Preference-Based Evolutionary Multiobjective Optimization Using Reference Points}},
author = {Li, Ke and Liao, Minhui and Deb, Kalyanmoy and Min, Geyong and Yao, Xin},
journal = {IEEE Transactions on Evolutionary Computation},
year = {2020},
volume = {24},
number = {6},
pages = {1078--1096},
doi = {10.1109/tevc.2020.2987559},
url = {https://doi.org/10.1109/tevc.2020.2987559}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2018 | 1 | |
| 2020 | 1 | |
| 2021 | 16 | |
| 2022 | 16 | |
| 2023 | 19 | |
| 2024 | 13 | |
| 2025 | 8 | |
| 2026 | 17 |
Its field-weighted citation impact is 8.35: it has been cited 8.35 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms
- reference points
- preference elicitation
- Pareto front approximation
- decision maker preferences
- black-box systems
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Li, K., Liao, M., Deb, K., Min, G., & Yao, X. (2020). Does Preference Always Help? A Holistic Study on Preference-Based Evolutionary Multiobjective Optimization Using Reference Points. IEEE Transactions on Evolutionary Computation, 24(6), 1078–1096. https://doi.org/10.1109/tevc.2020.2987559
How many times has this paper been cited?
91 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.
Who wrote this paper?
Ke Li, Minhui Liao, Kalyanmoy Deb, Geyong Min, Xin Yao.
What is the DOI of this paper?
10.1109/tevc.2020.2987559, permanently at https://doi.org/10.1109/tevc.2020.2987559. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.