Particle Swarm Optimization of BP-ANN Based Soft Sensor for Greenhouse Climate

Particle Swarm Optimization of BP-ANN Based Soft Sensor for Greenhouse Climate

M. Outanoute, A. Lachhab, A. Selmani, H. Oubehar, A. Snoussi, M. Guerbaoui, A. Ed-dahhak, B. Bouchikhi
Copyright: © 2018 |Pages: 10
DOI: 10.4018/JECO.2018010106
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

In this article, the authors develop the Particle Swarm Optimization algorithm (PSO) in order to optimise the BP network in order to elaborate an accurate dynamic model that can describe the behavior of the temperature and the relative humidity under an experimental greenhouse system. The PSO algorithm is applied to the Back-Propagation Neural Network (BP-NN) in the training phase to search optimal weights baded on neural networks. This approach consists of minimising the reel function which is the mean squared difference between the real measured values of the outputs of the model and the values estimated by the elaborated neural network model. In order to select the model which possess higher generalization ability, various models of different complexity are examined by the test-error procedure. The best performance is produced by the usage of one hidden layer with fourteen nodes. A comparison of measured and simulated data regarding the generalization ability of the trained BP-NN model for both temperature and relative humidity under greenhouse have been performed and showed that the elaborated model was able to identify the inside greenhouse temperature and humidity with a good accurately.
Article Preview
Top

1. Introduction

A greenhouse system is a closed environment where some climate variables can be manipulated in order to obtain adequate climatic conditions, for the development and growth of the cultures, using automatic control strategies (Shamshiri & Ismail 2013). The greenhouse environmental control involves the field of control technology, as the way to optimize inside greenhouse climate based on measured variables and acting on greenhouse equipment (Lu et al., 2015). The dynamics of the climatic variables in a greenhouse are very complex. That is due to the presence of nonlinearities, subjected to strong disturbances (measurable and non-measurable ones) and a high degree of correlation among variables (Frausto & Pieters, 2004; Bennis et al., 2008).

Due to the complexity of the real engineering systems, like the greenhouse system, some importance has been put into implementing Artificial Intelligence (AI) techniques including neural networks, fuzzy logic, neuro-fuzzy, evolutionary algorithms, or some combination among them. Although artificial intelligent methods offer the advantage of the capability of capturing essential functional relationships among the data when such relationships are not a priori known or are very difficult to describe mathematically in situations of the collected data are corrupted by noise. Therefore, they had gained importance and successfully applied in large areas, such as modelling, prediction, control, optimization, business, and financial engineering (He & Ma, 2010).

For plants of high complexity, like greenhouse process, it is of main importance to develop accurate models of the plant which will be used to describe the system behaviour. Furthermore, a perfect model is significant for the parmaters tuning of the controller based on the system’s dynamic model, to design a performance control law (Kiranyaz et al., 2009). In this way, neural networks algorithms are a very sophisticated nonlinear modelling techniques used to perform an accurate modelling of the greenhouse system dynamics for temperature or both air temperature and relative humidity, due to its capability of learning and generalization from examples using the data-driven self-adaptive approach, as long as enough data are presented in the training process (Lai & Zhang, 2009).

Normally, when designing and training a neural network, different architectures must be tried before the one that seems effective is found. Obviously, there is no guarantee that the final selected architecture is the best possible one and for large problems this method becomes impractical. In addition, change in other network parameters such as the learning algorithm or the number of epochs affect the best choice of architecture. This interdependence makes it difficult to find optimal architectures for a given problem (Zhang et al., 2007).

Hence, the heuristic optimization methods which evolve network architectures can solve these problems (Chen et al., 2016; Meng et al., 2016). One of the main advantages of heuristic methods is that they convergence to the optimum solution in more short time than others and convergence fewer to local minimum (Shan Ngan &Wei Tan, 2016).

Particle Swarm Optimization (PSO) algorithm is a new population based heuristic optimization method first proposed by Kennedy and Eberhart (Bas, 2016). It’s an effective swarm intelligence optimization algorithm featuring high search speed and high efficiency. Recently, successful applications of PSO algorithm to the optimization problems attract much attention in various problems intelligence optimization (Aladag et al., 2012). Although, PSO algorithm can be used in terms of the learning algorithm to assist in network training phase in order to adapt connection weight and biases adaptation. This benefits to the ANN since its generalization capability can be improved (Mohammadi & Mirabedini, 2014).

Complete Article List

Search this Journal:
Reset
Volume 22: 1 Issue (2024)
Volume 21: 1 Issue (2023)
Volume 20: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 19: 4 Issues (2021)
Volume 18: 4 Issues (2020)
Volume 17: 4 Issues (2019)
Volume 16: 4 Issues (2018)
Volume 15: 4 Issues (2017)
Volume 14: 4 Issues (2016)
Volume 13: 4 Issues (2015)
Volume 12: 4 Issues (2014)
Volume 11: 4 Issues (2013)
Volume 10: 4 Issues (2012)
Volume 9: 4 Issues (2011)
Volume 8: 4 Issues (2010)
Volume 7: 4 Issues (2009)
Volume 6: 4 Issues (2008)
Volume 5: 4 Issues (2007)
Volume 4: 4 Issues (2006)
Volume 3: 4 Issues (2005)
Volume 2: 4 Issues (2004)
Volume 1: 4 Issues (2003)
View Complete Journal Contents Listing