A multi-stage MPPT algorithm for PV systems based on golden section search method

Author(s):  
Riming Shao ◽  
Rong Wei ◽  
Liuchen Chang
Energies ◽  
2018 ◽  
Vol 11 (11) ◽  
pp. 2966 ◽  
Author(s):  
Victor Andrean ◽  
Pei Chang ◽  
Kuo Lian

Maximum Power Point Tracking (MPPT) enables photovoltaic (PV) systems to extract as much solar energy as possible. Depending on which type of controller is used, PV systems can be classified as centralized MPPT (CMPPT) or decentralized MPPT (DMPPT). In substring-level systems, it is known that the energy yield of DMPPT can outweigh the power electronics cost. At the substring level, it is usually assumed that the PV curve exhibits a single peak, even under partial shading. Thus, the control algorithms for DMPPT are usually less complicated than those employed in CMPPT systems. This paper provides a comprehensive review of four simple DMPPT algorithms, which are perturb and observe (P&O), incremental conductance (INC), golden section search (GSS), and Newton’s quadratic interpolation (NQI). The comparison of these algorithms are done from the perspective of numerical analysis. Guidelines on how to set initial conditions and convergence criteria are thoroughly explained. This is of great interest to PV engineers when selecting algorithms for use in MPPT implementations. In addition, various problems that have never previously been identified before are highlighted and discussed. For instance, the problems of NQI trap is identified and methods on how to mitigate it are also discussed. All the algorithms are tested under various conditions including static, dynamic, and rapid changes of irradiance. Both simulation and experimental results indicate that P&O and INC are the best algorithms for DMPPT.


Author(s):  
Yuanhao Wang ◽  
Michael Berens ◽  
Alexander Nietsch ◽  
Werner John ◽  
Wolfgang Mathis

Purpose – The purpose of this paper is to present an optimization process for the design of a 2×2 patch antenna phased array with application for an UHF RFID system. Design/methodology/approach – The optimization process is based on a method of moment (MoM)-solver, which was individually made to create such patch antenna phased arrays and simulate the radiated field pattern. In combination with this MoM-solver, a GUI, which gives the opportunity to change every physical antenna factor and create the antenna structure within a few minutes is presented. Furthermore the golden section search method is used to produce an even better solution in a more efficient way compared to the first attempt. After the simulation, different types of presentation of results can be chosen for a fast and easy optimization. Findings – The design process is discussed while the authors try to optimize the distance between the elements and the difference of input phase for each patch element. The final goal is to create an antenna with maximum directivity and coverage of field pattern. Practical implications – A physical implementation of an optimized patch antenna phased array and the results of measurement are presented in the end. Originality/value – An optimization process for the design of a 2×2 patch antenna phased array with application for an UHF RFID system is presented. Furthermore the golden section search method is combined with the design process to increase the accuracy of the solution and decrease the time effort.


2018 ◽  
Vol 13 (1) ◽  
pp. 10 ◽  
Author(s):  
Reham Barham ◽  
Ahmad Sharieh ◽  
Azzam Sleit

Moth Flame Optimization (MFO) is one of the meta-heuristic algorithms that recently proposed. MFO is inspired from the method of moths' navigation in natural world which is called transverse orientation. This paper presents an improvement of MFO algorithm based on Golden Section Search method (GSS), namely GMFO. GSS is a search method aims at locating the best maximum or minimum point in the problem search space by narrowing the interval that containing this point iteratively until a particular accuracy is reached. In this paper, the GMFO algorithm is tested on fifteen benchmark functions. Then, GMFO is applied for link prediction problem on five datasets and compared with other well-regarded meta- heuristic algorithms. Link prediction problem interests in predicting the possibility of appearing a connection between two nodes of a network, while there is no connection between these nodes in the present state of the network. Based on the experimental results, GMFO algorithm significantly improves the original MFO in solving most of benchmark functions and providing more accurate prediction results for link prediction problem for major datasets.


Sign in / Sign up

Export Citation Format

Share Document