Parameter-Free Voronoi Neighborhood for Evolutionary Multimodal Optimization
نویسندگان
چکیده
منابع مشابه
Fuzzy particle swarm optimization with nearest-better neighborhood for multimodal optimization
In the last decades, many efforts have been made to solve multimodal optimization problems using Particle Swarm Optimization (PSO). To produce good results, these PSO algorithms need to specify some niching parameters to define the local neighborhood. In this paper, our motivation is to propose the novel neighborhood structures that remove undesirable niching parameters without sacrificing perf...
متن کاملEvolutionary Multimodal Optimization Revisited
We revisit a class of multimodal function optimizations using evolutionary algorithms reformulated into a multiobjective framework where previous implementations have needed niching/sharing to ensure diversity. In this paper, we use a steady-state multiobjective algorithm which preserves diversity without niching to produce diverse sampling of the Pareto-front with significantly lower computati...
متن کاملEvolutionary Parameter Optimization for Visual Obstacle Detection
In this paper we employ an Evolutionary Algorithm (EA) to improve the parameters of a visual obstacle detection method called Inverse Perspective Mapping. We show that the EA leads to a better parameter setting than the one found by an expert. The obstacle detection method is successfully implemented on our autonomous mobile robot ARNOLD to navigate in an unknown and dynamically changing enviro...
متن کاملEvolutionary Algorithms for Constrained Parameter Optimization Problems
Evolutionary computation techniques have received a lot of attention regarding their potential as optimization techniques for complex numerical functions. However, they have not produced a signi cant breakthrough in the area of nonlinear programming due to the fact that they have not addressed the issue of constraints in a systematic way. Only recently several methods have been proposed for han...
متن کاملAdaptive Neighborhood Graph for LTSA Learning Algorithm without Free-Parameter
Local Tangent Space Alignment (LTSA) algorithm is a classic local nonlinear manifold learning algorithm based on the information about local neighborhood space, i.e., local tangent space with respect to each point in dataset, which aims at finding the low-dimension intrinsic structure lie in high dimensional data space for the purpose of dimensionality reduction. In this paper, we present a nov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Evolutionary Computation
سال: 2020
ISSN: 1089-778X,1089-778X,1941-0026
DOI: 10.1109/tevc.2019.2921830