Search

This paper presents a powerful swarm intelligence metaheuristic optimization algorithm called Dynamic Cat Swarm Optimization. The formulation is through modifying the existing Cat Swarm Optimization Algorithm. The original Cat Swarm Optimization suffers from the shortcoming of "premature convergence," which is the possibility of entrapment in local optima which usually happens due to the off balance between exploration and exploitation phases. Therefore, the proposed algorithm suggests a new method to provide a proper balance between these phases by modifying the selection scheme and the seeking mode of the algorithm. To evaluate the performance of the proposed algorithm, 23 classical test functions, 10 modern test functions (CEC 2019) and a real-world scenario are used. In addition, the dimension-wise diversity metric is used to measure the percentage of the exploration and exploitation phases. The optimization results show the effectiveness of the proposed algorithm, which ranks first compared to several well-known algorithms available in the literature. Furthermore, statistical methods and graphs are also used to further confirm the outperformance of the algorithm. Finally, the conclusion and future directions to further improve the algorithm are discussed. [ABSTRACT FROM AUTHOR]

Feature transformation methods can be used effectively to improve the performance of the machine learning techniques, such as classification and clustering, via enhancing the discrimination among the samples. Additionally, binary representation of features may be necessary in several circumstances. For example, distributed systems may have limited bandwidth, storage, and energy that necessitate rough quantization of the measurements. This paper proposes a random projection-based feature transformation method that maps the data points from the original space into a new binary space. In the proposed transformation method, the random projection process is formulated as an optimization problem. A modified chaotic version of the sine–cosine algorithm is used to find the optimal random projector. The performance of the proposed transformation method is validated using 15 standard UCI benchmark datasets against the linear discernment analysis. Moreover, it is compared to other metaheuristic-based feature reduction methods including the gray wolf optimizer, the genetic algorithm, and the antlion optimizer. The obtained results assure the superiority of the proposed transformation method in terms of classification accuracy and storage requirements. [ABSTRACT FROM AUTHOR]

Optimization is a very important issue to efficiently solve engineering problems. The clear comprehension of the elements and processes of optimizer algorithms is fundamental to ensure that engineer students are capable to apply, tune, and design new algorithms. This paper presents an educational platform based on LEGO© EV3 and MATLAB to assist the learning of the principles of classical and metaheuristic optimization algorithms at undergraduate level, by providing a simple and easy-to-follow teaching setup. The proposed study aims to accompany students through the learning of optimization fundamentals by building hands-on robotic experiments. The proposed educational platform has been successfully applied to several undergraduate courses within the Electronics Department at the University of Guadalajara. The description of each experiment and the evaluation of their impact in the student performance are both provided in the paper. [ABSTRACT FROM AUTHOR]

We address one of the external factors of personnel inventory behavior, deployments. The configuration of persistent unit deployments has the ability to affect everything from individual perceptions of service palatability to operational effectiveness. There is little evidence to suggest any analytical underpinnings to the U.S. Army deployment scheduling and unit assignment patterns. This paper shows that the deployment scheduling and unit assignment problem can be formulated as an interval graph such that modifications to traditional graph coloring algorithms provide an efficient mechanism for dealing with multiple objectives. [ABSTRACT FROM AUTHOR]

Swarm algorithms belong to the class of population metaheuristic optimization methods. Despite the use of various metaphors, most swarm algorithms have similar structures, where one can distinguish common components such as the decision population initialization, decision diversification, and decision intensification. Based on the concept of generality, an analysis of key approaches to, methods for, and ways of increasing the efficiency of swarm optimization algorithms was carried out. In the survey, swarm optimization algorithms are viewed as a set of operators without a detailed discussion of each algorithm. The main focus is on the analysis of the key components of the algorithms. The main idea behind efficiency improvement is to maintain a balance between diversification and intensification. In this context, we consider mechanisms for supporting population diversity, methods for tuning and adjusting the swarm algorithm parameters, and approaches to hybridization of algorithms. We also indicate several open problems related to the topic of the survey. [ABSTRACT FROM AUTHOR]

• A new optimization algorithm based on Lichtenberg figure pattern is presented. • Difussion Limited Aggregation is formulated to create new agents in search space. • Lichtenberg figure pattern presents exploration–exploitation balance. • Tested on complex functions and problems and compared with renowned metaheuristics. This paper proposes a novel global optimization algorithm called Lichtenberg Algorithm (LA), inspired by the Lichtenberg figures patterns. Optimization is an essential tool to minimize or maximize functions, obtaining optimal results on costs, mass, energy, gains, among others. Actual problems may be multimodal, nonlinear, and discontinuous and may not be minimized by classical analytical methods that depend on the gradient. In this context there are metaheuristics algorithms inspired by natural phenomena to optimize real problems. There is no algorithm that is the worst or the best, but more efficient for a given type of problem. Thus, an unprecedented metaheuristic algorithm was created inspired by the physical phenomenon of radial intra-cloud lightning and Lichtenberg figures, successfully exploiting the fractal power and it is different from many in the literature as it is a hybrid algorithm composed of methods of search based on population and trajectory. Several test functions, including a design problem in a welded beam, were used to verify the robustness and to validate the Lichtenberg Algorithm. In all cases, the results were satisfactory when compared to those in the literature. LA shown to be a powerful optimization tool for both unconstraint optimizations and real problems with linear and nonlinear constraints. [ABSTRACT FROM AUTHOR]