69 research outputs found
Applied (Meta)-Heuristic in Intelligent Systems
Engineering and business problems are becoming increasingly difficult to solve due to the new economics triggered by big data, artificial intelligence, and the internet of things. Exact algorithms and heuristics are insufficient for solving such large and unstructured problems; instead, metaheuristic algorithms have emerged as the prevailing methods. A generic metaheuristic framework guides the course of search trajectories beyond local optimality, thus overcoming the limitations of traditional computation methods. The application of modern metaheuristics ranges from unmanned aerial and ground surface vehicles, unmanned factories, resource-constrained production, and humanoids to green logistics, renewable energy, circular economy, agricultural technology, environmental protection, finance technology, and the entertainment industry. This Special Issue presents high-quality papers proposing modern metaheuristics in intelligent systems
A comprehensive review of swarm optimization algorithms
Many swarm optimization algorithms have been introduced since the early 60’s, Evolutionary Programming to the most recent, Grey Wolf Optimization. All of these algorithms have demonstrated their potential to solve many optimization problems. This paper provides an in-depth survey of well-known optimization algorithms. Selected algorithms are briefly explained, and compared with each other comprehensively through experiments conducted using thirty well-known benchmark functions. Their advantages and disadvantages are also discussed. A number of statistical tests are then carried out to determine the significant performances. The results indicate the overall advantage of Differential Evolution (DE) and is closely followed by Particle Swarm Optimization (PSO), compared with other considered approaches
A Lite Fireworks Algorithm with Fractal Dimension Constraint for Feature Selection
As the use of robotics becomes more widespread, the huge amount of vision
data leads to a dramatic increase in data dimensionality. Although deep
learning methods can effectively process these high-dimensional vision data.
Due to the limitation of computational resources, some special scenarios still
rely on traditional machine learning methods. However, these high-dimensional
visual data lead to great challenges for traditional machine learning methods.
Therefore, we propose a Lite Fireworks Algorithm with Fractal Dimension
constraint for feature selection (LFWA+FD) and use it to solve the feature
selection problem driven by robot vision. The "LFWA+FD" focuses on searching
the ideal feature subset by simplifying the fireworks algorithm and
constraining the dimensionality of selected features by fractal dimensionality,
which in turn reduces the approximate features and reduces the noise in the
original data to improve the accuracy of the model. The comparative
experimental results of two publicly available datasets from UCI show that the
proposed method can effectively select a subset of features useful for model
inference and remove a large amount of noise noise present in the original data
to improve the performance.Comment: International Conference on Pharmaceutical Sciences 202
- …