Abstract
Recently, the Gamma process has been increasing used to model stochastic deterioration for optimizing maintenance because are well suited for modeling the temporal variability of deterioration. In this paper, we discussed two algorithms of the intelligent technique algorithms with moment method for estimating the parameters of the homogeneous gamma process. The application results demonstrate that the intelligent techniques estimation methods are considerably consistent in estimation compared to the moment method, using mean absolute error (MAE).
Main Subjects
Highlights
By evaluating the results, we concluded that the all data are suitable for the homogeneous gamma process. The intelligent techniques algorithms are the best comparing with moment method and the FA is the best methods used in estimating parameters.
Full Text
1. Introduction
The study of stochastic processes is an important issue in real application, as it is the dynamic part of probability theory. The gamma process is one of the most important types of stochastic processes because of its importance in various fields. Abdel-Hameed (1975) is the first from introduce the gamma process as appropriate model of randomly occurring degradation in time. It is suitable to model gradual damage monotonically accumulating over time in a sequence of small increments such as crack growth, degrading health index, erosion, wear, corrosion, swell and creep (Van Noortwijk 2009). The Dufresne (1991) introduced the gamma process into actuarial literature and defined as a limit of compound Poisson processes and considered it as a model for aggregate claims process (Dickson and Waters 1993). It is has been found useful for analyzing degraduation data (Lawless and Crowder 2004, Wang 2009). In recent years, the nature inspired meta-heuristic algorithms has become widespread because they have the ability to deal with many of practical optimization problems both continuous and discrete in a reasonably time. The meta-heuristic algorithms use search strategies and concepts inspired from nature to explore several regions of the search space more effectively and focusing on some likely regions of the search space. Every meta-heuristic algorithm consists of a set of initial population or initial solutions, the sequence of solutions is then examined step by step based on randomization and some specified rules to reach the optimal solution (Osman 1996, Yang 2015, Faris, Aljarah et al. 2017, Haddad 2018). In this paper, two algorithms are proposed in addition to the moment method for estimating the parameters of the homogeneous gamma process and compare them through mean absolute error. The rest of the paper, is organized as follows. In section 2, we introduce properties the homogeneous gamma process. In section 3, we discuss estimation methods parameters of the homogeneous gamma process. In section 4, we implement the estimation methods used in this paper on real data. In section 5, we show application results.
2. Gamma Process
The gamma process is one of the stochastic processes with independent non-negative increments and having a gamma distribution with an conformable scale parameter (Van Noortwijk 2009, Zhou, Pan et al. 2010). It can be divided into two main types that are homogeneous gamma process and non-homogeneous gamma process, each process has its own properties and parameters. The difference between the two processes depends on the shape parameter. In this study, we will present the homogeneous gamma process.
The homogeneous gamma process is one of the stochastic processes which is the random variables that stationary independent increments and non-negative. Let the homogeneous gamma process which is has the following properties (Roussignol 2009, Wang 2009):
1. with probability one.
2. has independent increments and non-negative.
3. The probability density function (p.d.f) is
where is the shape parameter and is the scale parameter.
4. The mean and the variance for all is
3. Parameters Estimation Methods
3.1 Moment Method
This method is one of the oldest historical estimation methods that introduced by the world statistical Carl Pearson in 1894. It is equal to the moment of the society (about the origin) and the moment of its corresponding sample. The basis of this idea depends on the composition of the equations of random variable moments, thus obtaining several equations equal to the number of parameters estimated and their solution for the parameters of society are estimated for these parameters. The steps for estimating parameters of homogeneous gamma process in this method are as follows (Roussignol 2009).
where and
Eq. (4) can be rewritten as
We can obtain from Eq. (3) as
Compensate the estimated value in Eq. (7), we get the estimated value shown in Eq. (8)
3.2 The Proposed Methods
In this paper, we proposed two methods: particle swarm optimization and firefly algorithm to estimate the parameters of the homogeneous gamma process. Further, we used the mean absolute error to the purpose of comparison between the proposed methods and the moment method.
3.2.1 Particle Swarm Algorithm
Particle swarm optimization is a stochastic optimization algorithm proposed originally for solving continuous optimization problem by Kennedy and Eberhart (1995). The PSO algorithm simulates the social behavior of birds and fish in the way of searching food. PSO algorithm based on population this population is known as swarm, each individuals in the swarm are called the particle which fly in D-dimensional search space. Each particle has a position and velocity to movement within search space where . Each particle is updated through each iteration based on two values: the first value is the best solution , which has been obtained by the particle, and the second value is the current best value , which has been obtained in the swarm. The new velocity and position vectors in each iteration are updated according to the following equations(Rao 2009, Parsopoulos K and Vrahatis M 2010, Wang 2018).
where is the current iteration, refers to the inertia weight. , are the acceleration coefficients and , are the random numbers .
In this paper, a PSO algorithm is proposed to estimate the parameters of the homogeneous gamma process. The parameters are estimated using the suggested method as follows:
1- The number of particles, is set to 50 and the maximum number of iterations is . The acceleration coefficients and are set to 2.05. Further, the minimum and the maximum values for the inertial weight are: and . The inertial weight is updated according to the following equation:
2- The initial positions of the particles are randomly generated from a uniform distribution in range [0,100] where the position of a particle represents the parameters of the homogeneous gamma process.
3- The initial velocities of each particle are generated from a uniform distribution within the range [0, 4].
4- The fitness function represents the mean absolute error, which can be defined as
The fitness function are calculated for all particles, the and vectors are determined.
5- The particles In each iteration adjust the velocity according to Eq.(9) which is used to update the positions of particles according to Eq.(10).
6- Steps 4 and 5 are repeated until a is reached.
3.2.2 Firefly Algorithm
Firefly algorithm is a meta-heuristic algorithm inspired by the flashing behavior of fireflies. It is proposed originally by (Yang 2008) for solving optimization problems with continuous variables. In firefly algorithm three main rules are used (Yang 2014, Tilahun and Nnotchouyge 2017):
1- All fireflies are unisex so that one firefly can be attracted to any other firefly.
2- The brightness of firefly is determined by the objective function.
3- The attractiveness of firefly is proportional to brightness. Thus, for any two flashing fireflies the less bright one moves towards brighter one, while it will move randomly when there is no brighter one than a specific firefly.
The brightness of a firefly with the distance can be defined as:
where is the distance between two fireflies, is a light absorption coefficient and is the brightness when the distance is zero.
The distance between two fireflies and is computed using the Euclidean distance:
where is the component of the firefly. The movement of a firefly attracted by another firefly that is brighter is computed as:
where is a parameter which controls the step and rand is a random number . In this paper, a firefly algorithm is proposed to estimate the parameters of the homogeneous gamma process. The parameters are estimated using the suggested method as follows:
1- The population size is set to 50 and the maximum number of iterations is . The firefly parameters was set as and .
2- The initial positions of the fireflies are randomly generated from a uniform distribution in range [0,100] where the position of a firefly represents the parameters of the homogeneous gamma process.
3- Evaluate the fitness function that is represents the mean absolute error, which can be defined as in Eq. (12).
4- The attractiveness of a firefly is computed according to Eq. (13).
5- The movement of a firefly attracted by another firefly that is brighter according to Eq. (15).
6- Steps 3 and 5 are repeated until a is reached.
4. Application Results
In this section, five datasets with different sample sizes are used. First to Four datasets , the number of operating (hours) between successive failures of air conditioning equipment in 4 Boeing 720 aircraft (Cox and Lewis 1966). And the Five dataset, the operating time for a filtration system for the General Company for Fertilizer industry in the Southern Region. By using the Kolmogorov goodness of fit test to test the appropriateness of datasets for gamma process according to the hypothesis as
Data fit for the gamma process.
Data not fit for the gamma process.
Table 1 represents the Kolmogorov test results. As shown, all the datasets used are fit for the gamma distribution under significant level 0.05. Moreover, all the datasets used are appropriateness for the gamma process.
Table 1: Test fit of the data for gamma distribution
Data |
Kolmogorov |
Critical value |
P-value |
|
Data 1 |
24 |
0.08888 |
0.29931 |
0.98255 |
Data 2 |
27 |
0.12604 |
0.25438 |
0.73788 |
Data 3 |
29 |
0.07855 |
0.24571 |
0.98771 |
Data 4 |
30 |
0.13432 |
0.2417 |
0.60398 |
Data 5 |
37 |
0.16039 |
0.21826 |
0.26728 |
The estimated parameters of the homogeneous gamma process using MO, PSO, and FA are shown in Table 2
Table 2: The estimated parameters of the homogeneous gamma process
Data |
|||||||
Data 1 |
1.0476 |
0.0163 |
2.0000 |
0.4205 |
3.0000 |
0.6998 |
|
Data 2 |
1.4536 |
0.0189 |
3.5000 |
3.4905 |
4.0000 |
3.9953 |
|
Data 3 |
1.3913 |
0.0167 |
1.5000 |
0.0449 |
2.5000 |
0.0851 |
|
Data 4 |
0.6874 |
0.0115 |
1.0000 |
0.1250 |
1.5000 |
0.1635 |
|
Data 5 |
4.9781 |
0.5923 |
5.7000 |
0.7175 |
6.2000 |
0.7757 |
|
Table 3: MAE values of the estimation methods
Data |
MO |
PSO |
FA |
|
Data 1 |
64.1172 |
64.1088 |
64.1061* |
|
Data 2 |
76.8089 |
76.7878 |
76.7859* |
|
Data 3 |
83.5113 |
83.5096 |
83.5086* |
|
Data 4 |
59.5901 |
59.5812 |
59.5800* |
|
Data 5 |
8.3316 |
8.3289 |
8.3275* |
|
In Table 3 summarized the MAE values of the estimation methods, we can be seen that the FA and PSO yields the least MAE value from the Mo method, therefore the intelligent techniquesare better than the moment method in estimating parameters this process for all the datasets.
5. Conclusions
By evaluating the results, we concluded that the all data are suitable for the homogeneous gamma process. The intelligent techniques algorithms are the best comparing with moment method and the FA is the best methods used in estimating parameters.
References