scholarly journals ASA Algorithm Combined with Current Simulation Method (CSM) for the Magnetic Induction under HV Power Lines in 3D Analysis Model

2020 ◽  
Vol 9 (2) ◽  
pp. 7-18
Author(s):  
R. Djekidel ◽  
S.-A. Bessedik

In this paper, a new hybrid approach to modeling the magnetic induction produced by HV overhead power line which combines the current simulation method (CSM) and adaptive simulated annealing algorithm (ASA) is discussed. The aim of the ASA algorithm is to find the optimal position and number of current loops used in bundles conductors for an accurate magnetic induction. Several parameters affecting the magnetic induction have been studied; it is observed that, taking into account the effect of conductor sag is much more interesting particularly at the mid-span length where the magnetic induction becomes very significant, the results also indicated that the maximum magnetic induction levels are less than the limits recommended by the ICNIRP standard for general public and occupational exposure. The calculated results are compared with those obtained from the COMSOL 4.3a Multiphysics software. A good agreement has been reached.

Author(s):  
M R Bai ◽  
Y K Tsai

This article focuses on the optimization of piezoelectric panel speakers. Two piezoelectric ceramic plates serve to excite the diaphragm in the speaker. In light of an optimization procedure, the optimal position on the diaphragm to mount the piezoelectric ceramic plates is determined. A finite-element model is established using the energy method, where the electrical system, mechanical system, and acoustic loading of the transducer are considered as a coupled system. The simulated annealing algorithm is exploited to attain a design that enables low fundamental resonance frequency and high acoustic output. Experiments were conducted to verify the numerical model. The experimental results were in good agreement with the numerical prediction, in which the performance of the optimized configuration was found to be significantly improved over the non-optimal design.


1987 ◽  
Vol 1 (1) ◽  
pp. 33-46 ◽  
Author(s):  
David Aldous

Uniform distributions on complicated combinatorial sets can be simulated by the Markov chain method. A condition is given for the simulations to be accurate in polynomial time. Similar analysis of the simulated annealing algorithm remains an open problem. The argument relies on a recent eigenvalue estimate of Alon [4]; the only new mathematical ingredient is a careful analysis of how the accuracy of sample averages of a Markov chain is related to the second-largest eigenvalue.


2020 ◽  
Vol 2020 ◽  
pp. 1-9
Author(s):  
Jin Cheng ◽  
Bin Wang

Flocking control problem of mobile robots under environment with unknown obstacles is addressed in this paper. Based on the simulated annealing algorithm, a flocking behaviour for mobile robots is achieved which converges to alignment while avoiding obstacles. Potential functions are designed to evaluate the positional relationship between robots and obstacles. Unlike the existing analytical method, simulated annealing algorithm is utilized to search the quasi-optimal position of robots in order to reduce the potential functions. Motion control law is designed to drive the robot move to the desired position at each sampling period. Experiments are implemented, and the results illustrate the effectiveness of the proposed flocking control method.


2013 ◽  
Vol 4 (2) ◽  
pp. 20-28
Author(s):  
Farhad Soleimanian Gharehchopogh ◽  
Hadi Najafi ◽  
Kourosh Farahkhah

The present paper is an attempt to get total minimum of trigonometric Functions by Simulated Annealing. To do so the researchers ran Simulated Annealing. Sample trigonometric functions and showed the results through Matlab software. According the Simulated Annealing Solves the problem of getting stuck in a local Maxterm and one can always get the best result through the Algorithm.


Sign in / Sign up

Export Citation Format

Share Document