scholarly journals Controller design of isolated power-electricity island using genetic algorithm

2019 ◽  
Vol 70 (1) ◽  
pp. 46-51
Author(s):  
Ivan Sekaj ◽  
Martin Ernek

Abstract The contribution presents the use of Genetic Algorithm for searching of the optimal parameters of a set of speed controllers of an isolated power-electricity island. Nine PI-controllers are designed. The cost function which is minimised using the Genetic Algorithm represents the integral of the control error area. Robustness aspects of the control design are considered as well.

Energies ◽  
2020 ◽  
Vol 13 (17) ◽  
pp. 4362
Author(s):  
Subramaniam Saravana Sankar ◽  
Yiqun Xia ◽  
Julaluk Carmai ◽  
Saiprasit Koetniyom

The goal of this work is to compute the eco-driving cycles for vehicles equipped with internal combustion engines by using a genetic algorithm (GA) with a focus on reducing energy consumption. The proposed GA-based optimization method uses an optimal control problem (OCP), which is framed considering both fuel consumption and driver comfort in the cost function formulation with the support of a tunable weight factor to enhance the overall performance of the algorithm. The results and functioning of the optimization algorithm are analyzed with several widely used standard driving cycles and a simulated real-world driving cycle. For the selected optimal weight factor, the simulation results show that an average reduction of eight percent in fuel consumption is achieved. The results of parallelization in computing the cost function indicates that the computational time required by the optimization algorithm is reduced based on the hardware used.


2018 ◽  
Vol 11 (12) ◽  
pp. 4739-4754 ◽  
Author(s):  
Vladislav Bastrikov ◽  
Natasha MacBean ◽  
Cédric Bacour ◽  
Diego Santaren ◽  
Sylvain Kuppel ◽  
...  

Abstract. Land surface models (LSMs), which form the land component of earth system models, rely on numerous processes for describing carbon, water and energy budgets, often associated with highly uncertain parameters. Data assimilation (DA) is a useful approach for optimising the most critical parameters in order to improve model accuracy and refine future climate predictions. In this study, we compare two different DA methods for optimising the parameters of seven plant functional types (PFTs) of the ORCHIDEE LSM using daily averaged eddy-covariance observations of net ecosystem exchange and latent heat flux at 78 sites across the globe. We perform a technical investigation of two classes of minimisation methods – local gradient-based (the L-BFGS-B algorithm, limited memory Broyden–Fletcher–Goldfarb–Shanno algorithm with bound constraints) and global random search (the genetic algorithm) – by evaluating their relative performance in terms of the model–data fit and the difference in retrieved parameter values. We examine the performance of each method for two cases: when optimising parameters at each site independently (“single-site” approach) and when simultaneously optimising the model at all sites for a given PFT using a common set of parameters (“multi-site” approach). We find that for the single site case the random search algorithm results in lower values of the cost function (i.e. lower model–data root mean square differences) than the gradient-based method; the difference between the two methods is smaller for the multi-site optimisation due to a smoothing of the cost function shape with a greater number of observations. The spread of the cost function, when performing the same tests with 16 random first-guess parameters, is much larger with the gradient-based method, due to the higher likelihood of being trapped in local minima. When using pseudo-observation tests, the genetic algorithm results in a closer approximation of the true posterior parameter value in the L-BFGS-B algorithm. We demonstrate the advantages and challenges of different DA techniques and provide some advice on using it for the LSM parameter optimisation.


Robotica ◽  
2014 ◽  
Vol 34 (4) ◽  
pp. 823-836 ◽  
Author(s):  
Hamed Shorakaei ◽  
Mojtaba Vahdani ◽  
Babak Imani ◽  
Ali. Gholami

SUMMARYThe current paper presents a path planning method based on probability maps and uses a new genetic algorithm for a group of UAVs. The probability map consists of cells that display the probability which the UAV will not encounter a hostile threat. The probability map is defined by three events. The obstacles are modeled in the probability map, as well. The cost function is defined such that all cells are surveyed in the path track. The simple formula based on the unique vector is presented to find this cell position. Generally, the cost function is formed by two parts; one part for optimizing the path of each UAV and the other for preventing UAVs from collision. The first part is a combination of safety and length of path and the second part is formed by an exponential function. Then, the optimal paths of each UAV are obtained by the genetic algorithm in a parallel form. According to the dimensions of path planning, genetic encoding has two or three indices. A new genetic operator is introduced to select an appropriate pair of chromosome for crossover operation. The effectiveness of the method is shown by several simulations.


2005 ◽  
Vol 02 (02) ◽  
pp. 77-91 ◽  
Author(s):  
XIAOCHUAN WANG ◽  
SIMON X. YANG ◽  
MAX Q.-H. MENG

In this paper, a novel genetic algorithm based approach is proposed for optimal sensor placement and controller design of a mobile robot to facilitate its reactive navigation and obstacle avoidance in unknown environments. The mobile robots considered in this paper have flexible sensor and control structure. A genetic algorithm is developed to evolve the parameters of optimal sensor placement and controller design simultaneously. The effectiveness of the proposed GA based co-evolution approach to robot sensor placement and control design is demonstrated by simulation studies.


Symmetry ◽  
2020 ◽  
Vol 12 (4) ◽  
pp. 660 ◽  
Author(s):  
Jieun Park ◽  
Dokkyun Yi ◽  
Sangmin Ji

The process of machine learning is to find parameters that minimize the cost function constructed by learning the data. This is called optimization and the parameters at that time are called the optimal parameters in neural networks. In the process of finding the optimization, there were attempts to solve the symmetric optimization or initialize the parameters symmetrically. Furthermore, in order to obtain the optimal parameters, the existing methods have used methods in which the learning rate is decreased over the iteration time or is changed according to a certain ratio. These methods are a monotonically decreasing method at a constant rate according to the iteration time. Our idea is to make the learning rate changeable unlike the monotonically decreasing method. We introduce a method to find the optimal parameters which adaptively changes the learning rate according to the value of the cost function. Therefore, when the cost function is optimized, the learning is complete and the optimal parameters are obtained. This paper proves that the method ensures convergence to the optimal parameters. This means that our method achieves a minimum of the cost function (or effective learning). Numerical experiments demonstrate that learning is good effective when using the proposed learning rate schedule in various situations.


2003 ◽  
Vol 1 ◽  
pp. 191-196 ◽  
Author(s):  
L. Zhang ◽  
U. Kleine

Abstract. This paper presents a novel genetic algorithm for analog module placement. It is based on a generalization of the two-dimensional bin packing problem. The genetic encoding and operators assures that all constraints of the problem are always satisfied. Thus the potential problems of adding penalty terms to the cost function are eliminated, so that the search configuration space decreases drastically. The dedicated cost function covers the special requirements of analog integrated circuits. A fractional factorial experiment was conducted using an orthogonal array to study the algorithm parameters. A meta-GA was applied to determine the optimal parameter values. The algorithm has been tested with several local benchmark circuits. The experimental results show this promising algorithm makes the better performance than simulated annealing approach with the satisfactory results comparable to manual placement.


Author(s):  
Teuku Afriliansyah

The cost of teaching lecturers is a routine activity conducted by all universities, especially the maintainers of departments in each faculty. This is done because the number of courses planned students are in every semester is always different and faced with a relatively fixed number of lecturers. Determining the teaching burden of lecturers must be done so that the teaching burden of lecturers does not exceed the maximum possible limit and the teaching process is done in accordance with the interest of lecturer study. Study Program of informatics Education High School and Educational Sciences Earth Persada Lhokseumawe still do the process of determining the teaching burden of the lecturer with the manual so that it takes a little time because it must adjust the infirmity Courses with a lecturer study interest. One of the methods of optimization that is able to solve the problem is genetic algorithm. The genetic algorithm process in this research includes representation with integer numbers, crossover methods with one cut point crossover, mutation methods with Reciprocalexchange mutation and random mutation, as well as selection methods with elitism Selection. Test results that have been tested show optimal parameters i.e. population size 60, combination of CR and Mr Value respectively 0.4, Sertta generation of 3576 with the largest fitness value produced is 0.082846.


Author(s):  
Tad Gonsalves ◽  
◽  
Shinichiro Baba ◽  
Kiyoshi Itoh ◽  

The “survival of the fittest” strategy of the Genetic Algorithm has been found to be robust and is widely used in solving combinatorial optimization problems like job scheduling, circuit design, antenna array design, etc. In this paper, we discuss the application of the Genetic Algorithm to the operational optimization of collaborative systems, illustrating our strategy with a practical example of a clinic system. Collaborative systems (also known as co-operative systems) are modeled as server-client systems in which a group of collaborators come together to provide service to end-users. The cost function to be optimized is the sum of the service cost and the waiting cost. Service cost is due to hiring professionals and/or renting equipment that provide service to customers in the collaborative system. Waiting cost is incurred when customers who are made to wait in long queues balk, renege or do not come to the system for service a second time. The number of servers operating at each of the collaborative places, and the average service time of each of the servers are the decision variables, while server utilization is a constraint. The Genetic Algorithm tailored to collaborative systems finds the minimum value of the cost function under these operational constraints.


2018 ◽  
Author(s):  
Vladislav Bastrikov ◽  
Natasha MacBean ◽  
Cédric Bacour ◽  
Diego Santaren ◽  
Sylvain Kuppel ◽  
...  

Abstract. Land surface models (LSMs), used within earth system models, rely on numerous processes for describing carbon, water and energy budgets, often associated with highly uncertain parameters. Data assimilation (DA) is a useful approach for optimising the most critical parameters in order to improve model accuracy and refine future climate predictions. In this study, we compare two different DA methods for optimising the parameters of seven plant functional types (PFTs) of the ORCHIDEE land surface model using daily averaged eddy-covariance observations of net ecosystem exchange and latent heat flux at 78 sites across the globe. We perform a technical investigation of two classes of minimisation methods – local gradient-based (the L-BFGS-B algorithm) and global random search (the genetic algorithm) – by evaluating their relative performance in terms of the model–data fit and the difference in retrieved parameter values. We examine the performance of each method for two cases: when optimising parameters at each site independently (single-site approach) and when simultaneously optimising the model at all sites for a given PFT using a common set of parameters (multi-site approach). We find that for the single site case the random search algorithm results in lower values of the cost function (i.e. lower model – data root mean square differences) than the gradient-based method; the difference between the two methods is smaller for the multi-site optimisation due to a smoothing of the cost function shape with a greater number of observations. The spread of the cost function, when performing the same tests with 16 random first guess parameters, is much larger with the gradient based method, due to the higher likelihood of being trap in local minima. When using pseudo-observations tests the genetic algorithm results in a closer approximation of the true posterior parameter value in the L-BFGS-B algorithm. We demonstrate the advantages and challenges of different DA techniques and provide some advice on using it for the LSM parameters optimisation.


2012 ◽  
Vol 253-255 ◽  
pp. 1406-1409 ◽  
Author(s):  
Xin Lai Tang ◽  
Shu Hong Yang

Considering the influence that the cycles of signal lamp have on the waiting time, a bus scheduling model is presented in this paper based on the trade-off between the cost of bus operator and benefits of passengers. In order to handle with the low efficiency brought about by the refused strategy, a new fitness function is designed according to penalty strategy, and then traditional genetic algorithm is replaced by quantum genetic algorithm to accelerate the search of optimal parameters further. The results of experiment show that the presented method is effective.


Sign in / Sign up

Export Citation Format

Share Document