Multiobjective differential evolution based on fuzzy performance feedback: Soft constraint handling and its application in antenna designs

The recently emerging Differential Evolution is considered one of the most powerful tools for solving optimization problems. It is a stochastic population-based search approach for optimization over the continuous space. The main advantages of differential evolution are simplicity, robustness and high speed of convergence. Differential evolution is attractive to researchers all over the world as evidenced by recent publications. There are many variants of differential evolution proposed by researchers and differential evolution algorithms are continuously improved in its performance. Performance of differential evolution algorithms depend on the control parameters setting which are problem dependent and time-consuming task. This study proposed a Fuzzy-based Multiobjective Differential Evolution (FMDE) that exploits three performance metrics, specifically hypervolume, spacing, and maximum spread, to measure the state of the evolution process. We apply the fuzzy inference rules to these metrics in order to adaptively adjust the associated control parameters of the chosen mutation strategy used in this algorithm. The proposed FMDE is evaluated on the well known ZDT, DTLZ, and WFG benchmark test suites. The experimental results show that FMDE is competitive with respect to the chosen state-of-the-art multiobjective evolutionary algorithms. The advanced version of FMDE with adaptive crossover rate (AFMDE) is proposed. The proof of concept AFMDE is then applied specifically to the designs of microstrip antenna array. Furthermore, the soft constraint handling technique incorporates with AFMDE is proposed. Soft constraint AFMDE is evaluated on the benchmark constrained problems. AFMDE with soft constraint handling technique is applied to the constrained non-uniform circular antenna array design problem as a case study

Enhancing numerical modelling efficiency for electromagnetic simulation of physical layer components.

The purpose of this thesis is to present solutions to overcome several key difficulties that limit the application of numerical modelling in communication cable design and analysis. In particular, specific limiting factors are that simulations are time consuming, and the process of comparison requires skill and is poorly defined and understood. When much of the process of design consists of optimisation of performance within a well defined domain, the use of artificial intelligence techniques may reduce or remove the need for human interaction in the design process. The automation of human processes allows round-the-clock operation at a faster throughput. Achieving a speedup would permit greater exploration of the possible designs, improving understanding of the domain. This thesis presents work that relates to three facets of the efficiency of numerical modelling: minimizing simulation execution time, controlling optimization processes and quantifying comparisons of results. These topics are of interest because simulation times for most problems of interest run into tens of hours. The design process for most systems being modelled may be considered an optimisation process in so far as the design is improved based upon a comparison of the test results with a specification. Development of software to automate this process permits the improvements to continue outside working hours, and produces decisions unaffected by the psychological state of a human operator. Improved performance of simulation tools would facilitate exploration of more variations on a design, which would improve understanding of the problem domain, promoting a virtuous circle of design. The minimization of execution time was achieved through the development of a Parallel TLM Solver which did not use specialized hardware or a dedicated network. Its design was novel because it was intended to operate on a network of heterogeneous machines in a manner which was fault tolerant, and included a means to reduce vulnerability of simulated data without encryption. Optimisation processes were controlled by genetic algorithms and particle swarm optimisation which were novel applications in communication cable design. The work extended the range of cable parameters, reducing conductor diameters for twisted pair cables, and reducing optical coverage of screens for a given shielding effectiveness. Work on the comparison of results introduced ―Colour maps‖ as a way of displaying three scalar variables over a two-dimensional surface, and comparisons were quantified by extending 1D Feature Selective Validation (FSV) to two dimensions, using an ellipse shaped filter, in such a way that it could be extended to higher dimensions. In so doing, some problems with FSV were detected, and suggestions for overcoming these presented: such as the special case of zero valued DC signals. A re-description of Feature Selective Validation, using Jacobians and tensors is proposed, in order to facilitate its implementation in higher dimensional spaces

Orthogonal Design Method for Optimizing Roughly Designed Antenna

Orthogonal design method (ODM) is widely used in real world application while it is not used for antenna design yet. It is employed to optimize roughly designed antenna in this paper. The geometrical factors of the antenna are relaxed within specific region and each factor is divided into some levels, and the performance of the antenna is constructed as objective. Then the ODM samples small number of antennas over the relaxed space and finds a prospective antenna. In an experiment of designing ST5 satellite miniantenna, we first get a roughly evolved antenna. The reason why we evolve roughly is because the evolving is time consuming even if numerical electromagnetics code 2 (NEC2) is employed (NEC2 source code is openly available and is fast in wire antenna simulation but not much feasible). Then the ODM method is employed to locally optimize the antenna with HFSS (HFSS is a commercial and feasible electromagnetics simulation software). The result shows the ODM optimizes successfully the roughly evolved antenna

An Integrated Method Based on PSO and EDA for the Max-Cut Problem

The max-cut problem is NP-hard combinatorial optimization problem with many real world applications. In this paper, we propose an integrated method based on particle swarm optimization and estimation of distribution algorithm (PSO-EDA) for solving the max-cut problem. The integrated algorithm overcomes the shortcomings of particle swarm optimization and estimation of distribution algorithm. To enhance the performance of the PSO-EDA, a fast local search procedure is applied. In addition, a path relinking procedure is developed to intensify the search. To evaluate the performance of PSO-EDA, extensive experiments were carried out on two sets of benchmark instances with 800 to 20000 vertices from the literature. Computational results and comparisons show that PSO-EDA significantly outperforms the existing PSO-based and EDA-based algorithms for the max-cut problem. Compared with other best performing algorithms, PSO-EDA is able to find very competitive results in terms of solution quality

Journal of Telecommunications and Information Technology, 2017, nr 4

kwartalni

Classification and localization of electromagnetic and ultrasonic pulsed emitters

Mención Internacional en el título de doctorThe localization of radiative sources is very important in many fields of work such as: sonar, radar and underwater radar, indoor localization in wireless networks, earthquake epicenter localization, defective assets localization in electrical facilities and so forth. In the process of locating radiative sources exist many issues which can provoke errors in the localization. The signals acquired may belong to different sources or they can be mixed with environmental noise, then, their separation before using localization algorithms is of great interest to be efficient and accurate in the computational process. Furthermore, the geometry and radiation characteristics of the receivers, the nature of the signal or their measuring process may cause deviations in the signal onset calculus and therefore the source localization could be displaced from the actual position. In this thesis, there are three kinds of algorithms to undertake three steps in the emitter localization: signal separation, onset and time delay estimation of the signals and source localization. For each step, in order to reduce the error in the localization, several algorithms are analyzed and compared in each application, to choose the most reliable. As the first step, to separate different kinds of signals is of interest to facilitate further processing. In this thesis, different optimization techniques are presented over the power ratio (PR) maps method. The PR uses a selective spectral signal characterization to extract the features of the analyzed signals. The technique identifies automatically the most representative frequency bands which report a great separation of the different kinds of signals in the PR map. After separating and selecting the signals, it is of interest to compare the algorithms to calculate the onset and time delay of the pulsed signals to know their performance because the time variables are inputs to the most common triangulation algorithms to locate radiative and ultrasonic sources. An overview of the algorithms used to estimate the time of flight (ToF) and time differences of arrival (TDoA) of pulsed signals is done in this thesis. In the comparison, there is also a new algorithm based on statics of high order, which is proposed in this thesis. The survey of their performance is done applied to muscle deep estimation, localization in one dimension (1D), and for the localization of emitters in three dimensions (3D). The results show how the presented algorithm yields great results. As the last step in the radiative source localization, the formulation and principle of work of both iterative and non-iterative triangulation algorithms are presented. A new algorithm is presented as a combination of two already existing improving their performance when working alone. All the algorithms, the proposed and the previous which already exist, are compared in terms of accuracy and computational time. The proposed algorithm reports good results in terms of accuracy and it is one of the fastest in computational time. Once the localization is achieved, it is of great interest to understand how the errors in the determination of the onset of the signals are propagated in the emitter localization. The triangulation algorithms estimate the radiative source position using time variables as inputs: ToF, TDoA or pseudo time of flight (pToF) and the receiver positions. The propagation of the errors in the time variables to the radiative source localization is done in two dimensions (2D) and 3D. New spherical diagrams have been created to represent the directions where the localization is more or less sensible to the errors. This study and their sphere diagrams are presented for several antenna layouts. Finally, how the errors in the positioning of the receivers are propagated to the emitter localization is analyzed. In this study, the effect in the propagation of both the relative distance from the receivers to the emitter and the direction between them has been characterized. The propagation of the error considering the direction is also represented in spherical diagrams. For a preferred direction identified in the spheres, the propagated error in the source localization has been quantified regarding both the source distance and the magnitude of the errors in the receivers positioning.Programa Oficial de Doctorado en Ingeniería Eléctrica, Electrónica y AutomáticaPresidente: Andrea Cavallini.- Secretario: José Antonio García Souto.- Vocal: Iliana Portugués Peter

Biomedical Sensing and Imaging

This book mainly deals with recent advances in biomedical sensing and imaging. More recently, wearable/smart biosensors and devices, which facilitate diagnostics in a non-clinical setting, have become a hot topic. Combined with machine learning and artificial intelligence, they could revolutionize the biomedical diagnostic field. The aim of this book is to provide a research forum in biomedical sensing and imaging and extend the scientific frontier of this very important and significant biomedical endeavor

An Integrated Method Based on PSO and EDA for the Max-Cut Problem

The max-cut problem is NP-hard combinatorial optimization problem with many real world applications. In this paper, we propose an integrated method based on particle swarm optimization and estimation of distribution algorithm (PSO-EDA) for solving the max-cut problem. The integrated algorithm overcomes the shortcomings of particle swarm optimization and estimation of distribution algorithm. To enhance the performance of the PSO-EDA, a fast local search procedure is applied. In addition, a path relinking procedure is developed to intensify the search. To evaluate the performance of PSO-EDA, extensive experiments were carried out on two sets of benchmark instances with 800 to 20000 vertices from the literature. Computational results and comparisons show that PSO-EDA significantly outperforms the existing PSO-based and EDA-based algorithms for the max-cut problem. Compared with other best performing algorithms, PSO-EDA is able to find very competitive results in terms of solution quality