Next Article in Journal
Automated Evaluation Method for Risk Behaviors of Quay Crane Operators at Ports Using Virtual Reality
Next Article in Special Issue
Local Search Heuristic for the Two-Echelon Capacitated Vehicle Routing Problem in Educational Decision Support Systems
Previous Article in Journal
Enhanced Curvature-Based Fabric Defect Detection: A Experimental Study with Gabor Transform and Deep Learning
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On the Estimation of Logistic Models with Banking Data Using Particle Swarm Optimization

by
Moch. Fandi Ansori
1,*,
Kuntjoro Adji Sidarto
2,
Novriana Sumarti
3 and
Iman Gunadi
4
1
Department of Mathematics, Faculty of Science and Mathematics, Universitas Diponegoro, Semarang 50275, Indonesia
2
Center for Mathematical Modelling and Simulations, Institut Teknologi Bandung, Bandung 40132, Indonesia
3
Industrial and Financial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Bandung 40132, Indonesia
4
Bank Indonesia Institute, Jakarta 10110, Indonesia
*
Author to whom correspondence should be addressed.
Algorithms 2024, 17(11), 507; https://doi.org/10.3390/a17110507
Submission received: 26 September 2024 / Revised: 2 November 2024 / Accepted: 4 November 2024 / Published: 5 November 2024
(This article belongs to the Special Issue New Insights in Algorithms for Logistics Problems and Management)

Abstract

:
This paper presents numerical works on estimating some logistic models using particle swarm optimization (PSO). The considered models are the Verhulst model, Pearl and Reed generalization model, von Bertalanffy model, Richards model, Gompertz model, hyper-Gompertz model, Blumberg model, Turner et al. model, and Tsoularis model. We employ data on commercial and rural banking assets in Indonesia due to their tendency to correspond with logistic growth. Most banking asset forecasting uses statistical methods concentrating solely on short-term data forecasting. In banking asset forecasting, deterministic models are seldom employed, despite their capacity to predict data behavior for an extended time. Consequently, this paper employs logistic model forecasting. To improve the speed of the algorithm execution, we use the Cauchy criterion as one of the stopping criteria. For choosing the best model out of the nine models, we analyze several considerations such as the mean absolute percentage error, the root mean squared error, and the value of the carrying capacity in determining which models can be unselected. Consequently, we obtain the best-fitted model for each commercial and rural bank. We evaluate the performance of PSO against another metaheuristic algorithm known as spiral optimization for benchmarking purposes. We assess the robustness of the algorithm employing the Taguchi method. Ultimately, we present a novel logistic model which is a generalization of the existence model. We evaluate its parameters and compare the result with the best-obtained model.

1. Introduction

The logistic growth model, or simply the logistic model, becomes an important part of multidisciplinary science that deals with modeling data that have a tendency to grow exponentially in the early phase, and in the next phase, it saturates and slows down until the growth stops. In mathematical biology, the logistic model is often used in modeling the growth of a population [1,2], the growth of some species size [3,4,5,6], and the cases of an endemic disease [7,8]. Meanwhile, in banking and finance, the model is used to model the growth of deposits and loans of a bank [9,10,11,12]. The benefit of using logistic model-to-model data is usually to know the prediction of the peak growth and when it occurs and to predict some number called carrying capacity.With this prediction, a policy can be made to deal with the control of the growth of the data.
The logistic model was first introduced by Pierre-François Verhulst in the middle of the nineteenth century [13]. Later, in 1911 and 1920, it was rediscovered by McKendrick and Pai and Pearl and Reed, respectively. McKendrick and Pai studied the rate of the multiplication of micro-organisms that must be proportional to the current number and the lack of foods [4]. Pearl and Reed derived the logistic function for representing the U.S. population growth [1]. Two years later, Pearl and Reed made a generalization by taking the growth rate parameter as a function of time [2].
Years later, for empirical purposes, many researchers modified the logistic model directly or indirectly from the previous researchers. For instance, von Bertalanffy studied the growth of length and weight of guppy fish (Lebistes reticulatus) [14] and the connections between metabolism and the growth rate of living organisms [15], Richards extended the von Bertalanffy model to become more flexible and tested the plant data [16], Blumberg proposed a modification in the Verhulst model for modeling the population or organism size [17], Turner et al. presented the generalization called generic growth model [18], and then Tsoularis generalized the generic growth model in [19]. It also needs to be noted that there is a Gompertz function [20] that belongs to the family of logistic functions. In [18], Turner et al. also discussed the hyper-Gompertz function.
In this paper, we use the logistic model to model banking assets growth. Many banking asset forecasting methods employ statistical methodologies that focus exclusively on short-term data predictions, such as [21,22,23]. Deterministic models are rarely utilized in banking asset forecasting, despite their ability to project data behavior over prolonged periods. Therefore, this work utilizes logistic model prediction. We use Indonesian banking data from the period January 2007–January 2020. The rationale for using the logistic model in analyzing the growth of banking assets is as follows. For a healthy bank, the amount of assets has a tendency to always go up exponentially, although, in some parts, it also fluctuates. However, for several reasons of the bank’s internal and external limitations, there should be an upper threshold number for banking asset growth which can be seen as the carrying capacity in the logistic model. A bank is a financial institution with a main intermediary function, which is accepting deposits and providing loans. A bank can be classified as a commercial bank or a rural bank. The objects of this study are the data of assets of Indonesian commercial and rural banks. Commercial banks carry out their business activities conventionally or according to Sharia, in which there are also services in payment transmission services, while rural banks do not provide services in payment transmission. Commercial banks also have a wider range of financial products than rural banks, such as foreign exchange, insurance businesses, and equity participation. In terms of service areas, commercial banks can serve at the village, city, provincial, national, and international levels, and on the other hand, rural banks’ service areas are limited to districts or cities. Therefore, the total assets of commercial banks are certainly far greater than rural banks; see Figure 1a,b. The monthly fluctuation of the assets can be seen in Figure 1c,d. The reason why we need to distinguish between commercial and rural bank data, without collecting them into a single data unit, is that we want to see whether the dynamics of growth in commercial banking assets (big banks) are different or the same as the dynamics of rural banking (small banks) asset growth. Whether the two data will fit into the same or different logistic models is our concern.
In the application of a logistic model to modeling data, the problem of estimating the model’s parameters is unavoidable. In the logistic model, it can be said that the parameters can be divided into two groups, the first group is the parameters with a small estimated value, and the second group is the carrying capacity parameter which may have a very large value. The gap between the two groups causes parameter estimation problems in a search area that is in the form of a very long rectangle. Such a search area will complicate classical numerical methods; for example, Newton’s method with its gradient and Hessian which requires guessing the initial value. The large value of carrying capacity will interfere with the performance of the Newton method. Meanwhile, a metaheuristic algorithm such as the spiral optimization (SpO) algorithm [24,25], which is very powerful for an optimization problem in a square search area as it has an iteration update in the form of spiral rotation, will also experience weaknesses in estimating the parameters of the logistic model because the update in each iteration will create search points that exit the search area.
Particle swarm optimization (PSO), an optimizer based on the bird or fish-flocking behavior in search of optimal food resources, is one of the metaheuristic methods that is unaffected by the size of the search area because the updating of search points in the PSO method can adapt to the size of the search area. Thus, the algorithm will be very suitable for estimating the parameters of logistic models. To avoid discovering search points outside the search area, the PSO method might include a condition that ensures all search points remain within the search area. In this study, numerous logistic models’ parameters are estimated using PSO. In order to reduce the time required to complete iterations, we employ the Cauchy criterion in addition to the maximum number of iterations as a stop condition. Using the Cauchy criterion, we can automatically halt the algorithm if we suspect that it has attained convergence. Although there have been so many variants of PSO in the literature, including recent developments in [26,27,28,29], this paper uses the standard PSO algorithm with a decreasing inertia weight [30,31]. To check the algorithm’s robustness, we apply the Taguchi method [32,33] to determine the optimal parameters for PSO.
The organization of this paper is as follows. In Section 2, we present a review of nine logistic models used in this paper. Section 3 provides the PSO algorithm. Section 4 describes the implementation of the logistic models’ parameter estimation as well as the strategy for the optimization problems. Section 5 presents the numerical result of the parameter estimation and determines the best logistic models for the commercial and rural bank data. In Section 6, we compare the result of PSO with the SpO algorithm as a benchmark. In Section 7, we check the robustness of PSO by tuning the parameters using the Taguchi method. In Section 8, we propose a new logistic model as the generalization of the existence model. We estimate this new model and compare the result with the best models obtained from Section 5. Section 9 discusses and concludes this study.

2. Logistic Models Review

2.1. Verhulst Model

The Verhulst model is given by
d y d t = r y 1 y K ,
where r is the growth rate parameter, and K is the carrying capacity of the environment.
The right-hand of (1) can be written as
r y r K y 2 = ( r 1 r 2 ) y r 3 y 2 .
In the study of the population of organisms, r 1 means the birth rate, r 2 means the death rate, and r 3 means the resultant between competition and cooperation rate among them [34].
By separating variables, the differential Equation (1) has solution
y ( t ) = K 1 + K y ( 0 ) y ( 0 ) exp ( r t ) .
The value of y that causes the right side of (1) to become maximum is called the inflection point, and the time when that happens is called inflection time. In the study of an epidemic, the inflection time can be viewed as the date when the daily cases reach maximum numbers. The inflection point of the logistic model can be found by solving the following equation for y,
d 2 y d t 2 = 0 .
Let y = y inf be the solution of (3), i.e., the inflection point. Then, by solving (2) for t so that
y ( t ) = y inf ,
we will have the inflection time. Let us denote the inflection time with t inf .
The Verhulst model has inflection point y inf = K 2 and inflection time t inf = 1 r ln K y ( 0 ) y ( 0 ) .

2.2. Pearl and Reed Generalization Model

By rearranging (1) into
K y ( K y ) d y d t = r ,
the left-hand side of (5) varies in time due to the changing of y. Assume that parameter K is constant (for discussion K is not conctant, K = K ( t ) , see [34,35]). Hence, parameter r must vary in time. This leads Pearl and Reed [2] generalizing (1) to be
d y d t = r ( t ) y 1 y K .
Integrating (5) gives
y ( t ) = K 1 + C exp ( r ( t ) d t ) ,
where C = K y ( 0 ) y ( 0 ) exp ( R ( 0 ) ) , with R ( t ) = r ( t ) d t .
For Pearl and Reed’s generalization model, we need to find t inf first by solving
0 = d 2 y d t 2 = r ( t ) y ( t ) 1 y ( t ) K + r ( t ) 1 2 K y ( t ) y ( t ) = r ( t ) y ( t ) 1 y ( t ) K r ( t ) 2 y ( t ) 1 y ( t ) K 1 2 K y ( t ) ,
or
0 = r ( t ) + r ( t ) 2 1 2 K y ( t ) .
Then, we calculate y inf = r ( t inf ) r ( t inf ) 2 + 1 K 2 . When r ( t ) is constant, then we obtain y inf = 0 r 2 + 1 K 2 = K 2 same as from the Verhulst model.
In their paper, Pearl and Reed take r ( t ) as a polynomial, r ( t ) = n = 1 N n a n t n 1 . Then, (7) becomes
y ( t ) = K 1 + K y ( 0 ) y ( 0 ) exp ( n = 1 N a n t n ) .
In the numerical works of this paper, we use r ( t ) = a 1 + a 2 t + a 3 t 2 . It is the same r ( t ) that is used in [2,8].

2.3. Von Bertalanffy Model

Ludwig von Bertalanffy derived his logistic model based on physiological reasons for modeling guppy fish growth and modified the Verhulst model so that it can accommodate the crude metabolic types of the fish [14,19]. The paper [5] uses the von Bertalanffy model to determine the length of Pacific bonito fish based on age and vice versa. The model is given below
d y d t = r y 2 3 1 y K 1 3 .
The number 2 3 in d y / d t = r y 2 3 ( r K 1 3 ) y expresses the surface rule for a certain organism, i.e., the rate of the entire animal’s metabolism is proportional to the 2 3 power of its body weight [15].
The solution of (9) is
y ( t ) = K 1 3 K 1 3 y ( 0 ) 1 3 exp 1 3 r K 1 3 t 3 ,
with inflection point y inf = 8 27 K and inflection time t inf = 3 K 1 / 3 r ln 3 [ K 1 / 3 y ( 0 ) 1 / 3 ] K 1 / 3 .
Comparing the von Bertalanffy model with the Verhulst model, for assumption y ( t ) > 1 for all t, yields
r y ( t ) 2 3 1 y ( t ) K 1 3 < r y ( t ) 1 y ( t ) K for all t .
So, if we set the same parameters value r and K for both models, the von Bertalanffy model needs more time to reach its carrying capacity. Therefore, if we want to make the von Bertalanffy model close to the Verhulst model, we need to set the parameter r of the von Bertalanffy model bigger than the parameter r of the Verhulst model.

2.4. Richards Model

Inspired by the von Bertalanffy model, Richards modified the Verhulst model to be more flexible for the empirical use of fitting plant data [16]. The model is written below
d y d t = r α y 1 y K α ,
where α > 0 is called the shape parameter. The Richards model is sometimes called the generalized logistic equation following Nelder in [36].
The solution of (11) is
y ( t ) = K 1 + 1 + K y ( 0 ) α exp ( r t ) 1 / α ,
with inflection point y inf = K ( α + 1 ) 1 / α and inflection time t inf = 1 r ln [ K / y ( 0 ) ] α 1 α .

2.5. Gompertz Model

In 1825, Benjamin Gompertz sent a letter to Francis Baily about the nature of a designed function to describe the law of human mortality [20]. Later, the function was called the Gompertz function.
The following differential equation
d y d t = r y ln K y ,
is referred to as the Gompertz model. The model can be viewed as a derivation of Richards differential Equation (11), in which α tends to zero.
The solution of (13) is
y ( t ) = K y ( 0 ) K exp ( r t ) ,
and it is called the Gompertz function. The model has inflection point y inf = K exp ( 1 ) and inflection time t inf = 1 r ln ln K y ( 0 ) .

2.6. Hyper-Gompertz Model

Turner et al. [18] studied a model which they called the hyper-Gompertz model, by putting γ as the power of ln ( K / y ) in (13), where γ > 0 and γ 1 . The hyper-Gompertz model is given by
d y d t = r y ln K y γ .
By manipulating (15) in the following way,
d d t ln y K = 1 y d y d t = r ln K y γ = ( 1 ) γ r ln y K γ ,
the solution of (15) is
y ( t ) = K exp ( 1 ) γ ( γ + 1 ) r t + ln ( y ( 0 ) K ) γ + 1 1 γ + 1 .
It has the inflection point y inf = K exp ( γ ) and inflection time t inf = ( γ ) γ + 1 [ ln ( y ( 0 ) / K ) ] γ + 1 ( 1 ) γ ( γ + 1 ) r .

2.7. Blumberg Model

Another modification of the logistic model is proposed by Blumberg [17], written below
d y d t = r y β 1 y K γ .
Because of the difficulties of solving (17) analytically, the differential Equation (17) will be solved numerically using the Runge–Kutta method.
The inflection point of the Blumberg model is y inf = β K β + γ . Meanwhile, the inflection point t inf is taken numerically by solving
min i = 0 , , T | y ( t i ) y inf | ,
with y ( t i ) is the Runge–Kutta approximation, t i = i Δ t , Δ t > 0 .

2.8. Turner et al. Model

In a more general way than the Blumberg model, Turner et al. offered this differential equation
d y d t = r y 1 + α ( γ + 1 ) 1 y K α γ ,
which they called a generic growth model [18]. The parameters α and γ are positive and yield 1 + γ < 1 / α . γ 1 . Unlike (17), the model (18) has an analytical solution.
By rewriting (18) as follows
d y d t = r K α γ y α + 1 ( K α y α 1 ) γ ,
and using an integration substitution method for K α y α 1 , we obtain
y ( t ) = K / 1 + ( γ 1 ) α K α ( γ + 1 ) r t + K y ( 0 ) α 1 γ + 1 1 / ( γ + 1 ) 1 / α .
The Turner et al. model has an inflection point y inf = 1 + α ( γ + 1 ) 1 + α 1 / α K and inflection time
t inf = K y ( 0 ) α 1 γ + 1 α γ 1 + α ( γ + 1 ) γ + 1 r α ( γ + 1 ) K α ( γ + 1 )

2.9. Tsoularis Model

Completing the work of Turnet et al., Tsoularis in [19] generalized the generic growth model to be like this
d y d t = r y β 1 y K α γ .
Note that this model is the generalization of all logistic models that have been mentioned before, of course, except the Pearl and Reed generalization. Like the Blumberg model, the Tsoularis model also can not be solved analytically, hence the model will be solved numerically using the Runge–Kutta method.
The inflection point of the Tsoularis model is y inf = β β + α γ 1 / α K , where the inflection time will be solved as in the Blumberg model case.

3. Particle Swarm Optimization

As a part of the swarm intelligence family, particle swarm optimization (PSO) is a metaheuristic algorithm inspired by the way bird or fish schools find foods [37]. PSO was first introduced by Kennedy and Eberhart in 1995 [30]. The algorithm portrays the motions of a group of particles with some velocities and the best-remembered position for finding the best position of the group in a closed search space. The best-remembered position acts as the local optimum, and the best position of the group acts as the global optimum. Shi and Eberhart [31] acquainted an inertia weight parameter in the velocity calculation to obtain more stability between the seeking of local optimum and global optimum. Many papers have utilized PSO, its variants, or its hybrid with other algorithms for advanced optimization problems; for examples, see [38,39,40,41,42,43,44,45,46,47].
The PSO algorithm for a minimization problem min x R n f ( x ) is written in Algorithm 1.
Algorithm 1 PSO Algorithm
1:
procedure
2:
    Initialization:  I R n is the search space; m is the number of particles; x i ( 0 ) I is the initial position of particle i, i = 1 , 2 , , m ; v i ( 0 ) R n is the initial velocity of particle i, i = 1 , 2 , , m ; c 1 and c 2 are the weighted coefficients; w is the inertia weight parameter.
3:
    Set x i best ( 0 ) = x i ( 0 ) as the initial best position of particle i.
4:
    Set x gbest ( 0 ) = x g , where f ( x g ) = min i f ( x i ( 0 ) ) , as the initial best position of the group.
5:
     k = 0 .
6:
    if the stopping criteria is not reached then
7:
        for  i { 1 , 2 , , m }  do
8:
           Update the particle velocity:
v i ( k + 1 ) = w × v i ( k ) + ( c 1 × random ( 0 , 1 ) × ( x i best ( k ) x i ( k ) ) ) + ( c 2 × random ( 0 , 1 ) × ( x gbest ( k ) x i ( k ) ) ) .
9:
           Update the particle position: x i new = x i ( k ) + v i ( k + 1 )
10:
          Check whether the updated position is still in the search space or not by the following condition:
11:
           if  x i new I  then
12:
               Set x i ( k + 1 ) = x i new
13:
           else
14:
               Set x i ( k + 1 ) = x i ( k )
15:
           Update the best position of each particle and the best position of the group:
16:
           if  f ( x i ( k + 1 ) ) f ( x i best ( k ) )  then
17:
                x i best ( k + 1 ) = x i ( k + 1 ) .
18:
               if  f ( x i ( k + 1 ) ) f ( x gbest ( k ) )  then
19:
                    x gbest ( k + 1 ) = x i ( k + 1 ) .
20:
               else
21:
                    x gbest ( k + 1 ) = x gbest ( k ) .
22:
           else
23:
                x i best ( k + 1 ) = x i best ( k ) .
24:
                x gbest ( k + 1 ) = x gbest ( k ) .
25:
         k = k + 1 .
26:
         w = ρ × w , where ρ is the decreasing parameter of w, 0 < ρ < 1 .
     return  x gbest as the minimum point of f ( x ) .
It is common to set the following PSO parameters: c 1 = 2 , c 2 = 2 , w = 1 , and ρ as a number which is very close to 1; for example, ρ = 0.99 .
PSO is designed to make the global minimum of the objective function in the current iteration less than or equal to the global minimum of the objective function in previous iterations, that is f ( x gbest ( k ) ) f ( x gbest ( j ) ) , for all j k . In the optimization for data fitting, the objective function is usually the error between the data and the model. Therefore, the objective function has values greater or equal to zero, which is bounded below. The number zero is one of the lower bounds. Now, suppose that f 0 . Thus, the sequence u k = f ( x gbest ( k ) ) is a decreasing sequence and bounded below. By the Monotone Convergence Theorem, u k is convergent. And by the Cauchy convergence criterion, a sequence of real numbers is convergent if and only if it is a Cauchy sequence. The Cauchy sequence is defined as follows: a sequence u k of real numbers is said to be a Cauchy sequence if for every ϵ > 0 there exists a natural number H ( ϵ ) such that for all natural numbers k , j H ( ϵ ) , the terms x k , x j satisfy | x k x j | < ϵ [48].
We adopt the Cauchy convergence criterion as one of the stopping criteria of the PSO. In this paper, we use two stopping criteria: the maximum iteration number ( k max ) and the Cauchy stopping criterion. We will stop the iteration if k = k max or the Cauchy stopping criterion is reached. The Cauchy stopping criterion is explained as follows: set a natural number N, if | f ( x gbest ( k ) ) f ( x gbest ( k j ) ) | < ϵ for some j 1 and ϵ > 0 , and for all k where j k j + N , then the current iteration must be stopped. So, if the iteration of the Cauchy stopping criterion is reached, then we must stop there and do not need to continue until maximum iteration. If this happens, much time can be saved. And if the Cauchy criterion is too difficult to make happen, although we have reached the maximum iteration, we will stop the iteration there rather than waiting too long for the sake of the Cauchy criterion being reached.

4. Implementation

The test sample (banks) consists of Indonesian commercial and rural banks. The number of commercial and rural banks in Indonesia has decreased over the years (see Figure 2, the data are taken from the Indonesia Central Bureau of Statistics’s website https://www.bps.go.id (accessed on 23 October 2024)) due to various factors like mergers, consolidations, and regulatory changes. This decrease is largely due to government efforts to stabilize the banking sector and encourage mergers among smaller banks to create stronger institutions. Despite that, the total assets seem to increase each year; see Figure 1a,b. The data are monthly total assets in the period January 2007–January 2020 in terms of a billion rupiah (Rp) taken from Indonesia Financial Service Authority’s website (https://www.ojk.go.id accessed on 1 March 2020), as shown in Figure 1. Let y d ( t i ) be the data of banking assets at time t i , where t i = i Δ t , i = 0 , 1 , , 156 . Δ t = 1 / 12 is the time increment, t 0 is January 2007, and t 156 is January 2020. We use the data from January 2007 until December 2018 as the training data, that is the data that are implemented to the logistic models for gaining the parameter value of the models. The data from January 2019 until January 2020 are used as the validation data of the models’ prediction in the future assets value.
Parameters of logistic models can be divided into two categories. One consists of a growth rate parameter and shape parameters which can be estimated in a short interval of search space; for example, [0, 1], [0, 5], etc. The other one is a carrying capacity that may require a very long interval of search space; for example, [ 0 , 10 3 ] , [ 10 4 , 10 8 ] , etc. Instead of picking an arbitrary interval for estimating the carrying capacity, we can pick an interval based on a rough estimated value of the carrying capacity.
Pearl and Reed [1] give a formula to determine the rough estimation of the carrying capacity of the Verhulst logistic function in (2). They use three data points that have the same distance range h > 0 . Those points are named ( s 1 , x 1 ) , ( s 2 , x 2 ) , and ( s 3 , x 3 ) , where s 2 s 1 = s 3 s 2 = h , and x 1 = y d ( s 1 ) , x 2 = y d ( s 2 ) , x 3 = y d ( s 3 ) . By substituting those points into (2) and doing some eliminations, we obtain
K = 2 x 1 x 2 x 3 ( x 1 + x 3 ) x 2 2 x 1 x 3 x 2 2 .
We choose s 2 as the time around the mid-time of banking assets data, s 2 = 71 12 , 72 12 and some h = 71 12 , 69 12 , 67 12 . From those s 2 and h, we calculate s 1 = s 2 h and s 3 = s 2 + h . Thus, we obtain s 1 = 0 , 2 12 , 4 12 and s 2 = 142 12 , 140 12 , 138 12 for the case s 2 = 71 12 , and s 1 = 1 12 , 3 12 , 5 12 and s 2 = 143 12 , 141 12 , 139 12 for the case s 2 = 72 12 . Having those s j and the associated x j = y d ( s j ) , j = 1 , 2 , 3 , from (21), we obtain rough values for the carrying capacities of Indonesian commercial and rural banking assets that are presented in Table 1. From Table 1, we can clearly see why the Pearl and Reed formula is called a rough calculation of the carrying capacity of the logistic model, since different s 1 , s 2 , and s 3 will produce different carrying capacity values.
Perhaps the best-estimated value (using an optimization method) of the carrying capacities of the logistic models is smaller or greater than the rough values. Experience shows that their value is not very much different [8,10]. In this paper, for all logistics models, the carrying capacity will be estimated using PSO at an interval, say [ a , b ] . In the case of commercial banks, a = 8,068,346 (the last data of the training data of commercial banks) and b = 142,549,510 (the maximum rough carrying capacity value of commercial banks from Table 1 times 10). And for the case of rural banks, a = 135,693 (the last data of the training data of rural banks) and b = 2,157,160 (the maximum rough carrying capacity value of rural banks from Table 1 times 10). Meanwhile, to estimate the parameters of logistic models in Section 2 such as a 1 , a 2 , a 3 , r , α , β , γ , we use the intervals presented in Table 2. The parameter r of the von Bertalanffy model is estimated at interval [ 0 , 50 ] , because the parameter r requires a larger value to match the behavior of the Verhulst model.
We have set the search space for the parameter estimation. Now, we set some parameters in PSO algorithm: m = 1000 , c 1 = 2 , c 2 = 2 , w = 1 , ρ = 0.99 . Let x ( k ) be the vector of the logistic model’s parameters at k-th iteration. The objective function of the parameter estimation being used here is the Mean Absolute Percentage Error (MAPE), which is calculated as follows
f ( x ( k ) ) = 100 % 144 i = 0 143 | y ( t i , x ( k ) ) y d ( t i ) y d ( t i ) | ,
where y d ( t i ) is the training data of banking assets at time t i = i / 12 and y ( t i , x ( k ) ) is the value of assets based on the logistic model’s solution, i = 0 , 1 , , 143 .
We set the stopping criteria for the algorithm, required the iteration passes the 20-th iteration, as follows
k = k max or | f ( x ( k ) ) f ( x ( k 20 ) ) | < ϵ ,
where k max = 150 and ϵ = 0.001 % .
We run the PSO twenty times, and choose the obtained parameters that have the minimum MAPE. The obtained model is used to validate the validation data by calculating
MAPE validation = 100 % 13 i = 144 156 | y ( t i , x gbest ) y d ( t i ) y d ( t i ) | .
Apart from MAPE, as an additional consideration to find out how close the logistic model is to the data, we also calculate the Root Mean Square Error (RMSE) for the training data and the validation data below
RMSE training = i = 0 143 ( y ( t i , x gbest ) y d ( t i ) ) 2 144 , RMSE validation = i = 144 156 ( y ( t i , x gbest ) y d ( t i ) ) 2 13 .

5. Numerical Results

The results of the parameter estimation are presented in Table 3 for commercial banks and in Table 4 for rural banks. The letters P-R, V, vB, R, G, hG, B, Tu, Ts refer to the Pearl and Reed generalization model (8), Verhulst model (2), von Bertalanffy model (10), Richards model (12), Gompertz model (14), hyper-Gompertz model (16), Blumberg model (17), Turner et al. model (19), and Tsoularis model (20), respectively.
In general, for the selection of the best model, the first thing to review is the smallest error between the data and the model. Usually, the model with the smallest error will be chosen, and the model with the biggest error is not selected. To provide a better visualization of the errors in Table 3 and Table 4, we present the chart of MAPE and RMSE in Figure 3. First, we analyze the MAPE of the training data, because it is used as the objective function of the estimation parameters. From the figure, the Pearl–Reed generalization model has the smallest MAPE, and it is followed by the Richards model. Meanwhile, the von Bertalanffy model has the biggest MAPE, followed by the Gompertz model and the hyper-Gompertz model. Based on the information on the MAPE values of the training and validation data, the first models to be out from consideration are the von Bertalanffy model, the Gompertz model, and the hyper-Gompertz model.
From the perspective of the MAPE of the validation data, for the commercial banking case, the Pearl–Reed generalization model has the biggest MAPE followed by the Gompertz model, the Richards model, and the hyper-Gompertz model. For the rural banking case, the Gompertz model has the biggest validation MAPE, followed by the hyper-Gompertz model. The Pearl–Reed generalization model and the Richards model have small MAPE of the training data but their MAPE of the validation data is big. Let us look at their plots versus the data in Figure 4. From the figure, those models are very good at approaching the training data, but they fail to predict the validation data. The prediction strays too far from the data; see the parts marked by a red circle. Also, as we can see from the figure, the prediction failure is caused by the values of their carrying capacity being less than the highest of the validation data ( y d ( t 155 ) = 8,562,974) for the commercial banking case, and are just a little bit higher than the highest of the validation data ( y d ( t 156 ) = 149,872) for the rural banking case.
The failure of the Pearl–Reed generalization model and the Richard model in producing an estimated carrying capacity which is far enough above the last validation data gives us insight into the carrying capacity value of the other models. Figure 5 presents the chart of the carrying capacity values of all models. From the figure, in addition to the two models mentioned, Turner et al. also produce the carrying capacity value which is close to the highest of the validation data. For the reasons of the digression of the models from the data and the closeness between the carrying capacity values with the highest validation data, we take out the Pearl and Reed model, the Richards model, and the Turner et al. model from the consideration as the best model.
Now, there are three models that need to be discussed: the Verhulst logistic model, the Blumberg model, and the Tsoularis model. From Figure 1, for the commercial banking case, the Tsoularis model has the smallest MAPE and RMSE of the training and validation data than the other two models. Therefore, we conclude that the Tsoularis model is the best logistic model to fit the Indonesia commercial banking data. Meanwhile, for the rural banking case, despite having the smallest MAPE and RMSE for the training data, the Tsoularis model strays far from the validation data as shown by the biggest value of MAPE and RMSE of the validation data. Now, for the rural banking case, we compare the Verhulst model and the Blumberg model. In Table 4, the Verhulst model has a smaller MAPE of the training data and also a smaller RMSE of the training and validation data than the Blumberg model, although the Blumberg model has a smaller MAPE of the training data. So, in the case of fitting the Indonesia rural banking data, we conclude that the Verhulst model is the best model.

6. Benchmarking with Spiral Optimization Algorithm

In this section, we compare the PSO performance with another metaheuristic algorithm as a benchmark. In this case, we employ the spiral optimization (SpO) which is a metaheuristic algorithm first introduced in [24,25]. It is inspired by the spiral phenomenon in nature. SPO describes a set of points that rotate around the global optimal point as the direction of rotation. The SpO has recently been used in many applications, such as [49,50,51,52]. The SpO algorithm has an updating scheme as follows:
x i ( k + 1 ) = S n ( δ , θ ) x i ( k ) ( S n ( δ , θ ) I n ) x gbest ( k ) ,
where S n ( δ , θ ) = δ Π i = 1 n 1 Π j = 1 i R n i , n + 1 j ( n ) ( θ ) , and R i , j ( n ) ( θ ) is n × n identity matrix with the i i and j j entries are cos θ , the j i entry is sin θ , and the i j entry is sin θ .
The parameters of the method, θ and δ , represent the rotation angle, where 0 < θ π , and the scaling radius of rotation, where 0 < δ < 1 , respectively. In the majority of the literature, the ranges π / 4 θ π / 2 and 0.9 δ 0.99 are employed.
We run the SpO algorithm to estimate the parameters of the Tsoularis model for the commercial bank case and the Verhulst model for the rural bank case. The comparison with the PSO’s result is presented in Table 5. In both cases, the PSO result is superior because of the smaller MAPE training and validation compared to the SpO result.

7. Tuning PSO Parameters

A critical aspect of employing an algorithm for optimization problems is its robustness, typically described as the algorithm’s capacity to function well amidst variations in its parameters. One approach to address the robustness issue is the Taguchi method [32,33]. It is a signal-to-noise (SN) ratio which can be defined as follows [53]:
S N = 10 log 10 ( MAPE ) 2 .
A higher value of the SN ratio means the parameter settings of the algorithm are more robust. Several studies have employed the Taguchi method in their optimization problems, especially when using PSO [26,27,28,53,54].
In this section, we apply a robustness check of the PSO’s parameter settings using the Taguchi method. To this end, we consider five levels of robustness check for setting the parameters listed in Table 6. We execute the PSO algorithm with all parameter settings in the table to estimate the Tsoularis model’s parameters for the commercial bank case and the Verhulst model’s parameters for the rural bank case. At the end, we calculate each SN ratio based on the MAPE obtained from the parameter estimation. The result is illustrated in Figure 6. We must observe which parameter’s value gives the highest SN ratio. It is found that the optimal setting of the PSO’s parameters is identified as m = 50 , c 1 = 0.5 , c 2 = 1.5 , w = 3 , and k m a x = 50 .

8. New Logistic Model

In the section on logistic model reviews (Section 2), it is known what all logistic models have in common, e.g., that the growth rate r is a constant, except that only the Pearl and Reed generalization model has a time-varying-growth rate as r ( t ) = a 1 + a 2 t + a 3 t 2 . Now, we propose a new logistic model by generalizing the Tsoularis model with time-varying-growth rate r ( t ) = a 1 + a 2 t + a 3 t 2 as follows:
d y d t = ( a 1 + a 2 t + a 3 t 2 ) y β 1 y K α γ .
This model cannot be solved analytically. Consequently, numerical methods are required to estimate the parameters of the model. In this instance, we employ the Runge–Kutta method. We compare it with the outcomes from the Tsoularis model for commercial banks’ data and the Verhulst model for rural banks’ data. We have estimated all seven parameters of the new model (23), but we have that the result is superior compared to the benchmark models. The problem may arise from the new model having an increased number of parameters, and the nonautonomous nonlinear differential equation complicates precise numerical solutions. Therefore, we made a strategy, as follows. We use the obtained value of the Tsoularis model’s parameters α , β , γ , and K from Table 3 and Table 4, and we only estimate the parameters a 1 , a 2 and a 3 . The parameter estimations utilize the optimal PSO parameters derived from the Taguchi method in the preceding section. The outcome is displayed in Table 7. When compared to the results of the Tsoularis and Verhulst models, the newly proposed logistic model produces less MAPE training but higher MAPE validation. The new model demonstrates improved accuracy in capturing model fitting; however, it is unable to predict subsequent data for validation purposes.

9. Discussion and Conclusions

The use of various logistic growth models to estimate the assets of commercial and rural banks in Indonesia provides important insights into the dynamics of banking growth. Each model brings its own assumptions about growth rates, carrying capacities, and the non-linear behavior of financial assets over time. In this study, nine logistic models, including the Verhulst, Gompertz, and Tsoularis models, were applied to model the asset data of commercial and rural banks. The findings revealed that the Tsoularis model, which is known for capturing complex growth dynamics, provided the best fit for commercial banks, whereas the Verhulst model was more appropriate for rural banks. The model fitting is illustrated in Figure 7. This variation underscores the need to tailor growth models to specific segments within the banking industry, reflecting their unique growth patterns and constraints.
The results suggest that commercial banks, with larger asset bases and broader market exposure, experience growth that is more influenced by intricate factors, as captured by the Tsoularis model. This model’s ability to account for variations in growth rates and environmental limits might explain its superior fit. Conversely, the Verhulst model, which assumes a simpler logistic growth dynamic, proved effective for rural banks, where growth might be more linear and constrained by local economic conditions. These outcomes indicate that asset growth in rural banks is less volatile and tends to stabilize at lower carrying capacities compared to commercial banks, which experience more complex and potentially exponential growth before stabilizing.
The PSO demonstrated higher performance with lower MAPE in both training and validation compared to the SpO algorithm used as a benchmark. The robustness of the PSO algorithm was verified in this study through parameter tuning using the Taguchi method. This study also attempted to introduce a new logistic model that incorporated a more complex structure with an increased number of parameters. This new model was found to be superior (for data fitting) but inferior (for data prediction) to the established Tsoularis and Verhulst models. The complexity introduced by the nonautonomous nonlinear differential equations in the new model posed significant challenges for numerical precision when all the parameters are estimated simultaneously. This underscores the potential trade-off between model complexity and practical applicability, suggesting that simpler models may sometimes yield more reliable outcomes in real-world scenarios where numerical accuracy and convergence are critical.
Despite these findings, several research gaps remain. Notably, while this study focused on modeling growth dynamics using traditional logistic models, future work could incorporate external macroeconomic factors such as inflation rates, policy shifts, and technological advancements that influence banking growth. Additionally, testing alternative optimization techniques beyond particle swarm optimization could reveal different insights into model performance. Lastly, exploring how these models perform in periods of economic downturn or rapid expansion would offer a more comprehensive understanding of their robustness and applicability across varying economic conditions.

Author Contributions

Conceptualization, M.F.A.; methodology, M.F.A. and K.A.S.; software, M.F.A.; validation, M.F.A.; formal analysis, M.F.A.; investigation, M.F.A.; resources, M.F.A.; data curation, M.F.A.; writing—original draft preparation, M.F.A.; writing—review and editing, M.F.A., K.A.S., N.S. and I.G.; visualization, M.F.A.; supervision, K.A.S., N.S. and I.G.; project administration, M.F.A.; funding acquisition, M.F.A. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by Selain APBN Universitas Diponegoro via Riset Publikasi Internasional (RPI) scheme with grant number 973-30/UN7.D2/PP/IX/2024.

Data Availability Statement

The original data presented in the study are openly available in https://ojk.go.id and https://bps.go.id (accessed on 3 November 2024).

Conflicts of Interest

The authors declare no conflicts of interest. The funders had no role in the design of this study; in the collection, analyses, or interpretation of data; in the writing of the manuscript; or in the decision to publish the results.

Abbreviations

The following abbreviations are used in this manuscript:
PSOParticle Swarm Optimization
MAPEMean Absolute Percentage Error
RMSERoot Mean Square Error

References

  1. Pearl, R.; Reed, L.J. On the rate of growth of the population of the United States since 1790 and its mathematical representation. Proc. Nat. Acad. Sci. USA 1920, 6, 275–288. [Google Scholar] [CrossRef] [PubMed]
  2. Pearl, R.; Reed, L.J. A further note on the mathematical theory of population growth. Proc. Nat. Acad. Sci. USA 1922, 8, 365–368. [Google Scholar] [CrossRef]
  3. Fekedulegn, D.; Siurtain, M.P.M.; Colbert, J.J. Parameter Estimation of Nonlinear Growth Models in Forestry. Silva Fenn. 1999, 33, 327–336. [Google Scholar] [CrossRef]
  4. McKendrick, A.G.; Pai, M.K. The Rate of Multiplication of Micro-organisms: A Mathematical study. Proc. R. Soc. Edinb. 1911, 31, 649–655. [Google Scholar] [CrossRef]
  5. Sanders, M.J. A Simple Method for Estimating the von Bertalanffy Growth Constants for Determining Length from Age and Age from Length. In Length-Based Methods in Fisheries Research; Pauly, D., Morgan, G.R., Eds.; International Center for Living Aquatic Resources Management Kuwait Institut for Scientific Research: Manila, Philippines, 1987. [Google Scholar]
  6. Windarto, W.; Eridani, E.; Purwati, U.D. A new modified logistic growth model for empirical use. Commun. Biomath. Sci. 2018, 1, 122–131. [Google Scholar] [CrossRef]
  7. Nuraini, N.; Khairudin, K.; Apri, M. Modeling Simulation of COVID-19 in Indonesia Based on Early Endemic Data. Commun. Biomath. Sci. 2020, 3, 1–8. [Google Scholar] [CrossRef]
  8. Rozema, E. Epidemic models for SARS and measles. Coll. Math. J. 2007, 38, 246–259. [Google Scholar] [CrossRef]
  9. Sumarti, N.; Fadhlurrahman, A.; Widyani, H.R.; Gunadi, I. The Dynamical System of the Deposit and Loan Volumes of a Commercial Bank Containing Interbank Lending and Saving Factors. Southeast Asian Bull. Math. 2018, 42, 757–772. [Google Scholar]
  10. Ansori, M.F.; Sidarto, K.A.; Sumarti, N. Model of deposit and loan of a bank using spiral optimization algorithm. J. Indones. Math. Soc. 2019, 25, 292–301. [Google Scholar] [CrossRef]
  11. Ansori, M.F.; Sidarto, K.A.; Sumarti, N. Logistic models of deposit and loan between two banks with saving and debt transfer factors. In Proceedings of the 8th SEAMS-UGM International Conference on Mathematics and Its Applications 2019, Yogyakarta, Indonesia, 29 July–1 August 2019; Utami, H., Kusumo, F.A., Susyanto, N., Susanti, Y., Eds.; AIP Publishing: Melville, NY, USA, 2019; Volume 2192, p. 060002. [Google Scholar] [CrossRef]
  12. Ansori, M.F.; Sidarto, K.A.; Sumarti, N.; Gunadi, I. Dynamics of Bank’s Balance Sheet: A System of Deterministic and Stochastic Differential Equations Approach. Int. J. Math. Comput. Sci. 2021, 16, 871–884. [Google Scholar]
  13. Pastijn, H. Chaotic Growth with the Logistic Model of P.-F. Verhulst. In The Logistic Map and the Route to Chaos: From The Beginnings to Modern Applications; Ausloos, M., Dirickx, M., Eds.; Springer: Berlin/Heidelberg, Germany, 2006; pp. 3–11. [Google Scholar] [CrossRef]
  14. von Bertalanffy, L. A quantitative theory of organic growth (Inquiries on growth laws. II). Hum. Biol. 1938, 10, 181–213. [Google Scholar]
  15. von Bertalanffy, L. Quantitative Laws in Metabolism and Growth. Q. Rev. Biol. 1957, 32, 217–231. [Google Scholar] [CrossRef] [PubMed]
  16. Richards, F.J. A Flexible Growth Function for Empirical Use. J. Exp. Bot. 1959, 10, 290–301. [Google Scholar] [CrossRef]
  17. Blumberg, A.A. Logistic growth rate functions. J. Theor. Biol. 1968, 21, 42–44. [Google Scholar] [CrossRef]
  18. Turner, M.E.; Bradley, E.L.; Kirk, K.A.; Pruitt, K.M. A theory of growth. Math. Biosci. 1976, 29, 367–373. [Google Scholar] [CrossRef]
  19. Tsoularis, A.; Wallace, J. Analysis of Logistic Growth Models. Math. Biosci. 2002, 2, 21–55. [Google Scholar] [CrossRef]
  20. Gompertz, B. On the Nature of the Function Expressive of the Law of Human Mortality, and on a New Mode of Determining the Value of Life Contingencies. Philos. Trans. R. Soc. Lond. 1825, 2, 513–583. [Google Scholar] [CrossRef]
  21. Ma, Y.; Paligorova, T.; Peydro, J.L. Expectations and Bank Lending; Unpublished Working Paper; University of Chicago: Chicago, IL, USA, 2021. [Google Scholar]
  22. Heckmann-Draisbach, L.; Memmel, C. How good are banks’ forecasts? Int. Rev. Financ. Anal. 2024, 95, 103475. [Google Scholar] [CrossRef]
  23. Falato, A.; Xiao, J. Expectations and credit slumps. SSRN 2024, 4650869. [Google Scholar] [CrossRef]
  24. Tamura, K.; Yasuda, K. Primary Study of Spiral Dynamics Inspired Optimization. IEEJ Trans. Electr. Electron. Eng. 2011, 6, 98–100. [Google Scholar] [CrossRef]
  25. Tamura, K.; Yasuda, K. Spiral Dynamics Inspired Optimization. J. Adv. Comput. Intell. Intell. Inform. 2011, 15, 1116–1122. [Google Scholar] [CrossRef]
  26. Wang, Z.; Chen, Y.; Ding, S.; Liang, D.; He, H. A novel particle swarm optimization algorithm with Lévy flight and orthogonal learning. Swarm Evol. Comput. 2022, 75, 101207. [Google Scholar] [CrossRef]
  27. Meng, X.; Li, H. An adaptive co-evolutionary competitive particle swarm optimizer for constrained multi-objective optimization problems. Swarm Evol. Comput. 2024, 91, 101746. [Google Scholar] [CrossRef]
  28. Meng, X.; Li, H. Heterogeneous pbest-guided comprehensive learning particle swarm optimization. Appl. Soft Comput. 2024, 162, 111874. [Google Scholar] [CrossRef]
  29. Hao, H.; Zhu, H. A self-learning particle swarm optimization for bi-level assembly scheduling of material-sensitive orders. Comput. Ind. Eng. 2024, 195, 110427. [Google Scholar] [CrossRef]
  30. Kennedy, J.; Eberhart, R. Particle swarm optimization. In Proceedings of the ICNN’95—International Conference on Neural Networks, Perth, Australia, 27 November–1 December 1995; Volume 4, pp. 1942–1948. [Google Scholar] [CrossRef]
  31. Shi, Y.; Eberhart, R. A modified particle swarm optimizer. In Proceedings of the 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360), Anchorage, AK, USA, 4–9 May 1998; pp. 69–73. [Google Scholar] [CrossRef]
  32. Byrne, D.M. The Taguchi approach to parameter design. ASQ’s Annu. Qual. Congr. Proc. 1986, 40, 168. [Google Scholar]
  33. Freddi, A.; Salmon, M.; Freddi, A.; Salmon, M. Introduction to the Taguchi method. In Design Principles and Methodologies: From Conceptualization to first Prototyping with Examples and Case Studies; Springer: New York, NY, USA, 2019; pp. 159–180. [Google Scholar]
  34. Yukalov, V.I.; Yukalova, E.P.; Sornette, D. Punctuated evolution due to delayed carrying capacity. Phys. D Nonlinear Phenom. 2009, 238, 1752–1767. [Google Scholar] [CrossRef]
  35. Turner, M.E.; Blumenstein, B.A.; Sebaugh, J.L. A Generalization of the Logistic Law of Growth. Biometrics 1969, 25, 577–580. [Google Scholar] [CrossRef]
  36. Nelder, J.A. The Fitting of a Generalization of the Logistic Curve. Biometrics 1961, 17, 89–110. [Google Scholar] [CrossRef]
  37. Brownlee, J. Clever Algorithms: Nature-Inspired Programming Recipes, 1st ed.; Lulu.com: Morrisville, NC, USA, 2011. [Google Scholar]
  38. Bhandari, V.S.; Kulkarni, S.H. Optimization of heat sink for thyristor using particle swarm optimization. Results Eng. 2019, 4, 100034. [Google Scholar] [CrossRef]
  39. Cai, X.; Gao, L.; Li, F. Sequential approximation optimization assisted particle swarm optimization for expensive problems. Appl. Soft Comput. 2019, 83, 105659. [Google Scholar] [CrossRef]
  40. Josaphat, B.P.; Ansori, M.F.; Syuhada, K. On Optimization of Copula-Based Extended Tail Value-at-Risk and Its Application in Energy Risk. IEEE Access 2021, 9, 122474–122485. [Google Scholar] [CrossRef]
  41. Aroniadi, C.; Beligiannis, G.N. Applying Particle Swarm Optimization Variations to Solve the Transportation Problem Effectively. Algorithms 2023, 16, 372. [Google Scholar] [CrossRef]
  42. Shafeek, Y.A.; Ali, H.I. Application of Particle Swarm Optimization to a Hybrid H/Sliding Mode Controller Design for the Triple Inverted Pendulum System. Algorithms 2024, 17, 427. [Google Scholar] [CrossRef]
  43. Azami, P.; Passi, K. Detecting Fake Accounts on Instagram Using Machine Learning and Hybrid Optimization Algorithms. Algorithms 2024, 17, 425. [Google Scholar] [CrossRef]
  44. Panagiotakis, C. Particle Swarm Optimization-Based Unconstrained Polygonal Fitting of 2D Shapes. Algorithms 2024, 17, 25. [Google Scholar] [CrossRef]
  45. Kannan, S.K.; Diwekar, U. An Enhanced Particle Swarm Optimization (PSO) Algorithm Employing Quasi-Random Numbers. Algorithms 2024, 17, 195. [Google Scholar] [CrossRef]
  46. Capel, M.I.; Salguero-Hidalgo, A.; Holgado-Terriza, J.A. Parallel PSO for Efficient Neural Network Training Using GPGPU and Apache Spark in Edge Computing Sets. Algorithms 2024, 17, 378. [Google Scholar] [CrossRef]
  47. Sulaiman, A.T.; Bello-Salau, H.; Onumanyi, A.J.; Mu’azu, M.B.; Adedokun, E.A.; Salawudeen, A.T.; Adekale, A.D. A Particle Swarm and Smell Agent-Based Hybrid Algorithm for Enhanced Optimization. Algorithms 2024, 17, 53. [Google Scholar] [CrossRef]
  48. Bartle, R.G.; Sherbert, D.R. Introduction to Real Analysis, 3rd ed.; John Wiley & Sons, Inc.: Hoboken, NJ, USA, 2000. [Google Scholar]
  49. Wang, W.; Chen, Y.; Yang, C.; Li, Y.; Xu, B.; Xiang, C. An enhanced hypotrochoid spiral optimization algorithm based intertwined optimal sizing and control strategy of a hybrid electric air-ground vehicle. Energy 2022, 257, 124749. [Google Scholar] [CrossRef]
  50. Sumarti, N.; Sidarto, K.A.; Kania, A.; Edriani, T.S.; Aditya, Y. A method for finding numerical solutions to Diophantine equations using Spiral Optimization Algorithm with Clustering (SOAC). Appl. Soft Comput. 2023, 145, 110569. [Google Scholar] [CrossRef]
  51. Fauzi, I.S. Developing Insurance Mathematical Model to Assess Economic Burden of Dengue Outbreaks. J. Nonlinear Model. Anal. 2024, 6, 693. [Google Scholar] [CrossRef]
  52. Fauzi, I.S.; Nuraini, N.; Sari, A.M.; Wardani, I.B.; Taurustiati, D.; Simanullang, P.M.; Lestari, B.W. Assessing the impact of booster vaccination on diphtheria transmission: Mathematical modeling and risk zone mapping. Infect. Dis. Model. 2024, 9, 245–262. [Google Scholar] [CrossRef] [PubMed]
  53. Islam, M.R.; Ali, S.M.; Fathollahi-Fard, A.M.; Kabir, G. A novel particle swarm optimization-based grey model for the prediction of warehouse performance. J. Comput. Des. Eng. 2021, 8, 705–727. [Google Scholar] [CrossRef]
  54. Wang, H.; Geng, Q.; Qiao, Z. Parameter tuning of particle swarm optimization by using Taguchi method and its application to motor design. In Proceedings of the 2014 4th IEEE International Conference on Information Science and Technology, Shenzhen, China, 26–28 April 2014; pp. 722–726. [Google Scholar] [CrossRef]
Figure 1. Total assets of (a) commercial banks and (b) rural banks in Indonesia in the period January 2007−January 2020. The monthly fluctuation of total assets of (c) commercial banks and (d) rural banks.
Figure 1. Total assets of (a) commercial banks and (b) rural banks in Indonesia in the period January 2007−January 2020. The monthly fluctuation of total assets of (c) commercial banks and (d) rural banks.
Algorithms 17 00507 g001
Figure 2. The number of commercial and rural banks in Indonesia over the years.
Figure 2. The number of commercial and rural banks in Indonesia over the years.
Algorithms 17 00507 g002
Figure 3. MAPE and RMSE of the obtained models for (a) commercial banks and (b) rural banks.
Figure 3. MAPE and RMSE of the obtained models for (a) commercial banks and (b) rural banks.
Algorithms 17 00507 g003
Figure 4. Plot of the Pearl–Reed generalization model versus the data of (a) commercial banks and (c) rural banks and the Richards model versus the data of (b) commercial banks and (d) rural banks.
Figure 4. Plot of the Pearl–Reed generalization model versus the data of (a) commercial banks and (c) rural banks and the Richards model versus the data of (b) commercial banks and (d) rural banks.
Algorithms 17 00507 g004
Figure 5. The carrying capacity of the obtained models.
Figure 5. The carrying capacity of the obtained models.
Algorithms 17 00507 g005
Figure 6. The SN ratio for PSO’s parameters.
Figure 6. The SN ratio for PSO’s parameters.
Algorithms 17 00507 g006
Figure 7. The result of data fitting and prediction of Indonesian (a) commercial and (b) rural banking data.
Figure 7. The result of data fitting and prediction of Indonesian (a) commercial and (b) rural banking data.
Algorithms 17 00507 g007
Table 1. Rough values of the carrying capacity (in billion Rp) of commercial and rural banks in Indonesia.
Table 1. Rough values of the carrying capacity (in billion Rp) of commercial and rural banks in Indonesia.
s 1 s 2 s 3 Rough K for Com. BankRough K for Rural Bank
071/12142/1212,431,437206,126
2/1271/12140/1212,022,655199,172
4/1271/12138/1211,342,372200,580
1/1272/12143/1214,254,951215,716
3/1272/12141/1213,313,955204,998
5/1272/12139/1212,619,803204,283
Table 2. Some intervals as the search space for estimating the parameter of logistic models.
Table 2. Some intervals as the search space for estimating the parameter of logistic models.
ParameterThe Search Space
a 1 , a 2 , a 3 for Pearl–Reed generalization model [ 0 , 1 ]
r for Verhulst, Richards, Gompertz, hyper-Gompertz, Blumberg,
Turner et al., and Tsoularis models
[ 0 , 1 ]
r for von Bertalanffy model [ 0 , 50 ]
α for Richards, Turner et al., and Tsoularis models [ 0 , 5 ]
β for Blumberg and Tsoularis models [ 0 , 3 ]
γ for hyper-Gompertz model [ 0.75 , 3 ]
γ for Blumberg, Turner et al., and Tsoularis models [ 1 , 5 ]
Table 3. Result of PSO in estimating parameters of logistic models using commercial banking assets data in Indonesia.
Table 3. Result of PSO in estimating parameters of logistic models using commercial banking assets data in Indonesia.
a 1 a 2 a 3 KStop t inf y inf MAPE t.MAPE v.RMSE t.RMSE v.
P-R0.13750.01564.28 × 10 10 8,228,341627.335,114,2831.68%5.78%101,902489,191
r α β γ
V0.1844 15,071,4742511.227,535,7373.06%2.29%139,536203,508
vB29.3160 142,549,5102544.8942,236,8954.21%1.93%174,153181,636
R0.65574.2911 8,255,810428.165,599,4242.45%4.82%113,273412,614
G0.0431 86,377,0002731.7631,776,3233.50%5.77%163,688491,075
hG0.0432 185,794,13711531.7031,561,8993.11%4.67%160,263402,819
B0.0718 1.06834.734248,868,5886613.178,997,2853.07%3.33%142,053287,811
Tu0.20142.6711 1.0062946,09701508.545,778,0782.62%2.07%118,677182,535
Ts0.54012.99980.91583.081213,585,17615014.086,091,1042.77%0.52%122,98855,416
Table 4. Result of PSO in estimating parameters of logistic models using rural banking assets data in Indonesia.
Table 4. Result of PSO in estimating parameters of logistic models using rural banking assets data in Indonesia.
a 1 a 2 a 3 KStop t inf y inf MAPE t.MAPE v.RMSE t.RMSE v.
P-R0.18380.00804.00 × 10 9 162,036578.4294,4981.34%2.57%9614655
r α β γ
V0.2052 259,8162411.28129,9082.16%2.82%15874180
vB8.3632 2,157,1602638.58612,3884.16%0.72%25971274
R0.52963.0127 153,790748.6396,9681.57%2.97%10865291
G0.0443 1,919,6582433.49706,2032.73%7.20%233910,268
hG0.0447 11,872,93814633.09689,0162.38%6.51%21319299
B0.0878 1.08754.2360712,6156412.33145,5802.12%3.69%16565337
Tu0.21652.4256 1.0072166,6541508.8699,5831.66%1.74%11113475
Ts0.24774.30270.96574.6135195,56215013.7595,8391.58%2.92%11175159
Table 5. Result of SpO compared to PSO.
Table 5. Result of SpO compared to PSO.
AlgorithmTsoularis Model for Commercial Banks DataVerhulst Model for Rural Banks Data
r α β γ K MAPE t.MAPE v. r K MAPE t.MAPE v.
SpO0.80272.18690.88943.422920,757,4613.04%2.98%0.2043264,4992.17%3.24%
PSO0.54012.99980.91583.081213,585,1762.77%0.52%0.2052259,8162.16%2.82%
Table 6. The levels of the PSO’s parameters setting.
Table 6. The levels of the PSO’s parameters setting.
PSO’s ParameterLevel 1Level 2Level 3Level 4Level 5
Number of particles (m)1050100200300
Weighted coefficient ( c 1 )0.511.522.5
Weighted coefficient ( c 2 )0.511.522.5
Inertia weight (w)12345
Maximum iteration ( k m a x )255075100150
Table 7. Result of PSO in estimating parameters of the new proposed logistic model (23).
Table 7. Result of PSO in estimating parameters of the new proposed logistic model (23).
Case DataNew ModelTsoularis ModelVerhulst Model
Commercial banks a 1 = 0.3622
a 2 = 0.0932
a 3 = 0.0084
α = 2.9998
β = 0.9158
γ = 3.0812
K = 13,585,176
MAPE t. = 1.68 %
MAPE v. = 5.29 %
r = 0.5401
α = 2.9998
β = 0.9158
γ = 3.0812
K = 13,585,176
MAPE t. = 2.77 %
MAPE v. = 0.52 %
None
Rural banks a 1 = 0.2114
a 2 = 0.0203
a 3 = 0.0019
α = 4.3027
β = 0.9657
γ = 4.6135
K = 195,562
MAPE t. = 1.58 %
MAPE v. = 6.37 %
None r = 0.2052
K = 259,811
MAPE t. = 2.16 %
MAPE v. = 2.82 %
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Ansori, M.F.; Sidarto, K.A.; Sumarti, N.; Gunadi, I. On the Estimation of Logistic Models with Banking Data Using Particle Swarm Optimization. Algorithms 2024, 17, 507. https://doi.org/10.3390/a17110507

AMA Style

Ansori MF, Sidarto KA, Sumarti N, Gunadi I. On the Estimation of Logistic Models with Banking Data Using Particle Swarm Optimization. Algorithms. 2024; 17(11):507. https://doi.org/10.3390/a17110507

Chicago/Turabian Style

Ansori, Moch. Fandi, Kuntjoro Adji Sidarto, Novriana Sumarti, and Iman Gunadi. 2024. "On the Estimation of Logistic Models with Banking Data Using Particle Swarm Optimization" Algorithms 17, no. 11: 507. https://doi.org/10.3390/a17110507

APA Style

Ansori, M. F., Sidarto, K. A., Sumarti, N., & Gunadi, I. (2024). On the Estimation of Logistic Models with Banking Data Using Particle Swarm Optimization. Algorithms, 17(11), 507. https://doi.org/10.3390/a17110507

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop