Nonlinear systems design by a novel fuzzy neural system via hybridization of electromagnetism-like mechanism and particle swarm optimisation algorithms

Application of Bat Algorithm and Its Modified Form Trained with ANN in Channel Equalization

The transmission of high-speed data over communication channels is the function of digital communication systems. Due to linear and nonlinear distortions, data transmitted through this process is distorted. In a communication system, the channel is the medium through which signals are transmitted. The useful signal received at the receiver becomes corrupted because it is associated with noise, ISI, CCI, etc. The equalizers function at the front end of the receiver to eliminate these factors, and they are designed to make them work efficiently with proper network topology and parameters. In the case of highly dispersive and nonlinear channels, it is well known that neural network-based equalizers are more effective than linear equalizers, which use finite impulse response filters. An alternative approach to training neural network-based equalizers is to use metaheuristic algorithms. Here, in this work, to develop the symmetry-based efficient channel equalization in wireless communication, this paper proposes a modified form of bat algorithm trained with ANN for channel equalization. It adopts a population-based and local search algorithm to exploit the advantages of bats’ echolocation. The foremost initiative is to boost the flexibility of both the variants of the proposed algorithm and the utilization of proper weight, topology, and the transfer function of ANN in channel equalization. To evaluate the equalizer’s performance, MSE and BER can be calculated by considering popular nonlinear channels and adding nonlinearities. Experimental and statistical analyses show that, in comparison with the bat as well as variants of the bat and state-of-the-art algorithms, the proposed algorithm substantially outperforms them significantly, based on MSE and BER.

Remote Servo Tuning System for Multi-Axis CNC Machine Tools Using a Virtual Machine Tool Approach

Servo systems affect the performances of machining in accuracy and surface quality for high speed and precision machine tools. This study introduces an efficient servo tuning technique for Computer Numerical Control (CNC) feed drive systems using particle swarm optimization (PSO) algorithm by virtual machine tool approach. The proposed approach contained a system identification phase and a servo tuning phase based on the same bandwidth for all axes feed drive systems. The PSO algorithm was adopted to obtain the system parameters and maximize the corresponding bandwidth. An efficient two-step servo tuning method based on gain and phase margins was proposed for high speed and precision requirements. All feed drive systems controller gains were optimized simultaneously for synchronization. A remote system called Machine Dr. was established for servo tuning and monitoring. Simulation and experimental results were introduced to illustrate the effectiveness of the proposed approach.

Efficient constraint handling in electromagnetism-like algorithm for traveling salesman problem with time windows

The traveling salesman problem with time windows (TSPTW) is a variant of the traveling salesman problem in which each customer should be visited within a given time window. In this paper, we propose an electromagnetism-like algorithm (EMA) that uses a new constraint handling technique to minimize the travel cost in TSPTW problems. The EMA utilizes the attraction-repulsion mechanism between charged particles in a multidimensional space for global optimization. This paper investigates the problem-specific constraint handling capability of the EMA framework using a new variable bounding strategy, in which real-coded particle's boundary constraints associated with the corresponding time windows of customers, is introduced and combined with the penalty approach to eliminate infeasibilities regarding time window violations. The performance of the proposed algorithm and the effectiveness of the constraint handling technique have been studied extensively, comparing it to that of state-of-the-art metaheuristics using several sets of benchmark problems reported in the literature. The results of the numerical experiments show that the EMA generates feasible and near-optimal results within shorter computational times compared to the test algorithms.