The DOI matches its Crossref record; 77 of the 77 references it cites were found in a registry or an index.
Localized Weighted Sum Method for Many-Objective Optimization
Abstract
Decomposition via scalarization is a basic concept for multiobjective optimization. The weighted sum (WS) method, a frequently used scalarizing method in decomposition-based evolutionary multiobjective (EMO) algorithms, has good features such as computationally easy and high search efficiency, compared to other scalarizing methods. However, it is often criticized by the loss of effect on nonconvex problems. This paper seeks to utilize advantages of the WS method, without suffering from its disadvantage, to solve many-objective problems. A novel decomposition-based EMO algorithm called multiobjective evolutionary algorithm based on decomposition LWS (MOEA/D-LWS) is proposed in which the WS method is applied in a local manner. That is, for each search direction, the optimal solution is selected only amongst its neighboring solutions. The neighborhood is defined using a hypercone. The apex angle of a hypervcone is determined automatically in a priori. The effectiveness of MOEA/D-LWS is demonstrated by comparing it against three variants of MOEA/D, i.e., MOEA/D using Chebyshev method, MOEA/D with an adaptive use of WS and Chebyshev method, MOEA/D with a simultaneous use of WS and Chebyshev method, and four state-of-the-art many-objective EMO algorithms, i.e., preference-inspired co-evolutionary algorithm, hypervolume-based evolutionary, θ-dominance-based algorithm, and SPEA2+SDE for the WFG benchmark problems with up to seven conflicting objectives. Experimental results show that MOEA/D-LWS outperforms the comparison algorithms for most of test problems, and is a competitive algorithm for many-objective optimization.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Zhang, Q., & Li, H. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.892759 · Cited by 10,069
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
Zitzler, E., & Thiele, L. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.797969 · Cited by 8,798
Deb, K., & Jain, H. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281535 · Cited by 7,133
Evolutionary Algorithms for Solving Multi-Objective Problems
(2007) · Genetic and Evolutionary Computation Series · doi:10.1007/978-0-387-36797-2 · Cited by 5,686
Nonlinear Multiobjective Optimization
Miettinen, K. (1998) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4615-5563-6 · Cited by 4,710
Performance assessment of multiobjective optimizers: an analysis and review
Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C. M., & da Fonseca, V. G. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.810758 · Cited by 4,330
Multiple Criteria Optimization: Theory, Computation, and Application
Laundy, R. S. (1989) · Cited by 3,420
Nonlinear Multiobjective Optimization
Mardle, S., & Miettinen, K. M. (2000) · The Journal of the Operational Research Society · doi:10.2307/254267 · Cited by 3,049
Cited by
Deep Reinforcement Learning for Multiobjective Optimization
Li, K., Zhang, T., & Wang, R. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.2977661 · Cited by 424
Self-citationHua, Y., Liu, Q., Hao, K., & Jin, Y. (2021) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2021.1003817 · Cited by 346
Siksnelyte-Butkiene, I., Zavadskas, E. K., & Streimikiene, D. (2020) · Energies · doi:10.3390/en13051164 · Cited by 265
Siting and sizing of fast charging stations in highway network with budget constraint
Wang, Y., Shi, J., Wang, R., Liu, Z., & Wang, L. (2018) · Applied Energy · doi:10.1016/j.apenergy.2018.07.025 · Cited by 112
Self-citation
Metadata
- Authors
- Wang, R., Zhou, Z., Ishibuchi, H., Liao, T., & Zhang, T.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2018-02
- Volume
- 22
- Issue
- 1
- Pages
- 3-18
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2521918431
- Cited by
- 362
- References
- 77
- FWCI
- 27.39
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Localized Weighted Sum Method for Many-Objective Optimization. https://app.cochat.ai/papers/10.1109/tevc.2016.2611642
- The paper
- Wang, R., Zhou, Z., Ishibuchi, H., Liao, T., & Zhang, T. (2018). Localized Weighted Sum Method for Many-Objective Optimization. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2016.2611642
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.