A Reactive Population Approach on the Dolphin Echolocation Algorithm for Solving Cell Manufacturing Systems

Intelligent Dendritic Neural Model for Classification Problems

In recent years, the dendritic neural model has been widely employed in various fields because of its simple structure and inexpensive cost. Traditional numerical optimization is ineffective for the parameter optimization problem of the dendritic neural model; it is easy to fall into local in the optimization process, resulting in poor performance of the model. This paper proposes an intelligent dendritic neural model firstly, which uses the intelligent optimization algorithm to optimize the model instead of the traditional dendritic neural model with a backpropagation algorithm. The experiment compares the performance of ten representative intelligent optimization algorithms in six classification datasets. The optimal combination of user-defined parameters for the model evaluates by using Taguchi’s method, systemically. The results show that the performance of an intelligent dendritic neural model is significantly better than a traditional dendritic neural model. The intelligent dendritic neural model has small classification errors and high accuracy, which provides an effective approach for the application of dendritic neural model in engineering classification problems. In addition, among ten intelligent optimization algorithms, an evolutionary algorithm called biogeographic optimization algorithm has excellent performance, and can quickly obtain high-quality solutions and excellent convergence speed.

A Self-Adaptive Cuckoo Search Algorithm Using a Machine Learning Technique

Metaheuristics are intelligent problem-solvers that have been very efficient in solving huge optimization problems for more than two decades. However, the main drawback of these solvers is the need for problem-dependent and complex parameter setting in order to reach good results. This paper presents a new cuckoo search algorithm able to self-adapt its configuration, particularly its population and the abandon probability. The self-tuning process is governed by using machine learning, where cluster analysis is employed to autonomously and properly compute the number of agents needed at each step of the solving process. The goal is to efficiently explore the space of possible solutions while alleviating human effort in parameter configuration. We illustrate interesting experimental results on the well-known set covering problem, where the proposed approach is able to compete against various state-of-the-art algorithms, achieving better results in one single run versus 20 different configurations. In addition, the result obtained is compared with similar hybrid bio-inspired algorithms illustrating interesting results for this proposal.