The sine-cosine algorithm (SCA) is a new population-based meta-heuristic algorithm. In addition to exploiting sine and cosine functions to perform local and global searches (hence the name sine-cosine), the SCA introduces several random and adaptive parameters to facilitate the search process. Although it shows promising results, the search process of the SCA is vulnerable to local minima maxima due to the adoption of a fixed switch probability and the bounded magnitude of the sine and cosine functions (from -1 to 1). In this paper, we propose a new hybrid Q-learning sine-cosine- based strategy, called the Q-learning sine-cosine algorithm (QLSCA). Within the QLSCA, we eliminate the switching probability. Instead, we rely on the Q-learning algorithm (based on the penalty and reward mechanism) to dynamically identify the best operation during runtime. Additionally, we integrate two new operations (Le´vy flight motion and crossover) into the QLSCA to facilitate jumping out of local minima maxima and enhance the solution diversity. To assess its performance, we adopt the QLSCA for the combinatorial test suite minimization problem. Experimental results reveal that the QLSCA is statistically superior with regard to test suite size reduction compared to recent state-of-the-art strategies, including the original SCA, the particle swarm test generator (PSTG), adaptive particle swarm optimization (APSO) and the cuckoo search strategy (CS) at the 95 confidence level. However, concerning the comparison with discrete particle swarm optimization (DPSO), there is no significant difference in performance at the 95 confidence level. On a positive note, the QLSCA statistically outperforms the DPSO in certain configurations at the 90 confidence level.
Particle swarm optimization (PSO) @cite_4 is perhaps the most popular implementation of @math test suite generation. The PSO-based @math strategy searches by mimicking the swarm behaviour of flocking birds. In PSO, global and local searches are guided by the inertia weight and social cognitive parameters. Initially, a random swarm is created. Then, the PSO algorithm iteratively selects a candidate solution within the swarm to be added to the final test suite until all interaction tuples are covered (based on velocity and displacement transformation). developed early PSO-based strategies called the PSTG @cite_16 @cite_3 and APSO @cite_10 . APSO is an improvement on the PSTG integrated with adaptive tuning based on the Mamdani fuzzy inference system @cite_31 @cite_35 . implemented discrete PSO @cite_16 by substantially modifying the displacement and velocity transformation used in PSO. The benchmark results of DPSO @cite_5 demonstrate its superior performance when compared with both the PSTG and APSO.
@cite_35 @cite_4 @cite_3 @cite_5 @cite_31 @cite_16 @cite_10
1859314164 2131613989 2143285680 2111065664
Particle swarm optimization (PSO) is a heuristic global optimization method, proposed originally by Kennedy and Eberhart in 1995. It is now one of the most commonly used optimization techniques. This survey presented a comprehensive investigation of PSO. On one hand, we provided advances with PSO, including its modifications (including quantum-behaved PSO, bare-bones PSO, chaotic PSO, and fuzzy PSO), population topology (as fully connected, von Neumann, ring, star, random, etc.), hybridization (with genetic algorithm, simulated annealing, Tabu search, artificial immune system, ant colony algorithm, artificial bee colony, differential evolution, harmonic search, and biogeography-based optimization), extensions (to multiobjective, constrained, discrete, and binary optimization), theoretical analysis (parameter selection and tuning, and convergence analysis), and parallel implementation (in multicore, multiprocessor, GPU, and cloud computing forms). On the other hand, we offered a survey on applications of PSO to the following eight fields: electrical and electronic engineering, automation control systems, communication theory, operations research, mechanical engineering, fuel and energy, medicine, chemistry, and biology. It is hoped that this survey would be beneficial for the researchers studying PSO algorithms. This paper presents a variant of particle swarm optimizers (PSOs) that we call the comprehensive learning particle swarm optimizer (CLPSO), which uses a novel learning strategy whereby all other particles' historical best information is used to update a particle's velocity. This strategy enables the diversity of the swarm to be preserved to discourage premature convergence. Experiments were conducted (using codes available from http: www.ntu.edu.sg home epnsugan) on multimodal test functions such as Rosenbrock, Griewank, Rastrigin, Ackley, and Schwefel and composition functions both with and without coordinate rotation. The results demonstrate good performance of the CLPSO in solving multimodal problems when compared with eight other recent variants of the PSO. This paper proposes an improved particle swarm optimizer using the notion of species to determine its neighbourhood best values, for solving multimodal optimization problems. In the proposed species- based PSO (SPSO), the swarm population is divided into species sub- populations based on their similarity. Each species is grouped around a dominating particle called the species seed. At each iteration step, species seeds are identified from the entire population and then adopted as neig- hbourhood bests for these individual species groups separately. Species are formed adaptively at each step based on the feedback obtained from the multimodal fitness landscape. Over successive iterations, species are able to simultaneously optimize towards multiple optima, regardless of if they are global or local optima. Our experiments demonstrated that SPSO is very effective in dealing with multimodal optimization functions with lower dimensions. This paper proposes an evolutionary-group-based particle-swarm-optimization (EGPSO) algorithm for fuzzy-controller (FC) design. The EGPSO uses a group-based framework to incorporate crossover and mutation operations into particle-swarm optimization. The EGPSO dynamically forms different groups to select parents in crossover operations, particle updates, and replacements. An adaptive velocity-mutated operation (AVMO) is incorporated to improve search ability. The EGPSO is applied to design all of the free parameters in a zero-order Takagi-Sugeno-Kang (TSK)-type FC. The objective of EGPSO is to improve fuzzy-control accuracy and design efficiency. Comparisons with different population-based optimizations of fuzzy-control problems demonstrate the superiority of EGPSO performance. In particular, the EGPSO-designed FC is applied to mobile-robot navigation in unknown environments. In this application, the robot learns to follow object boundaries through an EGPSO-designed FC. A simple learning environment is created to build this behavior without an exhaustive collection of input-output training pairs in advance. A behavior supervisor is proposed to combine the boundary-following behavior and the target-seeking behavior for navigation, and the problem of dead cycles is considered. Successful mobile-robot navigation in simulation and real environments verifies the EGPSO-designed FC-navigation approach.