2013
DOI: 10.1155/2013/841780
|View full text |Cite
|
Sign up to set email alerts
|

A Hybrid Multiobjective Differential Evolution Algorithm and Its Application to the Optimization of Grinding and Classification

Abstract: The grinding-classification is the prerequisite process for full recovery of the nonrenewable minerals with both production quality and quantity objectives concerned. Its natural formulation is a constrained multiobjective optimization problem of complex expression since the process is composed of one grinding machine and two classification machines. In this paper, a hybrid differential evolution (DE) algorithm with multi-population is proposed. Some infeasible solutions with better performance are allowed to … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 30 publications
0
3
0
Order By: Relevance
“…Heidari et al 36 proposed Harris Hawks Optimization (HHO) and achieved good results on the Rolling element bearing design problem. In addition, the niched Pareto genetic algorithm (NPGA), 37 the Pareto archive evolution strategy (PAES), 38 the artificial bee colony algorithm with memory algorithm (ABCM), 39 the enhanced elephant herding optimization 40 algorithm, a hybrid DE algorithm using the simplex method (SM-DEMO), 41 a chaotic Krill Herd (CKH) method 42 and many other intelligent optimization algorithms are subsequently used in complex industrial processes. However, the basic ideas of these optimization methods are inspired by the social behavior of animal groups, so their optimization has the characteristics of group evolution.…”
Section: Introductionmentioning
confidence: 99%
“…Heidari et al 36 proposed Harris Hawks Optimization (HHO) and achieved good results on the Rolling element bearing design problem. In addition, the niched Pareto genetic algorithm (NPGA), 37 the Pareto archive evolution strategy (PAES), 38 the artificial bee colony algorithm with memory algorithm (ABCM), 39 the enhanced elephant herding optimization 40 algorithm, a hybrid DE algorithm using the simplex method (SM-DEMO), 41 a chaotic Krill Herd (CKH) method 42 and many other intelligent optimization algorithms are subsequently used in complex industrial processes. However, the basic ideas of these optimization methods are inspired by the social behavior of animal groups, so their optimization has the characteristics of group evolution.…”
Section: Introductionmentioning
confidence: 99%
“…The representative methods of this approach have the rank-based fitness assignment method of genetic algorithms, [15] the niched Pareto genetic algorithm (NPGA), [16] the non-dominated ranking genetic algorithm (NSGA) [17] and its classical improved version NSGA-II, [18] the micro-genetic algorithm, [19] the Pareto archive evolution strategy (PAES), [20] the strength Pareto evolutionary algorithm (SPEA) [21] and its improved version SPEA2, [22] the incremental multi-objective evolutionary algorithm (MOEA), [23] and the MOEA based on decomposition techniques. [24][25] In addition to the traditional EAs, other evolutionary metaheuristics have also been proposed and used to successfully solve the MOPs, such as Scatter Search (SS), [26][27] Particle Swarm Optimization (PSO), [28][29][30] Differential Evolution (DE), [31][32][33] and others. By combining different ideas or meta-heuristics, the proposed algorithm may further improve the effectiveness of methods in order to overcome the inherent limitations of a single evolutionary algorithm or meta-heuristic.…”
Section: Introductionmentioning
confidence: 99%
“…Although the MOPs and constraint handling techniques have received much attention, the CMOPs are still challenging in practice when considering the constraints of the technological process. Wang [32] designed a hybrid DE algorithm using the simplex method (SM-DEMO) for bauxite grinding-classification operation. The proposed algorithm is formed by combining the simplex method and an elite population mechanism to ensure that some infeasible solutions with better performances are allowed to take part in the evolutionary process.…”
Section: Introductionmentioning
confidence: 99%