The DOI matches its Crossref record.
Reference Point Based Multi-Objective Optimization Using Evolutionary Algorithms
Abstract
Evolutionary multi-objective optimization (EMO) methodologies have been amply applied to find a representative set of Pareto-optimal solutions in the past decade and beyond. Although there are advantages of knowing the range of each objective for Pareto-optimality and the shape of the Pareto-optimal frontier itself in a problem for an adequate decision-making, the task of choosing a single preferred Paretooptimal solution is also an important task which has received a lukewarm attention so far. In this paper, we combine one such preference-based strategy with an EMO methodology and demonstrate how, instead of one solution, a preferred set of solutions near the reference points can be found parallely. We propose two approaches for this task: (i) a modified EMO procedure based on the elitist non-dominated sorting GA or NSGA-II [1] and (ii) a predator-prey approach based on original grid based procedure [2]. On two-objective to 10-objective optimization test problems, the modified NSGA-II approach shows its efficacy in finding an adequate set of Pareto-optimal points. On two and three-objective problems, the predator-prey approach also demonstrate its usefulness. Such procedures will provide the decision-maker with a set of solutions near her/his preference so that a better and a more reliable decision can be made.
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
Cited by
Deb, K., & Jain, H. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281535 · Cited by 7,133
Self-citationPymoo: Multi-Objective Optimization in Python
Blank, J., & Deb, K. (2020) · IEEE Access · doi:10.1109/access.2020.2990567 · Cited by 2,344
Self-citationMultiobjective evolutionary algorithms: A survey of the state of the art
Zhou, A., Qu, B.-Y., Li, H., Zhao, S.-Z., Suganthan, P. N., & Zhang, Q. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.03.001 · Cited by 2,255
A Reference Vector Guided Evolutionary Algorithm for Many-Objective Optimization
Cheng, R., Jin, Y., Olhofer, M., & Sendhoff, B. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2519378 · Cited by 1,760
Deb, K., & Deb, K. (2014) · Search Methodologies · doi:10.1007/978-1-4614-6940-7_15 · Cited by 1,248
Self-citationMulti-objective Optimisation Using Evolutionary Algorithms: An Introduction
Deb, K. (2011) · Multi-objective Evolutionary Optimisation for Product Design and Manufacturing · doi:10.1007/978-0-85729-652-8_1 · Cited by 995
Self-citationA Knee Point-Driven Evolutionary Algorithm for Many-Objective Optimization
Zhang, X., Tian, Y., & Jin, Y. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2378512 · Cited by 867
Automated design of ligands to polypharmacological profiles
Besnard, J., Ruda, G. F., Setola, V., Abecassis, K., Rodriguiz, R. M., Huang, X.-P., Norval, S., Sassano, M. F., Shin, A. I., Webster, L. A., et al. (2012) · Nature · doi:10.1038/nature11691 · Cited by 832
Many-Objective Evolutionary Algorithms: A Survey
Li, B., Li, J., Tang, K., & Yao, X. (2015) · ACM Computing Surveys · doi:10.1145/2792984 · Cited by 815
Tian, Y., Cheng, R., Zhang, X., Cheng, F., & Jin, Y. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2749619 · Cited by 699
Maier, H. R., Kapelan, Z., Kasprzyk, J., Kollat, J., Matott, L. S., Cunha, M. C., Dandy, G. C., Gibbs, M. S., Keedwell, E., Marchi, A., et al. (2014) · Environmental Modelling & Software · doi:10.1016/j.envsoft.2014.09.013 · Cited by 657
A Survey of Multiobjective Evolutionary Algorithms based on Decomposition
Trivedi, A., Srinivasan, D., Sanyal, K., & Ghosh, A. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2608507 · Cited by 549
The r-Dominance: A New Dominance Relation for Interactive Evolutionary Multicriteria Decision Making
Ben Said, L., Bechikh, S., & Ghedira, K. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2041060 · Cited by 301
A New Decomposition-Based NSGA-II for Many-Objective Optimization
Elarbi, M., Bechikh, S., Gupta, A., Ben Said, L., & Ong, Y.-S. (2018) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2017.2654301 · Cited by 290
A Many-Objective Evolutionary Algorithm Using A One-by-One Selection Strategy
Liu, Y., Gong, D., Sun, J., & Jin, Y. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2638902 · Cited by 271
Many-Objective Software Remodularization Using NSGA-III
Mkaouer, W., Kessentini, M., Shaout, A., Koligheu, P., Bechikh, S., Deb, K., & Ouni, A. (2015) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/2729974 · Cited by 267
Self-citationg-dominance: Reference point based dominance for multiobjective metaheuristics
Molina, J., Santana, L. V., Hernández-Díaz, A. G., Coello Coello, C. A., & Caballero, R. (2009) · European Journal of Operational Research · doi:10.1016/j.ejor.2008.07.015 · Cited by 258
Preference-Based Evolutionary Many-Objective Optimization for Agile Satellite Mission Planning
Li, L., Chen, H., Li, J., Jing, N., & Emmerich, M. (2018) · IEEE Access · doi:10.1109/access.2018.2859028 · Cited by 46
Metadata
- Authors
- Deb, K., Sundar, J., Udaya Bhaskara, R. N., & Chaudhuri, S.
- Venue
- International Journal of Computational Intelligence Research
- Publisher
- Research India Publications
- Published
- 2006
- Volume
- 2
- Issue
- 3
- ISSN
- 0973-1873 (ISSN-L)
- 0974-1259
- OpenAlex
- W2091055889
- Cited by
- 371
- References
- 0
- FWCI
- 10.59
- 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
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.