D-MEANDS: a novel evolutionary approach to dynamic many-objective optimization problems

Lafetá, Thiago Fialho de Queiroz; Oliveira, Gina M. B.

doi:10.1109/smc42975.2020.9283268

2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC) 2020

DOI: 10.1109/smc42975.2020.9283268

|View full text |Cite

D-MEANDS: a novel evolutionary approach to dynamic many-objective optimization problems

Thiago Fialho de Queiroz Lafetá

Gina M. B. Oliveira

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

D-MEANDS-MD: an improved evolutionary algorithm with memory and diversity strategies applied to a discrete, dynamic, and many-objective optimization problem

Lafetá,

Martins,

Oliveira

2024

The Knowledge Engineering Review

View full text Add to dashboard Cite

Several real-world optimization problems are dynamic and involve a number of objectives. Different researches using evolutionary algorithms focus on these characteristics, but few works investigate problems that are both dynamic and many-objective. Although widely investigated in formulations with multiple objectives, the evolutionary approaches are still challenged by the dynamic multiobjective optimization problems defining a relevant research topic. Some models have been proposed specifically to attack them as the well-known DNSGA-II and MS-MOEA algorithms, which have been extensively investigated on formulations with two or three objectives. Recently, the D-MEANDS algorithm was proposed for dynamic many-objective problems (DMaOPs). In a previous work, D-MEANDS was confronted to DNSGA-II and MS-MOEA solving dynamic many-objective scenarios of the knapsack problem: up to six objectives with five changes or four objectives with ten changes. In this work, we evaluate the behavior of such algorithms in instances up to eight objectives and twenty environmental changes. These enabled us to better understand D-MEANDS weak points which led us to the proposition of D-MEANDS-MD. The proposal offers a better balance between memory and diversity. We also included a more recent MOEA in this comparison: the DDIS-MOEA/D-DE. From the results obtained using 27 instances of the dynamic multiobjective knapsack problem, D-MEANDS-MD showed promise for solving discrete DMaOPs compared with the others.

show abstract

D-MEANDS-MD: an improved evolutionary algorithm with memory and diversity strategies applied to a discrete, dynamic, and many-objective optimization problem

Lafetá,

Martins,

Oliveira

2024

The Knowledge Engineering Review

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

D-MEANDS: a novel evolutionary approach to dynamic many-objective optimization problems

Cited by 1 publication

References 20 publications

D-MEANDS-MD: an improved evolutionary algorithm with memory and diversity strategies applied to a discrete, dynamic, and many-objective optimization problem

D-MEANDS-MD: an improved evolutionary algorithm with memory and diversity strategies applied to a discrete, dynamic, and many-objective optimization problem

Contact Info

Product

Resources

About