Journal Article10.1007/s10115-024-02179-3
Cooperative coati optimization algorithm with transfer functions for feature selection and knapsack problems
Rui Zhong,Chao Zhang,Jun Yu +2 more
2
About: This article is published in Knowledge and Information Systems. The article was published on 15 Jul 2024. The article focuses on the topics: Knapsack problem & Feature selection.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Enhancing large-scale power flow optimization through an advanced coati optimization algorithm
Fatima Daqaq,Salah Kamel,Mohamed H. Hassan,Rachid Ellaia,Mohammed Ouassaid +4 more
Correction: SFE-EANDS: a simple, fast, and efficient algorithm with external archive and normalized distance-based selection for high-dimensional feature selection
Rui Zhong,Yang Cao,Essam H. Houssein,Jun Yu,Masaharu Munetomo +4 more
References
A fast and elitist multiobjective genetic algorithm: NSGA-II
TL;DR: This paper suggests a non-dominated sorting-based MOEA, called NSGA-II (Non-dominated Sorting Genetic Algorithm II), which alleviates all of the above three difficulties, and modify the definition of dominance in order to solve constrained multi-objective problems efficiently.
Particle swarm optimization
James Kennedy,Russell C. Eberhart +1 more
- 06 Aug 2002
TL;DR: A concept for the optimization of nonlinear functions using particle swarm methodology is introduced, and the evolution of several paradigms is outlined, and an implementation of one of the paradigm is discussed.
44.1K
No free lunch theorems for optimization
TL;DR: A framework is developed to explore the connection between effective optimization algorithms and the problems they are solving and a number of "no free lunch" (NFL) theorems are presented which establish that for any algorithm, any elevated performance over one class of problems is offset by performance over another class.
Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art
TL;DR: A comprehensive survey of the most popular constraint-handling techniques currently used with evolutionary algorithms, including approaches that go from simple variations of a penalty function, to others, more sophisticated, that are biologically inspired on emulations of the immune system, culture or ant colonies.
2.1K
A Cooperative Coevolutionary Approach to Function Optimization
Mitchell A. Potter,Kenneth de Jong +1 more
- 09 Oct 1994
TL;DR: A general model for the coevolution of cooperating species is presented and a new approach to evolving complex structures such as neural networks and rule sets is suggested.