Structural Optimizations of a 12/8 Switched Reluctance Motor using a Genetic Algorithm

Similar documents
CHAPTER 5 STRUCTURAL OPTIMIZATION OF SWITCHED RELUCTANCE MACHINE

ARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS

Genetic Algorithms Variations and Implementation Issues

Heuristic Optimisation

GENETIC ALGORITHM with Hands-On exercise

Network Routing Protocol using Genetic Algorithms

Topological Machining Fixture Layout Synthesis Using Genetic Algorithms

Genetic Algorithms. Kang Zheng Karl Schober

DETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES

Genetic Algorithms for Vision and Pattern Recognition

The Genetic Algorithm for finding the maxima of single-variable functions

Evolutionary Computation Algorithms for Cryptanalysis: A Study

Genetic Algorithms. PHY 604: Computational Methods in Physics and Astrophysics II

Design of Experiments Based Optimization of Synchronous and Switched Reluctance Machines

Effect of Cleaning Level on Topology Optimization of Permanent Magnet Synchronous Generator

A New Selection Operator - CSM in Genetic Algorithms for Solving the TSP

COMPARISON OF SOME OPTIMIZATION TECHNIQUES FOR EFFICIENCY OPTIMIZATION OF INDUCTION MOTOR

March 19, Heuristics for Optimization. Outline. Problem formulation. Genetic algorithms

Grid Scheduling Strategy using GA (GSSGA)

ISSN: [Keswani* et al., 7(1): January, 2018] Impact Factor: 4.116

Suppose you have a problem You don t know how to solve it What can you do? Can you use a computer to somehow find a solution for you?

Time Complexity Analysis of the Genetic Algorithm Clustering Method

Introduction to Evolutionary Computation

SIMULATED ANNEALING TECHNIQUES AND OVERVIEW. Daniel Kitchener Young Scholars Program Florida State University Tallahassee, Florida, USA

Introduction to Genetic Algorithms

Towards Automatic Recognition of Fonts using Genetic Approach

Genetic Algorithm for optimization using MATLAB

An Evolutionary Algorithm for the Multi-objective Shortest Path Problem

Meta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic Algorithm and Particle Swarm Optimization

Torque Ripple Minimization in PM Synchronous Motors Using Tooth Shape Optimization

Chapter 14 Global Search Algorithms

CS:4420 Artificial Intelligence

Genetic Algorithm for Finding Shortest Path in a Network

Optimization of Function by using a New MATLAB based Genetic Algorithm Procedure

Introduction to Genetic Algorithms. Based on Chapter 10 of Marsland Chapter 9 of Mitchell

DERIVATIVE-FREE OPTIMIZATION

A Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2

CHAPTER 6 REAL-VALUED GENETIC ALGORITHMS

Introduction (7.1) Genetic Algorithms (GA) (7.2) Simulated Annealing (SA) (7.3) Random Search (7.4) Downhill Simplex Search (DSS) (7.

Research Article Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding

AN EVOLUTIONARY APPROACH TO DISTANCE VECTOR ROUTING

Optimization of Association Rule Mining through Genetic Algorithm

Role of Genetic Algorithm in Routing for Large Network

A NOVEL APPROACH FOR PRIORTIZATION OF OPTIMIZED TEST CASES

International Journal of Digital Application & Contemporary research Website: (Volume 1, Issue 7, February 2013)

ANTICIPATORY VERSUS TRADITIONAL GENETIC ALGORITHM

Flow Field Analysis of Turbine Blade Modeling Based on CFX-Blade Gen

What is GOSET? GOSET stands for Genetic Optimization System Engineering Tool

CHAPTER 4 GENETIC ALGORITHM

Aero-engine PID parameters Optimization based on Adaptive Genetic Algorithm. Yinling Wang, Huacong Li

Multi-objective Optimization

REAL-CODED GENETIC ALGORITHMS CONSTRAINED OPTIMIZATION. Nedim TUTKUN

A Genetic Algorithm for Multiprocessor Task Scheduling

CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM

Comparative Analysis of Genetic Algorithm Implementations

Evolutionary form design: the application of genetic algorithmic techniques to computer-aided product design

Using Genetic Algorithm to Break Super-Pascal Knapsack Cipher

Artificial Intelligence Application (Genetic Algorithm)

Evolutionary Computation. Chao Lan

Genetic Programming. and its use for learning Concepts in Description Logics

Evolutionary Algorithms. CS Evolutionary Algorithms 1

The k-means Algorithm and Genetic Algorithm

Study on GA-based matching method of railway vehicle wheels

The Binary Genetic Algorithm. Universidad de los Andes-CODENSA

ATI Material Do Not Duplicate ATI Material. www. ATIcourses.com. www. ATIcourses.com

Path Planning Optimization Using Genetic Algorithm A Literature Review

AI Programming CS S-08 Local Search / Genetic Algorithms

A GENETIC ALGORITHM APPROACH TO OPTIMAL TOPOLOGICAL DESIGN OF ALL TERMINAL NETWORKS


Advanced Search Genetic algorithm

Genetic Algorithm Based Template Optimization for a Vision System: Obstacle Detection

Contributions to the Two Degrees of Freedom Modular Variable Reluctance Motors Used in Advanced Manufacturing Systems

A Steady-State Genetic Algorithm for Traveling Salesman Problem with Pickup and Delivery

A Method Based Genetic Algorithm for Pipe Routing Design

HYBRID GENETIC ALGORITHM WITH GREAT DELUGE TO SOLVE CONSTRAINED OPTIMIZATION PROBLEMS

Applying genetic algorithm on power system stabilizer for stabilization of power system

Planning and Search. Genetic algorithms. Genetic algorithms 1

DETERMINING PARETO OPTIMAL CONTROLLER PARAMETER SETS OF AIRCRAFT CONTROL SYSTEMS USING GENETIC ALGORITHM

A Hybrid Genetic Algorithm for the Distributed Permutation Flowshop Scheduling Problem Yan Li 1, a*, Zhigang Chen 2, b

Segmentation of Noisy Binary Images Containing Circular and Elliptical Objects using Genetic Algorithms

Automata Construct with Genetic Algorithm

Genetic Programming: A study on Computer Language

Neural Network Weight Selection Using Genetic Algorithms

The movement of the dimmer firefly i towards the brighter firefly j in terms of the dimmer one s updated location is determined by the following equat

Minimum Weight Optimization of a Gear Train by using Genetic Algorithm

Solving A Nonlinear Side Constrained Transportation Problem. by Using Spanning Tree-based Genetic Algorithm. with Fuzzy Logic Controller

Introduction to Optimization

Test Data Generation with A Hybrid Genetic Tabu Search Algorithm for Decision Coverage Criteria

Preliminary Background Tabu Search Genetic Algorithm

Search Algorithms for Regression Test Suite Minimisation

Escaping Local Optima: Genetic Algorithm

Exploration vs. Exploitation in Differential Evolution

Hybridization of Genetic Algorithm and Linear Programming for Solving Cell Formation Problem with Alternative Process Routings

METAHEURISTICS Genetic Algorithm

Hybrid Optimization Strategy using Response Surface Methodology and Genetic Algorithm for reducing Cogging Torque of SPM

Genetic Algorithm. Dr. Rajesh Kumar

Sımultaneous estımatıon of Aquifer Parameters and Parameter Zonations using Genetic Algorithm

[Premalatha, 4(5): May, 2015] ISSN: (I2OR), Publication Impact Factor: (ISRA), Journal Impact Factor: 2.114

GENETIC ALGORITHM METHOD FOR COMPUTER AIDED QUALITY CONTROL

Optimization Technique for Maximization Problem in Evolutionary Programming of Genetic Algorithm in Data Mining

Transcription:

International Journal of Sustainable Transportation Technology Vol. 1, No. 1, April 2018, 30-34 30 Structural Optimizations of a 12/8 Switched Reluctance using a Genetic Algorithm Umar Sholahuddin 1*, Agus Purwadi 2, Yanuarsyah Haroen 2 1 Electric Energy Conversion Research Laboratory, School of Electrical Engineering & Informatics, Institut Teknologi Bandung, Indonesia 2 National Center for Sustainable Transportation Technology, Indonesia *Email: umaritb@gmail.com Abstract Structural design optimization of 12/8 switched reluctance motor using single objectives genetic algorithms is explored. The objective of this optimization is to maximize the output torque using four parameters, namely rotor width of tooth root, rotor width of tooth tip, half of stator tooth width, and stator outer diameter. The result is the optimized motor has higher average torque of 25% compared to the initial design. The evaluation of motor model is finite element method. The 12/8 switched reluctance motor will be applied in a mini electric vehicle. Keywords Switched reluctance motor; JMAG; Finite element analysis; Electric vehicle; Single objective genetic optimization 1 Introduction Switched Reluctance (SRM) is one of the most promising drivetrains for an electric vehicle, this motor has several advantages such as low cost, robust construction, and high starting torque [1]. The designing procedure of SRM has been widely documented, but only few papers discussed the design optimization. The classic method for shape modification can optimize the electric motor, such as hill climbing [2]. However, this method has several disadvantages: (1) this algorithm effectiveness depends on starting point, (2) this algorithm can be trapped in local optimum, and (3) a huge time is required to explore the searching space [3]. Genetic Algorithm (GA) is one of the widely used optimization processes due to its robustness [4]. The GA has many advantages: (1) the parallel ability to work in the population of points, (2) the ability to locate the global optimum with higher probability, (3) the ability to handle discrete parameter, and (4) reasonable computation time. Faiz et al. [5] has explored the maximization of an average output torque of the SRM using GA. In this paper, the adaptation of the GA for structural optimization of SRM is presented. 2 Design Methodology The motor design optimization method aims to find the vector X = X #,, X & which most represents the design variables and corresponds with the objective function F(X). It can be minimized or maximized with the limited constraint. The lowest and highest boundaries are G + = g # X,, g & X. This method is applied to the initial motor design. It consists of vector X which represent the constraints of the geometrical parameters. The geometrical parameter has to be constructed to ensure the dimensional feasibility of the electric motor. In this paper, the geometric parameters are (1) rotor width of tooth root, (2) rotor width of tooth tip, (3) half of stator tooth width, and (4) stator outer diameter. Figure 1 shows the typical 12/8 SRM. Figure 1 Typical 12/8 switched-reluctance motor 3 Genetic Algorithm GA introduces the method that basically consists of searching tools. This algorithm is adapted from the mechanism of organism genetics and environmental selection process. This algorithm runs on a habitant of several individual s solutions and employs the survival Received October 19, 2017, Revised March 4, 2018, Accepted for publication March 10, 2018

Structural Optimization of a 12/8 Switched Reluctance using a Genetic Algorithm 31 base of the best individual to evolve. The best results will be chosen to optimize the solutions. In GA, contender solutions are referred to as individuals. The characteristic of these individuals (parameters) are encoded to chromosomes which composed of a series of genes [6]. GA has three unique operators. The first is selection, the second is crossover, and the last is mutation. In every iteration or generation, these operators are used on a population of possible solution to improve their compatibility. Each individual is represented by chromosomes. These individuals are similar to the natural chromosomes. The number of individuals are randomly created, and then the reproduction starts until one of the three conditions are met: (1) a stopping criterion is met, (2) the certain number of generations is reached, or (3) no further improvement among the individuals. There are three main kinds of GA operator: selection, crossover, and mutation. Crossover operation takes two candidates from the population and makes two new solutions. Mutation takes a single individual and alters it. The usage of these two types of operators depends on the applied encoding method to the chromosomes [7]. 3.1 Operators of GA The selection function performs a crucial role in the GA. This operator selects which individuals will live or vanish in the next generations. Based on the selection theory, fitted individuals have better opportunity to live. Afterward, the random numbers are generated and compared against the cumulative probability of the population. There are two kinds of selections such as roulette wheel selection and tournament selection. The selection of roulette wheel method determines the selection probability for each chromosome as proportional to the fitness value. This method is based on spinning an imaginary roulette wheel which the number of times equal to the size of the population. In contrast, tournament selection is different since this method does not require selection probabilities assignment. The requirements are to select k individuals randomly (with replacements) and to choose the best of them (using the fitness function) to be in the new population. This process is repeated until the same number of individuals in the new population is obtained. Crossover is the recombination of two or more parental solutions to produce a new individual which has a chance to get better results. There are many ways of accomplishing this, and the performance of the operator depends on a properly designed crossover technique. The child property value of the two parents will not resemble the parents value. This operator has two kinds of operators such as single and multi crossover point techniques. The single crossover point is randomly selected, and the genes of the parents are exchanged after the crossover point. Multi crossover point technique is randomly chosen, and the genes of the parents are exchanged in between the crossover points. In natural evolution, mutation happens as the product of an error in copying the gene information. As an analogy to this, mutation in GA is a process of changing some information genes on chromosomes randomly. The main role of mutation operator is to keep the diversity of individual in the population. Normally, in the canonical GA using binary representation, mutation operator turns over the selected bit value between two individuals. 3.2 Fitness and constraints The final step is the evaluation stage where each individual gets a fitness value. This step determines the chance of being in the next generation. In an optimization problem, this is normally done by the objective function F(X). The minimization or maximization of F(X) is the objective of the optimization problem. In a constrained optimization case, the constraint vector G(X) has to be considered. This is going to influence the original objective function in such a way that if any of constraints are not fit for one of the individuals, so the value of the fitness value will be so low. This individual will probably not be going to be chosen for the next generation. This can be done by penalizing the objective function for these cases, which yields the final fitness function F(X). This technique will evaluate the model of the problems [8]. 4 12/8 SRM Optimization The initial dimension SRM has been chosen to start and compare the optimization results. The initial design is a 3 kw, 60 V, 3 phases, 3000 rpm, and air-cooled SRM. The fixed parameters of this motor are: maximum current density (J max ) of 10,007 103 A/m 2, shaft diameter (D sh ) of 0.039 m, and maximum flux density (B max ) of 2.094 T. The objective of this optimization is to maximize the output torque. The design variables of the main parameters are the rotor width of tooth root parameters, rotor width of tooth tip parameters, half of stator tooth width parameters, and stator outer diameter. This method is expected to improve the output torque and output power. JMAG is an analysis software for finite element analysis. This simulation software used for electric

32 Umar Sholahuddin, et al. machine design applications. By using this software, a motor is designed with the initial dimension described in Table 1. The dimension of motor stator is illustrated in Figure 2 while the dimension of the motor rotor is described in Figure 3. Table 1 Geometric Parameters Parameters Description Values p s Number of stator poles 12 p r Number of rotor poles 8 l g Air gap length 0.5 mm D so Stator outer diameter 140 mm D Bore diameter 83 mm Length Core length 80 mm C Back iron width 16 mm N p Number of turn/phase 150 β s Width of stator pole 11 mm β rr Width of rotor pole tip 12 mm β rt Width of rotor pole root 12 mm D sh Shaft 28 mm N Speed 3000 r/min P Output power design 3000 W Figure 3 Rotor dimension of 12/8 switched reluctance motors (unit in mm). 5 12/8 SRM Optimization Results The results of single objectives optimization using GA with JMAG software are obtained. The generation design in 10 iterations of each generation has 15 motor populations. Each iteration generates 5 children. The step size dimensional searching is 0.5 mm. Figure 4 plots all the motor case in 10 generations and their correlation with the output torque. This optimization used 10 generations and 10 individuals in each generation. Figure 4 Correlation between output torque and all SRM motors. Figure 2 Stator dimension of 12/8 switched reluctance motors (unit in mm). 5.1 Optimization results The effect of motor rotor width of tooth root to the output torque is described in Figure 5. The correlation between output torque and rotor width of tooth tip shown in Figure 6. The correlation the between output torque and half of stator tooth width is described in Figure 7. The correlation the between output torque and stator outside diameter is described in Figure 8. Based on this result, it is shown that the output torque has a non-linear correlation compared to the geometric parameters. There are two motors with the same outer stator diameter that produce higher output torque (T <=> ), they are motor number 77 and number 101 with output torque 7.84 Nm and 7.71 Nm, respectively. The description is shown in Figure 8 and Table 2.

Structural Optimization of a 12/8 Switched Reluctance using a Genetic Algorithm 33 Figure 5 Correlation between output torque and rotor width of tooth root. Figure 8 Correlation between output torque and stator outside diameters. Table 2 diameter Comparison with the same outer 1 77 101 β s (mm) 11 7.82 8.34 β rr (mm) 12 6.53 7.42 β rt (mm) 12 7.45 5.05 D so (mm) 140 140 139.7 T max (Nm) 6.277 7.84 7.71 Figure 6 Correlation between output torque and rotor width of tooth tip. 5.2 s characteristic The three motor characteristics will be described. The output torque plot is shown in Figure 9, the flux linkage is shown in Figure 10, and the inductance characteristic for every individual plot is shown in Figure 11. The optimized switched reluctance design has an average torque of 7.8488 Nm and the initial motor has an output torque of 6.277 Nm. Thus, there is an improvement about 25% compared to the initial design. The motor number 156, 145, 143 has yield the best optimization in the population because they produced the highest output torque as shown in Figure 12 with the geometric parameters are shown in Table 3. Figure 7 Correlation between output torque and half of stator tooth width. Figure 9 Static torque for every SRM motors

34 Umar Sholahuddin, et al. of time so the termination method or generation determination is important. This optimized design will be useful for mini electric vehicle. Figure 10 Flux linkage characteristic for every SRM motors. Figure 11 Inductance characteristic for every SRM motors. Figure 12 Best 12/8 SRM motor compared to initial motor Acknowledgment This paper is supported by USAID through Sustainable Higher Education Research Alliances (SHERA) Program - Centre for Collaborative (CCR) National Center for Sustainable Transportation Technology (NCSTT) with Contract No. IIE00000078-ITB-1. References [1] J. W. James, B. Berker, H. Brock, and E. Ali, Design optimization of switched reluctance machine using genetic algorithm, In 2015 IEEE International Electric Machines & Drives Conference (IEMDC), 2015. [2] U. Sholahuddin, A. Purwadi, Y. Haroen, Design procedure for a 5 KW mini electric vehicle drivetrains, In 3rd Conference on Power Engineering and Renewable Energy (ICPERE), 2016. [3] N. Bianchi and S. Bolognani, Design optimization of electric motors by genetic algorithms, IEE Proceedings Electric Power Applications, vol. 145, pp. 475 483, 1998. [4] T. L. Tobing, T. D. Rachmilda, H. Hindersah, A. Rizqiawan and Y. Haroen, Rectifier substation optimum position on DC traction systems, In 4th International Conference on Electric Vehicular Technology (ICEVT), 2017. [5] T. J. E. Miller and M. McGlip, Nonlinear theory of the switched reluctance motor for rapid computer-aided design, IEE Proceedings B Electric Power Applications, vol. 137, pp. 337 347, 1990. [6] J. Faiz and J. W. Finch, Aspects of design optimization for switched reluctance motors, IEEE Transaction on Energy Conversion, vol. 8, pp. 704 713, 1993. [7] Y. Lin, M. Wang, Y. Wang, and F. Wan, Simulation research on switched reluctance motor modeling and control strategy based on ANSOFT, In IEEE International Conference on Measuring Technology and Mechatronics Automation, 2010. [8] B. Tariq, B. Amar, D. Hind, and B. Ilhem, Finite element modeling and dynamic simulation of nonlinear VRM using MATLAB, In the 5 th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO), 2013. Table 3 Geometric Parameters 1 156 145 143 β s (mm) 11 9.56 9.2 10.28 β rr (mm) 12 9.48 10.56 10.66 β rt (mm) 12 5.5 5.84 6.45 D so (mm) 140 144.8 145.36 146.03 T max (Nm) 6.277 7.8488 7.8488 7.8488 6 Conclusion This paper has built single objective optimization based on GA using JMAG software. Two-dimensional design problem of 12/8 SRM has been explored. It is found that GA is reliable for a structural SRM optimization. An important conclusion of this optimization has taken a lot