Conference paper · 2011
Solving interval multi-objective optimization problems using evolutionary algorithms with preference polyhedron
Genetic and Evolutionary Computation Conference (GECCO), 729–736 · Published 12 July 2011 · DOI 10.1145/2001576.2001676
In brief
“Solving interval multi-objective optimization problems using evolutionary algorithms with preference polyhedron” is a 2011 conference paper by Jing Sun and 2 co-authors, published in Genetic and Evolutionary Computation Conference (GECCO). OpenAlex counts 7 citations as of 19 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 7
- Most cited in
- 2021 (2)
- Field-weighted impact
- 0.43
- References
- 22
- Authors
- 3
Abstract
Multi-objective optimization (MOO) problems with interval parameters are popular and important in real-world applications. Previous evolutionary optimization methods aim to find a set of well-converged and evenly-distributed Pareto-optimal solutions. We present a novel evolutionary algorithm (EA) that interacts with a decision maker (DM) during the optimization process to obtain the DM's most preferred solution. First… Read the full abstract at the publisher.
Excerpt. This paper is not open access.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Sun, J., Gong, D., & Sun, X. (2011). Solving interval multi-objective optimization problems using evolutionary algorithms with preference polyhedron. Genetic and Evolutionary Computation Conference (GECCO), 729–736. https://doi.org/10.1145/2001576.2001676
MLA 9
Sun, Jing, et al. “Solving interval multi-objective optimization problems using evolutionary algorithms with preference polyhedron.” Genetic and Evolutionary Computation Conference (GECCO), 2011, pp. 729–736. https://doi.org/10.1145/2001576.2001676.
Chicago
Sun, Jing, Dunwei Gong, and Xiaoyan Sun. 2011. “Solving interval multi-objective optimization problems using evolutionary algorithms with preference polyhedron.” Genetic and Evolutionary Computation Conference (GECCO): 729–736. https://doi.org/10.1145/2001576.2001676.
Harvard
Sun, J., Gong, D. and Sun, X. (2011) ‘Solving interval multi-objective optimization problems using evolutionary algorithms with preference polyhedron’, Genetic and Evolutionary Computation Conference (GECCO), pp. 729–736. doi:10.1145/2001576.2001676.
IEEE
J. Sun, D. Gong, and X. Sun, “Solving interval multi-objective optimization problems using evolutionary algorithms with preference polyhedron,” Genetic and Evolutionary Computation Conference (GECCO), pp. 729–736, 2011, doi: 10.1145/2001576.2001676.
BibTeX
@inproceedings{sun2011solving,
title = {{Solving interval multi-objective optimization problems using evolutionary algorithms with preference polyhedron}},
author = {Sun, Jing and Gong, Dunwei and Sun, Xiaoyan},
booktitle = {Genetic and Evolutionary Computation Conference (GECCO)},
year = {2011},
pages = {729--736},
doi = {10.1145/2001576.2001676},
url = {https://doi.org/10.1145/2001576.2001676}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2013 | 1 | |
| 2016 | 1 | |
| 2020 | 1 | |
| 2021 | 2 | |
| 2022 | 1 |
Its field-weighted citation impact is 0.43: it has been cited 0.43 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 evolutionary computation
- decision maker interaction
- interval parameters
- Pareto optimal solutions
- bi-objective optimization
- value function
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?
Sun, J., Gong, D., & Sun, X. (2011). Solving interval multi-objective optimization problems using evolutionary algorithms with preference polyhedron. Genetic and Evolutionary Computation Conference (GECCO), 729–736. https://doi.org/10.1145/2001576.2001676
How many times has this paper been cited?
7 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?
OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.
Who wrote this paper?
Jing Sun, Dunwei Gong, Xiaoyan Sun.
What is the DOI of this paper?
10.1145/2001576.2001676, permanently at https://doi.org/10.1145/2001576.2001676. 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.