Design of Optimal CMOS Analog Amplifier Circuits Using a Hybrid Evolutionary Optimization Technique

2017 ◽  
Vol 27 (02) ◽  
pp. 1850029 ◽  
Author(s):  
Bishnu Prasad De ◽  
Kanchan Baran Maji ◽  
Rajib Kar ◽  
Durbadal Mandal ◽  
Sakti Prasad Ghoshal
Keyword(s):  
Power Dissipation ◽  
Optimization Problems ◽  
Optimization Technique ◽  
Optimization Method ◽  
Vlsi Circuits ◽  
Optimal Designs ◽  
Efficient Design ◽  
Mos Transistors ◽  
Evolutionary Technique ◽  
Random Particle

This paper proposes an efficient design technique for two commonly used VLSI circuits, namely, CMOS current mirror load-based differential amplifier circuit and CMOS two-stage operational amplifier. The hybrid evolutionary method utilized for these optimal designs is random particle swarm optimization with differential evolution (RPSODE). Random PSO utilizes the weighted particles for monitoring the search directions. DE is a robust evolutionary technique. It has demonstrated an exclusive performance for the optimization problems which are continuous and global but suffers from the uncertainty issues. PSO is a robust optimization method but suffers from sub-optimality problem. This paper effectively hybridizes the random PSO and DE to remove the limitations related to both the techniques individually. In this paper, RPSODE is employed to optimize the sizes of the MOS transistors to reduce the overall area taken by the circuit while satisfying the design constraints. The results obtained from RPSODE technique are validated in SPICE environment. SPICE-based simulation results justify that RPSODE is a much better technique than other formerly reported methods for the designs of the above mentioned circuits in terms of MOS area, gain, power dissipation, etc.

scholarly journals Efficient Design of Energy Disaggregation Model with BERT-NILM Trained by AdaX Optimization Method for Smart Grid

Energies ◽  
2021 ◽  
Vol 14 (15) ◽  
pp. 4649
Author(s):  
İsmail Hakkı ÇAVDAR ◽  
Vahit FERYAD
Keyword(s):  
Smart Grids ◽  
Energy Demand ◽  
Optimization Technique ◽  
Cost Effective ◽  
Optimization Method ◽  
Long Term Memory ◽  
Successful Implementation ◽  
Efficient Design ◽  
Energy Disaggregation ◽  
Load Monitoring

One of the basic conditions for the successful implementation of energy demand-side management (EDM) in smart grids is the monitoring of different loads with an electrical load monitoring system. Energy and sustainability concerns present a multitude of issues that can be addressed using approaches of data mining and machine learning. However, resolving such problems due to the lack of publicly available datasets is cumbersome. In this study, we first designed an efficient energy disaggregation (ED) model and evaluated it on the basis of publicly available benchmark data from the Residential Energy Disaggregation Dataset (REDD), and then we aimed to advance ED research in smart grids using the Turkey Electrical Appliances Dataset (TEAD) containing household electricity usage data. In addition, the TEAD was evaluated using the proposed ED model tested with benchmark REDD data. The Internet of things (IoT) architecture with sensors and Node-Red software installations were established to collect data in the research. In the context of smart metering, a nonintrusive load monitoring (NILM) model was designed to classify household appliances according to TEAD data. A highly accurate supervised ED is introduced, which was designed to raise awareness to customers and generate feedback by demand without the need for smart sensors. It is also cost-effective, maintainable, and easy to install, it does not require much space, and it can be trained to monitor multiple devices. We propose an efficient BERT-NILM tuned by new adaptive gradient descent with exponential long-term memory (Adax), using a deep learning (DL) architecture based on bidirectional encoder representations from transformers (BERT). In this paper, an improved training function was designed specifically for tuning of NILM neural networks. We adapted the Adax optimization technique to the ED field and learned the sequence-to-sequence patterns. With the updated training function, BERT-NILM outperformed state-of-the-art adaptive moment estimation (Adam) optimization across various metrics on REDD datasets; lastly, we evaluated the TEAD dataset using BERT-NILM training.

Efficient Structural Design Using a Numerical Optimization Technique

2019 ◽  
Author(s):  
Qian Wang ◽  
Lucas Schmotzer ◽  
Yongwook Kim
Keyword(s):  
Structural Design ◽  
Numerical Optimization ◽  
Optimization Technique ◽  
Optimization Method ◽  
Optimization Techniques ◽  
Convergence Criteria ◽  
Efficient Design ◽  
Concrete Building ◽  
Gradient Based ◽  
Structural Responses

<p>Structural designs of complex buildings and infrastructures have long been based on engineering experience and a trial-and-error approach. The structural performance is checked each time when a design is determined. An alternative strategy based on numerical optimization techniques can provide engineers an effective and efficient design approach. To achieve an optimal design, a finite element (FE) program is employed to calculate structural responses including forces and deformations. A gradient-based or gradient-free optimization method can be integrated with the FE program to guide the design iterations, until certain convergence criteria are met. Due to the iterative nature of the numerical optimization, a user programming is required to repeatedly access and modify input data and to collect output data of the FE program. In this study, an approximation method was developed so that the structural responses could be expressed as approximate functions, and that the accuracy of the functions could be adaptively improved. In the method, the FE program was not required to be directly looped in the optimization iterations. As a practical illustrative example, a 3D reinforced concrete building structure was optimized. The proposed method worked very well and optimal designs were found to reduce the torsional responses of the building.</p>

scholarly journals An Improved Subgradiend Optimization Technique for Solving IPs with Lagrangean Relaxation

2013 ◽  
Vol 61 (2) ◽  
pp. 135-140
Author(s):  
M Babul Hasan ◽  
Md Toha
Keyword(s):  
Dual Problem ◽  
Optimization Problems ◽  
Optimization Technique ◽  
Concave Function ◽  
Optimization Method ◽  
Duality Gap ◽  
Dual Function ◽  
Subgradient Optimization ◽  
Step Size ◽  
Primal Problem

The objective of this paper is to improve the subgradient optimization method which is used to solve non-differentiable optimization problems in the Lagrangian dual problem. One of the main drawbacks of the subgradient method is the tuning process to determine the sequence of step-lengths to update successive iterates. In this paper, we propose a modified subgradient optimization method with various step size rules to compute a tuning- free subgradient step-length that is geometrically motivated and algebraically deduced. It is well known that the dual function is a concave function over its domain (regardless of the structure of the cost and constraints of the primal problem), but not necessarily differentiable. We solve the dual problem whenever it is easier to solve than the primal problem with no duality gap. However, even if there is a duality gap the solution of the dual problem provides a lower bound to the primal optimum that can be useful in combinatorial optimization. Numerical examples are illustrated to demonstrate the method. DOI: http://dx.doi.org/10.3329/dujs.v61i2.17059 Dhaka Univ. J. Sci. 61(2): 135-140, 2013 (July)

scholarly journals Optimization of Gain, Impedance, and Bandwidth of Yagi-Uda Array Using Particle Swarm Optimization

2008 ◽  
Vol 2008 ◽  
pp. 1-4 ◽  
Author(s):  
Munish Rattan ◽  
Manjeet Singh Patterh ◽  
B. S. Sohi
Keyword(s):  
Particle Swarm Optimization ◽  
Method Of Moments ◽  
High Performance ◽  
Optimization Problems ◽  
Optimization Technique ◽  
Computational Cost ◽  
Particle Swarm ◽  
Swarm Optimization ◽  
Evolutionary Technique ◽  
Global Optimization Technique

Particle swarm optimization (PSO) is a new, high-performance evolutionary technique, which has recently been used for optimization problems in antennas and electromagnetics. It is a global optimization technique-like genetic algorithm (GA) but has less computational cost compared to GA. In this paper, PSO has been used to optimize the gain, impedance, and bandwidth of Yagi-Uda array. To evaluate the performance of designs, a method of moments code NEC2 has been used. The results are comparable to those obtained using GA.

Optimization for Minimum Weight of Ultralight Structures Under Axial Crush Loading

2001 ◽  
Author(s):  
Weigang Chen
Keyword(s):  
Cross Sections ◽  
Optimization Problems ◽  
Early Stage ◽  
Minimum Weight ◽  
Optimization Technique ◽  
Efficient Design ◽  
Stage Design ◽  
Axial Crush ◽  
Metal Filler ◽  
Early Stage Design

Abstract A methodology was proposed which combined the structural optimization technique with the recent achievements in crush mechanics of thin-walled members with ultralight metal filler. The optimization problems of foam-filled square, hexagonal, double-hat rectangular, double-hat hexagonal sections and double-walled sandwich sections were formulated and solved with crashworthiness and bending stiffness constraints. The proposed methodology requires relatively simple computations and is suitable for early stage design of crash members. The optimization results showed potentials of significant weight saving and volume reduction by utilizing ultralight metal filler. The double-walled sandwich sections appear to be the most weight efficient design with the highest specific energy absorption among all studied cross-sections.

A New Structural Optimization Method Based on Group Hunting of Animals: Hunting Search (HuS)

2010 ◽  
Author(s):  
R. Oftadeh ◽  
M. J. Mahjoob
Keyword(s):  
Structural Optimization ◽  
Numerical Optimization ◽  
Optimization Problems ◽  
Optimization Technique ◽  
Harmony Search ◽  
Optimization Methods ◽  
Optimization Method ◽  
Global Optimization Methods ◽  
Multi Level ◽  
Group Hunting

This paper presents a novel structural optimization algorithm based on group hunting of animals such as lions, wolves, and dolphins. Although these hunters have differences in the way of hunting but they are common in that all of them look for a prey in a group. The hunters encircle the prey and gradually tighten the ring of siege until they catch the prey. In addition, each member of the group corrects its position based on its own position and the position of other members. If the prey escapes from the ring, the hunters reorganize the group to siege the prey again. A benchmark numerical optimization problems is presented to show how the algorithm works. Three benchmark structural optimization problems are also presented to demonstrate the effectiveness and robustness of the proposed Hunting Search (HuS) algorithm for structural optimization. The objective in these problems is to minimize the weight of bar trusses. Both sizing and layout optimization variables are included, too. The proposed algorithm is compared with other global optimization methods such as CMLPSA (Corrected Multi-Level & Multi-Point Simulated Annealing) and HS (Harmony Search). The results indicate that the proposed method is a powerful search and optimization technique. It yields comparable and in some cases, better solutions compared to those obtained using current algorithms when applied to structural optimization problems.

Pareto-Optimal Solutions for a Truss Problem

2011 ◽  
Vol 423 ◽  
pp. 53-64
Author(s):  
W. El Alem ◽  
A. El Hami ◽  
Rachid Ellaia
Keyword(s):  
Optimization Problems ◽  
Optimization Technique ◽  
Pareto Frontier ◽  
Optimization Method ◽  
Simultaneous Optimization ◽  
Multi Objective Optimization ◽  
Recent Contribution ◽  
Multi Objective ◽  
Structural Problems ◽  
Nbi Method

Most optimization problems, particularly those in engineering design, require the simultaneous optimization of more than one objective function. In this context, the solutions of these problems are based on the Pareto frontier construction. Substantial efforts have been made in recent years to develop methods for the construction of Pareto frontiers that guarantee uniform distribution and exclude the non-Pareto and local Pareto points. The Normal Boundary Intersection (NBI) is a recent contribution that generates a well-distributed Pareto frontier efficiently. Nevertheless, this method should be combined with a global optimization method to ensure the convergence to the global Pareto frontier. This paper proposes the NBI method using Adaptive Simulated Annealing (ASA) algorithm, namely NBI-ASA as a global nonlinear multi-objective optimization method. A well known benchmark multi-objective problem has been chosen from the literature to demonstrate the validity of the proposed method, applicability of the method for structural problems has been tested through a truss problem and promising results were obtained. The results indicate that the proposed method is a powerful search and multi-objective optimization technique that may yield better solutions to engineering problems than those obtained using current algorithms.

scholarly journals Improving optimization using adaptive algorithms

2021 ◽  
Vol 16 (1) ◽  
pp. 14-18
Author(s):  
László Kota ◽  
Károly Jármai
Keyword(s):  
Optimization Problems ◽  
Optimization Technique ◽  
Optimization Methods ◽  
Adaptive Methods ◽  
Optimization Method ◽  
Fine Tuning ◽  
Logistics Industry ◽  
Highly Nonlinear ◽  
Industrial Projects ◽  
Suboptimal Solution

AbstractIn the research projects and industrial projects severe optimization problems can be met, where the number of variables is high, there are a lot of constraints, and they are highly nonlinear and mostly discrete issues, where the running time can be calculated sometimes in weeks with the usual optimization methods on an average computer. In most cases in the logistics industry, the most robust constraint is the time. The optimizations are running on a typical office configuration, and the company accepts the suboptimal solution what the optimization method gives within the appropriate time limit. That is, why adaptivity is needed. The adaptivity of the optimization technique includes parameters of fine-tuning. On this way, the most sensitive setting can be found. In this article, some additional adaptive methods for logistic problems have been investigated to increase the effectivity, improve the solution in a strict time condition.

scholarly journals Optimization of a 3D-Printed Permanent Magnet Coupling Using Genetic Algorithm and Taguchi Method

Electronics ◽  
2021 ◽  
Vol 10 (4) ◽  
pp. 494
Author(s):  
Ekaterina Andriushchenko ◽  
Ants Kallaste ◽  
Anouar Belahcen ◽  
Toomas Vaimann ◽  
Anton Rassõlkin ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Taguchi Method ◽  
Permanent Magnet ◽  
Optimization Problems ◽  
Optimization Method ◽  
Taguchi Optimization ◽  
Torque Density ◽  
Electromagnetic Devices ◽  
3D Printed ◽  
Manufacturing Techniques

In recent decades, the genetic algorithm (GA) has been extensively used in the design optimization of electromagnetic devices. Despite the great merits possessed by the GA, its processing procedure is highly time-consuming. On the contrary, the widely applied Taguchi optimization method is faster with comparable effectiveness in certain optimization problems. This study explores the abilities of both methods within the optimization of a permanent magnet coupling, where the optimization objectives are the minimization of coupling volume and maximization of transmitted torque. The optimal geometry of the coupling and the obtained characteristics achieved by both methods are nearly identical. The magnetic torque density is enhanced by more than 20%, while the volume is reduced by 17%. Yet, the Taguchi method is found to be more time-efficient and effective within the considered optimization problem. Thanks to the additive manufacturing techniques, the initial design and the sophisticated geometry of the Taguchi optimal designs are precisely fabricated. The performances of the coupling designs are validated using an experimental setup.

Well Placement Technique and Production Optimization for Mature Field - A Case Study of L-X Field

2020 ◽  
Vol 46 ◽  
pp. 168-179
Author(s):  
Patrick Nwafor ◽  
Kelani Bello
Keyword(s):  
Oil And Gas ◽  
Optimization Technique ◽  
Optimal Solution ◽  
Oil And Gas Industry ◽  
Optimization Method ◽  
Simulation Software ◽  
Production Optimization ◽  
Direct Optimization ◽  
Well Placement ◽  
Local Optimal Solution

A Well placement is a well-known technique in the oil and gas industry for production optimization and are generally classified into local and global methods. The use of simulation software often deployed under the direct optimization technique called global method. The production optimization of L-X field which is at primary recovery stage having five producing wells was the focus of this work. The attempt was to optimize L-X field using a well placement technique.The local methods are generally very efficient and require only a few forward simulations but can get stuck in a local optimal solution. The global methods avoid this problem but require many forward simulations. With the availability of simulator software, such problem can be reduced thus using the direct optimization method. After optimization an increase in recovery factor of over 20% was achieved. The results provided an improvement when compared with other existing methods from the literatures.

Sign in / Sign up

Export Citation Format

Share Document