Comparison of Different Bat Initialization Techniques for Global Optimization Problems

Bat algorithm (BA) is a population-based stochastic search technique that has been widely used to solve the diverse kind of optimization problems. Population initialization is the current ongoing research problem in evolutionary computing algorithms. Appropriate population initialization assists the algorithm to investigate the swarm search space effectively. BA faces premature convergence problem to find actual global optimization value. Low discrepancy sequences are slightly lesser random number than pseudo-random; however, they are more powerful for computational approaches. In this work, new population initialization approach Halton (BA-HA), Sobol (BA-SO), and Torus (BA-TO) are proposed, which helps bats to avoid from the premature convergence. The proposed approaches are examined on standard benchmark functions, and simulation results are compared with standard BA initialized with uniform distribution. The results depict that substantial enhancement can be attained in the performance of standard BA while varying the random numbers sequences to low discrepancy sequences.

A New Multi-Objective Firework Algorithm to Solve the Multimodal Planning Network Problem

This article introduces a new approach called multi-objective firework algorithm (MFWA). The proposed approach allows for solving the multimodal transportation network problem (MTNP). The main goal is to develop a decision system that optimizes and determines the planning network of the multimodal transportation (PNMT) problem. The optimization involves reaching the efficient transport mode and multimodal path, in order to move from one country to another while satisfying the set of objectives. Moreover, the firework algorithm has distinct advantages in solving complex optimization problems and in obtaining a solution by a distributed and oriented research system. This approach presents a search way, which is different from the swarm intelligence-based stochastic search technique. For each firework, the process starts by exploding a firework in the sky. The search space is filled with a shower of sparks to get diversity solutions. This new approach proves their efficacy in solving the multi-objective problem, which is shown by the experimental results.

Stochastic Search Technique with Variable Deterministic Constraints for the Estimation of Induction Motor Parameters

This paper deals with the implementation of a new technique of stochastic search to find the best set of parameters in a mathematical model, applied to the single cage (SC) model of the induction motor (IM). The technique includes a new strategy to generate variable constraints of the domain, seven error functions, weight for the operating zones of the IM, and multi-objective functions. The results are validated with experimental data of the torque and current in an IM, and show better fitting to the experimental curves compared with the results of two different techniques, one deterministic and the other one stochastic. The results obtained allow us to conclude that the best set of parameters for the model depends on the weights assigned to the objective functions and to the operating zones.

A COMPARISON BETWEEN QUANTUM INSPIRED BACTERIAL FORAGING ALGORITHM AND GA-LIKE ALGORITHM FOR GLOBAL OPTIMIZATION

Bacterial foraging algorithm (BFA) is a population-based stochastic search technique for solving various scientific and engineering problems. However, it is inefficient in some practical situations. In order to improve the performance of the BFA, we propose a novel optimization algorithm, named quantum inspired bacterial foraging algorithm (QBFA), which applies several quantum computing principles, and a new mechanism is proposed to encode and observe the population. The algorithm has been evaluated on the standard high-dimensional benchmark functions in comparison with GA, PSO, GSO and FBSA, respectively. The proposed algorithm is then used to tune a PID controller of an automatic voltage regulator (AVR) system. Simulation results clearly illustrate that the proposed approach is very efficient and could be easily extended to 300 or higher-dimensional problems.