Non-Dominated Sorting Bidirectional Differential Coevolution
Constrained multiobjective optimization problems (CMOPs) are commonly found in real-world applications. CMOP is a complex problem that needs to satisfy a set of equality or inequality constraints. This paper proposes a variant of the bidirectional coevolution algorithm (BiCo) with differential evolution (DE). The novelties in the model include the DE differential mutation and crossover operators as the main search engine and a non-dominated sorting selection scheme. Experimental results on two benchmark test suites and eight real-world CMOPs suggested that the proposed model reached better overall performance than the original model.
Code (0)
등록된 구현이 없습니다.
Tasks
Multiobjective OptimizationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Anomaly detection and classification for streaming data using PDEs
Nondominated sorting, also called Pareto Depth Analysis (PDA), is widely used in multi-objective optimization and has recently found important applications in multi-criteria anomaly detection. Recently, a partial differe…
Anomaly DetectionClassificationGeneral ClassificationCoevolution of Neural Architectures and Features for Stock Market Forecasting: A Multi-objective Decision Perspective
In a multi objective setting, a portfolio manager's highly consequential decisions can benefit from assessing alternative forecasting models of stock index movement. The present investigation proposes a new approach to i…
Evolutionary Algorithmsfeature selectionRank-based Non-dominated Sorting
Non-dominated sorting is a computational bottleneck in Pareto-based multi-objective evolutionary algorithms (MOEAs) due to the runtime-intensive comparison operations involved in establishing dominance relationships betw…
Evolutionary AlgorithmsMerge Non-Dominated Sorting Algorithm for Many-Objective Optimization
Many Pareto-based multi-objective evolutionary algorithms require to rank the solutions of the population in each iteration according to the dominance principle, what can become a costly operation particularly in the cas…
Evolutionary AlgorithmsMulti-User Remote lab: Timetable Scheduling Using Simplex Nondominated Sorting Genetic Algorithm
The scheduling of multi-user remote laboratories is modeled as a multimodal function for the proposed optimization algorithm. The hybrid optimization algorithm, hybridization of the Nelder-Mead Simplex algorithm and Non-…
Scheduling