351 research outputs found
A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications
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
Dual sub-swarm interaction QPSO algorithm based on different correlation coefficients
A novel quantum-behaved particle swarm optimization (QPSO) algorithm, the dual sub-swarm interaction QPSO algorithm based on different correlation coefficients (DCC-QPSO), is proposed by constructing master-slave sub-swarms with different potential well centres. In the novel algorithm, the master sub-swarm and the slave sub-swarm have different functinons during the evolutionary process through separate information processing strategies. The master subswarm is conducive to maintaining population diversity and enhancing the global search ability of particles. The slave sub-swarm accelerates the convergence rate and strengthens the particles’ local searching ability. With the critical information contained in the search space and results of the basic QPSO algorithm, this new algorithm avoids the rapid disappearance of swarm diversity and enhances searching ability through collaboration between sub-swarms.
Experimental results on six test functions show that DCC-QPSO outperforms the traditional QPSO algorithm regarding optimization of multimodal functions, with enhancement in both convergence speed and precision
Recommended from our members
Novel optimisation methods for numerical inverse problems
Inverse problems involve the determination of one or more unknown quantities usually appearing in the mathematical formulation of a physical problem. These unknown quantities may be boundary heat flux, various source terms, thermal and material properties, boundary shape and size. Solving inverse problems requires additional information through in-situ data measurements of the field variables of the physical problems. These problems are also ill-posed because the solution itself is sensitive to random errors in the measured input data. Regularisation techniques are usually used in order to deal with the instability of the solution. In the past decades, many methods based on the nonlinear least squares model, both deterministic (CGM) and stochastic (GA, PSO), have been investigated for numerical inverse problems.
The goal of this thesis is to examine and explore new techniques for numerical inverse problems. The background theory of population-based heuristic algorithm known as quantum-behaved particle swarm optimisation (QPSO) is re-visited and examined. To enhance the global search ability of QPSO for complex multi-modal problems, several modifications to QPSO are proposed. These include perturbation operation, Gaussian mutation and ring topology model. Several parameter selection methods for these algorithms are proposed. Benchmark functions were used to test the performance of the modified algorithms. To address the high computational cost of complex engineering optimisation problems, two parallel models of the QPSO (master-slave, static subpopulation) were developed for different distributed systems. A hybrid method, which makes use of deterministic (CGM) and stochastic (QPSO) methods, is proposed to improve the estimated solution and the performance of the algorithms for solving the inverse problems.
Finally, the proposed methods are used to solve typical problems as appeared in many research papers. The numerical results demonstrate the feasibility and efficiency of QPSO and the global search ability and stability of the modified versions of QPSO. Two novel methods of providing initial guess to CGM with approximated data from QPSO are also proposed for use in the hybrid method and were applied to estimate heat fluxes and boundary shapes. The simultaneous estimation of temperature dependent thermal conductivity and heat capacity was addressed by using QPSO with Gaussian mutation. This combination provides a stable algorithm even with noisy measurements. Comparison of the performance between different methods for solving inverse problems is also presented in this thesis
A Brief Review on Mathematical Tools Applicable to Quantum Computing for Modelling and Optimization Problems in Engineering
Since its emergence, quantum computing has enabled a wide spectrum of new possibilities and advantages, including its efficiency in accelerating computational processes exponentially. This has directed much research towards completely novel ways of solving a wide variety of engineering problems, especially through describing quantum versions of many mathematical tools such as Fourier and Laplace transforms, differential equations, systems of linear equations, and optimization techniques, among others. Exploration and development in this direction will revolutionize the world of engineering. In this manuscript, we review the state of the art of these emerging techniques from the perspective of quantum computer development and performance optimization, with a focus on the most common mathematical tools that support engineering applications. This review focuses on the application of these mathematical tools to quantum computer development and performance improvement/optimization. It also identifies the challenges and limitations related to the exploitation of quantum computing and outlines the main opportunities for future contributions. This review aims at offering a valuable reference for researchers in fields of engineering that are likely to turn to quantum computing for solutions. Doi: 10.28991/ESJ-2023-07-01-020 Full Text: PD
Particle swarm optimization algorithms with selective differential evolution for AUV path planning
Particle swarm optimization (PSO)-based algorithms are suitable for path planning of the Autonomous Underwater Vehicle (AUV) due to their high computational efficiency. However, such algorithms may produce sub-optimal paths or require higher computational load to produce an optimal path. This paper proposed a new approach that improves the ability of PSO-based algorithms to search for the optimal path while maintaining a low computational requirement. By hybridizing with differential evolution (DE), the proposed algorithms carry out the DE operator selectively to improve the search ability. The algorithms were applied in an offline AUV path planner to generate a near-optimal path that safely guides the AUV through an environment with a priori known obstacles and time-invariant non-uniform currents. The algorithm performances were benchmarked against other algorithms in an offline path planner because if the proposed algorithms can provide better computational efficiency to demonstrate the minimum capability of a path planner, then they will outperform the tested algorithms in a realistic scenario. Through Monte Carlo simulations and Kruskal-Wallis test, SDEAPSO (selective DE-hybridized PSO with adaptive factor) and SDEQPSO (selective DE-hybridized Quantum-behaved PSO) were found to be capable of generating feasible AUV path with higher efficiency than other algorithms tested, as indicated by their lower computational requirement and excellent path quality
Velocity control of longitudinal vibration ultrasonic motor using improved Elman neural network trained by CQPSO with LĂ©vy flights
Longitudinally vibration ultrasonic motor (LV-USM), a canonical nonlinear system, utilizes the inverse piezoelectric effect of piezoelectric ceramic to generate the mechanical vibration within the scope of ultrasonic frequency. However, it is very difficult to establish a strict and accurate mathematical model. Hence seeking a dynamic identifier and controller for LV-USM avoiding the accurate mathematical model becomes a feasible approach. In this paper, a novel learning algorithm for dynamic recurrent Elman neural networks is present based on a particle swarm optimization (PSO) to identify and control an LV-USM. To overcome the PSO’s global search ability, Lévy flights, a kind of random walks, are imported to improve the ability of exploration rather than Brownian motion or Gauss disturbance based on Cooperative Quantum-behaved PSO (CQPSO). Thereafter, a controller is designed to perform speed control for LV-USM along with the nonlinear identification also using this kind of neural network. By discrete Lyapunov stability approach, the controller is proven to be stable theoretically and the latter trial shows its robustness of anti-noise performance. In the experiments, the numerical results illustrate that the designed identifier and controller can achieve both higher convergence precision and speed, relative to current state-of-the-art other methods. Moreover, this controller shows lower control error than other approaches while the displacement of the rotor disc in LV-USM appears more smooth and uniform
Hybrid Evolutionary Computing Assisted Irregular-Shaped Patch Antenna Design for Wide Band Applications
A novel optimization concept for modeling irregular-shaped patch antenna with high bandwidth and efficient radiation attributes is proposed in this paper, along with the ability to accomplish the design at a reduced computational and cost burden. A revolutionary computing perception is established with Gravitational Search Algorithm (GSA) and Quantum Based Delta Particle Swarm Optimization (QPSO), now known as GSA-QPSO. The suggested model employed the GSA-QPSO algorithm strategically interfaced with a high-frequency structure simulator (HFSS) software through a Microsoft Visual Basic script to enhance irregular-shaped antenna design while maintaining wide bandwidth with suitable radiation efficiency over the target bandwidth region. The optimally designed microstrip patch antenna is fabricated on an FR-4 substrate with a surface area of 30Ă—30Ă—1.6 mm 3 . The evaluated outcome shows 96 % supreme radiation efficacy at 2.4 GHz whereas overall effectiveness is above 84% over the entire frequency range, with a nearly omnidirectional radiation pattern. In terms of impedance bandwidth, the suggested antenna offers 126.6 % over the operational frequency range from 2.34 GHz to 10.44 GHz. Fabrication and measurement results are also used to validate the simulated results. It exhibits the proficiency of the offered antenna design to be used for real-world wideband (WB) communication drives
- …