Journal article · 2018 · Open access

Interactive Decomposition Multiobjective Optimization Via Progressively Learned Value Functions

Ke Li, Renzhi Chen, Dragan A. Savic, Xin Yao

IEEE Transactions on Fuzzy Systems, 27(5), 849–860 · Published 12 November 2018 · DOI 10.1109/tfuzz.2018.2880700

Open PDFView at the publisherCite this paper

In brief

“Interactive Decomposition Multiobjective Optimization Via Progressively Learned Value Functions” is a 2018 journal article by Ke Li and 3 co-authors, published in IEEE Transactions on Fuzzy Systems. OpenAlex counts 68 citations as of 19 November 2026, which puts it in the top 8% of works published in 2018 by citations. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
68
Most cited in
2020 (16)
Field-weighted impact
5.93
References
75
Authors
4

Abstract

Decomposition has become an increasingly popular technique for evolutionary multiobjective optimization (EMO). A decomposition-based EMO algorithm is usually designed to approximate a whole Pareto-optimal front (PF). However, in practice, a decision maker (DM) might only be concerned in her/his region of interest (ROI), i.e., a part of the PF. Solutions outside that might be useless or even noisy to the decision-making procedure. Furthermore, there is no guarantee that the preferred solutions will be found when many-objective problems. This paper develops an interactive framework for the decomposition-based EMO algorithm to lead a DM to the preferred solutions of her/his choice. It consists of three modules, i.e., consultation, preference elicitation, and optimization. Specifically, after every several generations, the DM is asked to score a few candidate solutions in a consultation session. Thereafter, an approximated value function, which models the DM's preference information, is progressively learned from the DM's behavior. In the preference elicitation session, the preference information learned in the consultation module is translated into the form that can be used in a decomposition-based EMO algorithm, i.e., a set of reference points that are biased toward the ROI. The optimization module, which can be any decomposition-based EMO algorithm in principle, utilizes the biased reference points to guide its search process. Extensive experiments on benchmark problems with three to ten objectives fully demonstrate the effectiveness of our proposed method for finding the DM's preferred solutions.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Li, K., Chen, R., Savic, D. A., & Yao, X. (2018). Interactive Decomposition Multiobjective Optimization Via Progressively Learned Value Functions. IEEE Transactions on Fuzzy Systems, 27(5), 849–860. https://doi.org/10.1109/tfuzz.2018.2880700

MLA 9

Li, Ke, et al. “Interactive Decomposition Multiobjective Optimization Via Progressively Learned Value Functions.” IEEE Transactions on Fuzzy Systems, vol. 27, no. 5, 2018, pp. 849–860. https://doi.org/10.1109/tfuzz.2018.2880700.

Chicago

Li, Ke, Renzhi Chen, Dragan A. Savic, and Xin Yao. 2018. “Interactive Decomposition Multiobjective Optimization Via Progressively Learned Value Functions.” IEEE Transactions on Fuzzy Systems 27 (5): 849–860. https://doi.org/10.1109/tfuzz.2018.2880700.

Harvard

Li, K. et al. (2018) ‘Interactive Decomposition Multiobjective Optimization Via Progressively Learned Value Functions’, IEEE Transactions on Fuzzy Systems, 27(5), pp. 849–860. doi:10.1109/tfuzz.2018.2880700.

IEEE

K. Li, R. Chen, D. A. Savic, and X. Yao, “Interactive Decomposition Multiobjective Optimization Via Progressively Learned Value Functions,” IEEE Transactions on Fuzzy Systems, vol. 27, no. 5, pp. 849–860, 2018, doi: 10.1109/tfuzz.2018.2880700.

BibTeX

@article{li2018interactive,
  title     = {{Interactive Decomposition Multiobjective Optimization Via Progressively Learned Value Functions}},
  author    = {Li, Ke and Chen, Renzhi and Savic, Dragan A. and Yao, Xin},
  journal   = {IEEE Transactions on Fuzzy Systems},
  year      = {2018},
  volume    = {27},
  number    = {5},
  pages     = {849--860},
  doi       = {10.1109/tfuzz.2018.2880700},
  url       = {https://doi.org/10.1109/tfuzz.2018.2880700}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
201922
20201616
20211111
20221010
20231212
202477
202577
202633

Its field-weighted citation impact is 5.93: it has been cited 5.93 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

  • interactive multiobjective optimization
  • preference elicitation
  • value function learning
  • region of interest
  • reference points
  • Pareto front

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Li, K., Chen, R., Savic, D. A., & Yao, X. (2018). Interactive Decomposition Multiobjective Optimization Via Progressively Learned Value Functions. IEEE Transactions on Fuzzy Systems, 27(5), 849–860. https://doi.org/10.1109/tfuzz.2018.2880700

How many times has this paper been cited?

68 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, Renzhi Chen, Dragan A. Savic, Xin Yao.

What is the DOI of this paper?

10.1109/tfuzz.2018.2880700, permanently at https://doi.org/10.1109/tfuzz.2018.2880700. 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.