
In this paper, a new hybrid meta-heuristic algorithm called CEBWO (cross-entropy method and beluga whale optimization) is presented to solve the mean-CVaR portfolio optimization problem based on jump-diffusion processes. The proposed CEBWO algorithm combines the advantages of the cross-entropy method and beluga whale optimization algorithm with the help of co-evolution technology to enhance the performance of portfolio selection. The method is evaluated on 29 unconstrained benchmark functions from CEC 2017, where its performance is compared against several state-of-the-art algorithms. The results demonstrate the superiority of the hybrid method in terms of solution quality and convergence speed. Finally, Monte Carlo simulation is employed to generate scenario paths based on the jump-diffusion model. Empirical results further confirm the effectiveness of the hybrid meta-heuristic algorithm for mean-CVaR portfolio selection, highlighting its potential for real-world applications.
Citation: Guocheng Li, Pan Zhao, Minghua Shi, Gensheng Li. A hybrid framework for mean-CVaR portfolio selection under jump-diffusion processes: Combining cross-entropy method with beluga whale optimization[J]. AIMS Mathematics, 2024, 9(8): 19911-19942. doi: 10.3934/math.2024972
[1] | Shoude Huang, Xin-Jiang He . An analytical approximation formula for European option prices under a liquidity-adjusted non-affine stochastic volatility model. AIMS Mathematics, 2022, 7(6): 10364-10377. doi: 10.3934/math.2022577 |
[2] | Min-Ku Lee, Jeong-Hoon Kim . Pricing vanilla, barrier, and lookback options under two-scale stochastic volatility driven by two approximate fractional Brownian motions. AIMS Mathematics, 2024, 9(9): 25545-25576. doi: 10.3934/math.20241248 |
[3] | Shoude Huang, Xinjiang He, Shuqu Qian . An analytical approximation of European option prices under a hybrid GARCH-Vasicek model with double exponential jump in the bid-ask price economy. AIMS Mathematics, 2024, 9(5): 11833-11850. doi: 10.3934/math.2024579 |
[4] | Min-Ku Lee, Jeong-Hoon Kim . Closed-form approximate solutions for stop-loss and Russian options with multiscale stochastic volatility. AIMS Mathematics, 2023, 8(10): 25164-25194. doi: 10.3934/math.20231284 |
[5] | Weiwei Shen, Yan Zhang . Strong convergence of the Euler-Maruyama method for the stochastic volatility jump-diffusion model and financial applications. AIMS Mathematics, 2025, 10(5): 12032-12054. doi: 10.3934/math.2025545 |
[6] | Hijaz Ahmad, Muhammad Nawaz Khan, Imtiaz Ahmad, Mohamed Omri, Maged F. Alotaibi . A meshless method for numerical solutions of linear and nonlinear time-fractional Black-Scholes models. AIMS Mathematics, 2023, 8(8): 19677-19698. doi: 10.3934/math.20231003 |
[7] | Jiajia Zhao, Zuoliang Xu . Calibration of time-dependent volatility for European options under the fractional Vasicek model. AIMS Mathematics, 2022, 7(6): 11053-11069. doi: 10.3934/math.2022617 |
[8] | Yao Fu, Sisi Zhou, Xin Li, Feng Rao . Multi-assets Asian rainbow options pricing with stochastic interest rates obeying the Vasicek model. AIMS Mathematics, 2023, 8(5): 10685-10710. doi: 10.3934/math.2023542 |
[9] | Guiwen Lv, Ping Xu, Yanxue Zhang . Pricing of vulnerable options based on an uncertain CIR interest rate model. AIMS Mathematics, 2023, 8(5): 11113-11130. doi: 10.3934/math.2023563 |
[10] | Wuyuan Jiang, Zechao Miao, Jun Liu . Optimal investment and reinsurance for the insurer and reinsurer with the joint exponential utility. AIMS Mathematics, 2024, 9(12): 35181-35217. doi: 10.3934/math.20241672 |
In this paper, a new hybrid meta-heuristic algorithm called CEBWO (cross-entropy method and beluga whale optimization) is presented to solve the mean-CVaR portfolio optimization problem based on jump-diffusion processes. The proposed CEBWO algorithm combines the advantages of the cross-entropy method and beluga whale optimization algorithm with the help of co-evolution technology to enhance the performance of portfolio selection. The method is evaluated on 29 unconstrained benchmark functions from CEC 2017, where its performance is compared against several state-of-the-art algorithms. The results demonstrate the superiority of the hybrid method in terms of solution quality and convergence speed. Finally, Monte Carlo simulation is employed to generate scenario paths based on the jump-diffusion model. Empirical results further confirm the effectiveness of the hybrid meta-heuristic algorithm for mean-CVaR portfolio selection, highlighting its potential for real-world applications.
A great deal of attention has been paid to the use of mathematical tools in recent years to better describe phenomena in the world, such as nonlinear optics [1], network analysis [2], biomedical signal processing [3], mathematical modelling of human liver [4], medical imaging [5,6], neural networks [7], optimal control [8], a diffusive epidemic model [9], chemical signal concentration [10], attraction-repulsion [11], control theory [12], signal advancement [13], computational approaches in medicine [14], nanoscience [15], artificial intelligence [16], fractional mathematical model [17], wave propagation [18], and applied mathematical analysis [19]. These eras of research have attracted the attention of many scholars in both science and engineering disciplines and led to the development of many efficient numerical methods. For example, deep learning technique in [20], the Lyapunov functional approach in [21], convolutional neural network in [22], interpretive structural modeling in [23], variational methods in [24], fractal concepts in [25], the Monte Carlo analysis in [26], wave filters in [27,28]. Other methodologies include optical waveguides in [29], optimization methods in [30], high-frequency measurements in [31], quantitative evaluations in [32], carbon nanotubes computations in [33], microfluidics in [34,35], classification algorithms in [36]. For more applications, please refer to [37,38,39].
The purpose of this article is to examine an eco-epidemiological model that simulates how diseases spread in a natural environment under the influence of several factors. Recently, these types of models have gained increasing attention due to the spread and epidemic of infectious diseases. For instance, the authors of [40] have considered the following eco-epidemiological model:
dH1(t)dt=rH1(t)−bH21(t)−cH1(t)H2(t)−α1H1(t)H3(t)e+H1(t)−βH1(t)H2(t)a+H1(t),dH2(t)dt=βH1(t)H2(t)a+H1(t)−α2H3(t)H2(t)d+H2(t)−μH2(t),dH3(t)dt=α1c1H1(t)H3(t)e+H1(t)+c2α2H3(t)H2(t)d+H2(t)−mH3(t), | (1.1) |
where H1(t),H2(t) and H3(t) are three state variables that denote susceptible and infected prey and predator, respectively. In [41], the following prey-predator model with Atangana-Baleanu derivative model has been investigated:
dH1(t)dt=H1(t)[1−H1(t)−β12H2(t)]+δH1(t)H3(t),dH2(t)dt=rH2(t)[1−H2(t)−β21H1(t)]−(1−p)H2(t)H3(t)m1+(1−p)H2(t),dH3(t)dt=H3(t)[−m2+m3(1−p)H2(t)m1+(1−p)H2(t)]. | (1.2) |
More details of the model can be found in [41].
In [42], a three-species predator-prey model in the presence of prey social behavior given by
dH1(t)dt=rH1(t)(1−H1(t)k)−βHα1(t)H2(t)−aHα1(t)H3(t),dH2(t)dt=βHα1(t)H2(t)−cH3(t)H2(t)−mH2(t),dH3(t)dt=cH3(t)H2(t)+aHα1(t)H3(t)−μH3(t), | (1.3) |
has been studied.
Research on infectious diseases has recently attracted a great deal of attention. For instance, the outbreak of vector-host diseases is modeled mathematically in [43] using a fractional model with Caputo-Fabrizio derivative. Other studies include the model for hepatitis B virus (HBV) and hepatitis C virus (HCV) co-infection in [44], prevalence of an infectious disease in a prey and predator system in [45], food chain model in [46], and hand-foot-mouth disease in [47]. During the past few decades, fractional calculus operators have become one of the effective tools for modeling various mathematical, physical and engineering problems. Probably the key reason for the increase in popularity of these operators is that they benefit from memory features as one of their main properties. Considering this valuable attribute of the operators, they are invaluable in biological modeling, since what happens in the present will be heavily influenced by what happened in the past with those variables.
In this paper, we incorporate two fractional operators, the Atangana-Baleanu-Caputo and Caputo-Fabrizio-Caputo, into a novel biological system [48]. These kinds of operators have been employed in many studies so far. However, their use should be accompanied by caution and compliance with some necessary conditions as outlined in [49].
Below is a breakdown of the remaining sections. First, some prerequisites are presented in the second part of this paper, including definitions and properties of fractional operators. The main system of the article is introduced in Section 3. A theoretical analysis of the model is presented in Section 4. The basic ideas for obtaining the numerical techniques for the model are presented in Section 5. In Section 6, we discuss the approximate solutions corresponding to the numerical methods used, as well as their implications. In the last section, we discuss several concluding remarks.
In this section, first, it is necessary to have a brief overview of some useful preliminary theorems in the field of differential calculus of fractional order.
Definition 2.1. The derivative and integral Caputo type (Cap) operators are respectively given by [50]
CapD℘H(t)=1Γ(k−℘)∫t0(t−ζ)m−℘−1ω(k)(ζ)dζ,k−1<℘≤k,k∈N, | (2.1) |
and
CapI℘H(t)=1Γ(℘)∫t0(t−ζ)℘−1ω(ζ)dζ,0<℘<1. | (2.2) |
Definition 2.2. The derivative and integral Atangana-Baleanu-Caputo (ABC) operators are respectively given by [48]
ABCD℘H(t)=W(℘)1−℘∫t0M℘[−℘1−℘(t−ζ)]ω′(ζ)dζ,℘∈(0,1), | (2.3) |
ABCI℘H(t)=1−℘W(℘)H(t)+℘W(℘)Γ(℘)∫tt0(t−μ)℘−1ω(ζ)dζ, | (2.4) |
where
W(℘)=1−℘+℘Γ(℘), |
and M℘(ζ) is the Mittag-Leffler function given by
M℘(t)=∞∑j=0tjΓ(1+j℘). | (2.5) |
After applying the integral operator ABC defined in (2.4) to the differential operator (2.3), one concludes that
ABCI℘(ABCD℘H(t))=H(t)−H(0). | (2.6) |
The Laplace transform corresponding to the ABC operator defined by (2.3) is obtained as
L[ABCD℘H(t)]=W(℘)1−℘sL[H(t)]−s℘−1H(0)s+℘1−℘. | (2.7) |
Definition 2.3. The derivative and integral Caputo-Fabrizio-Caputo (CFC) operators are respectively given by [51]
CFCD℘H(t)=Q(℘)k−℘∫t0dkω(ζ)dζkexp[−℘n−℘(t−ζ)]dζ,k−1<℘≤k, | (2.8) |
CFCI℘H(t)=2(1−℘)(2−℘)Q(℘)H(t)+2℘(2−℘)Q(℘)∫t0ω(ζ)dζ, | (2.9) |
where
Q(℘)=22−℘. | (2.10) |
The Laplace transform corresponding to the CFC operator defined by (2.8) is obtained as [41]
L[CFCD℘H(t)]=sn+1L[H(t)]−snH(0)−sn−1H′(0)−…−H(n)(0)s+℘(1−s),n−1<℘≤n. | (2.11) |
The main focus of this paper is to study the mathematical description of interactions between the populations of susceptible and infected prey given by H1(t) and H2(t), respectively. Moreover, H3(t) denotes the predator population. The mathematical description of the interactions of these components is expressed by the following nonlinear system [52]:
dH1(t)dt=aH1(t)1+κH3(t)−dH1(t)−bH1(t)(H1(t)+H2(t))−βH1(t)H2(t),dH2(t)dt=βH1(t)H2(t)−pH2(t)H3(t)−δH2(t),dH3(t)dt=cpH2(t)H3(t)−μH3(t). | (3.1) |
In this model, it is assumed that the only population that is infected by infectious disease is that of the prey. Moreover, infected prey are consumed by predators, while susceptible prey do not fall under their diet. The parameters of the model are as follows: a represents the birth rate of the susceptible prey, d is used to explain the rate of natural death in susceptible prey, b stands for the density-dependent death rate based on intra-species competition, and β describes the contact rate between the susceptible and the infected prey. Moreover, p shows the attack rate on the infected prey, and the death rate of the infected prey is presented by δ, c demonstrates the conversion coefficient. Also, μ shows the corresponding natural rate of the death for predator populations, and finally, the parameter κ denotes the level of fear which drives anti-predator behavior of the prey [40]. A comprehensive explanation of the formation of this non-linear model can be found in [40].
In this paper, we will apply two more recent definitions of fractional differential calculus in the model presented by (3.1). First, let us replace standard derivatives in the model with the ABC fractional derivative (2.3) to get the following fractional model:
ABCD℘H1(t)=aH1(t)1+κH3(t)−dH1(t)−b(H12(t)+H1(t)H2(t))−βH1(t)H2(t),ABCD℘H2(t)=βH1(t)H2(t)−pH2(t)H3(t)−δH2(t),ABCD℘H3(t)=cpH2(t)H3(t)−μH3(t), | (3.2) |
subject to initial conditions
(H1(t=0),H2(t=0),H3(t=0))=(H1,0,H2,0,H3,0)≥0. |
Moreover, by applying the CFC fractional derivative (2.8) in the model, we arrive at the following fractional model:
CFCD℘H1(t)=aH1(t)1+κH3(t)−dH1(t)−b(H12(t)+H1(t)H2(t))−βH1(t)H2(t),CFCD℘H2(t)=βH1(t)H2(t)−pH2(t)H3(t)−δH2(t),CFCD℘H3(t)=cpH2(t)H3(t)−μH3(t). | (3.3) |
In order to find more analytical intuition of the model (3.2), some related mathematical analyses are collected in this section.
In this model, the basic reproduction number R0 for system (3.2) is calculated as [52]
R0=aβbδ. | (4.1) |
The following positive equilibrium points can be calculated for the model (3.2).
● The trivial point of P0=(0,0,0).
● The axial point of P1=(a−db,0,0). This point exists if we have a>d.
● The axial equilibrium point of P2=(δβ,aβ−bδ−dββ(b+β),0). This point exists if we have aβ−bδ>dβ.
● Other equilibrium points Pi=(H∗1,H∗2,H∗3) of the system can be evaluated by determining the positive solutions of the following nonlinear algebraic system:
aH∗11+κH∗3−dH∗1−bH∗1(H∗1+H∗2)−βH∗1H∗2=0,βH∗1H∗2−pH∗2H∗3−δH∗2=0,cpH∗2H∗3−μH∗3=0. | (4.2) |
The local stability for these equilibrium points Pi=(H∗1,H∗2,H∗3) can be explored using the Jacobian matrix as
J(H∗1,H∗2,H∗3)=[aκH∗3+1−d−b(2H∗1+H∗2)−βH∗2−bH∗1−βH∗1−aH∗1κ(κH∗3+1)2βH∗2βH∗1−pH∗3−δ−pH∗20cpH∗3cpH∗2−μ]. | (4.3) |
To this end, let us employ the ABC integral operator (2.4) on the system (3.2). Then, we get
H1(t)−H1(0)=1−℘W(℘)Q1(H(t))+℘W(℘)Γ(℘)∫t0(t−ζ)℘−1Q1(H(ζ))dζ,H2(t)−H2(0)=1−℘W(℘)Q2(H(t))+℘W(℘)Γ(℘)∫t0(t−ζ)℘−1Q2(H(ζ))dζ,H3(t)−H3(0)=1−℘W(℘)Q3(H(t))+℘W(℘)Γ(℘)∫t0(t−ζ)℘−1Q3(H(ζ))dζ, | (4.4) |
where H(t)=[H1(t),H2(t),H3(t)], and also we define
Q1(H(t))=aH1(t)1+κH3(t)H1(t)−d−bH1(t)(H1(t)+H2(t))−βH1(t)H2(t),Q2(H(t))=βH1(t)H2(t)−pH2(t)H3(t)−δH2(t),Q3(H(t))=cpH2(t)H3(t)−μH3(t). | (4.5) |
Define
M(H(t))=[Q1(H(t)),Q2(H(t)),Q3(H(t))], |
and moreover
H0=[H1(0),H2(0),H3(0)]. |
Using these assumptions, Eq (4.4) can be rewritten as
H(t)−H0=1−℘W(℘)M(H(t))+℘W(℘)Γ(℘)∫t0(t−ζ)℘−1M(H(ζ))dζ. | (4.6) |
Then, from (4.6) along with H0(t)=H0, the following recursive structure is conceivable:
Hn(t)−H0=1−℘W(℘)M(Hn−1(t))+℘W(℘)Γ(℘)∫t0(t−ζ)℘−1M(Hn−1(ζ))dζ. | (4.7) |
Considering Eq (4.7), we will have
Hn(t)−Hn−1(t)=1−℘W(℘)[M(Hn−1(t))−M(Hn−2(t))] | (4.8) |
+℘W(℘)Γ(℘)∫t0(t−ζ)℘−1[M(Hn−1(ζ))−M(Hn−2(ζ))]dζ. | (4.9) |
In this position, we define
ϱn(t)=Hn(t)−Hn−1(t). |
Then, it follows that
Hn(t)=n∑i=0ϱi(t). | (4.10) |
As a result, one gets
‖ϱn(t)‖=‖Hn(t)−Hn−1(t)‖,‖ϱn(t)‖=‖1−℘W(℘)[M(Hn−1(t))−M(Hn−2(t))]+℘W(℘)Γ(℘)∫t0(t−ζ)℘−1[M(Hn−1(ζ))−M(Hn−2(ζ))]dζ‖. | (4.11) |
Hence, we have
‖ϱn(t)‖≤1−℘W(℘)‖M(Hn−1(t))−M(Hn−2(t))‖+℘W(℘)Γ(℘)∫t0(t−ζ)℘−1‖M(Hn−1(ζ))−M(Hn−2(ζ))‖dζ. | (4.12) |
Now, our main assumption will be that the nonlinear operator M has the Leibniz condition, so we can write
‖ϱn(t)‖≤1−℘W(℘)L‖Hn−1(t)−Hn−2(t)‖+℘LW(℘)Γ(℘)∫t0(t−ζ)℘−1‖Hn−1(t)−Hn−2(t)‖dζ. |
Consequently, we derive the following inequality:
‖ϱn(t)‖≤1−℘W(℘)L‖ϱn−1(t)‖+℘LW(℘)Γ(℘)∫t0(t−ζ)℘−1‖ϱn−1(t)‖dζ. |
Further, replacing ‖ϱn−1(t)‖, one arrives at
‖ϱn(t)‖≤(1−℘W(℘)L+℘Lt℘W(℘)Γ(℘+1))2‖ϱn−2(t)‖. |
Also, it reads
‖ϱn(t)‖≤(1−℘W(℘)L+℘Lt℘W(℘)Γ(℘+1))3‖ϱn−3(t)‖. |
And, finally, we obtain
‖ϱn(t)‖≤(1−℘W(℘)L+℘Lt℘W(℘)Γ(℘+1))n‖ϱ0(t)‖≤(1−℘W(℘)+℘t℘W(℘)Γ(℘+1))nLnmaxt∈[0,T]H0(t). | (4.13) |
Now, let us define
H(t)=n∑i=0ϱi(t). | (4.14) |
In addition, according to the H(t) structure, it holds that
H(t)=Hn(t)+θn(t), | (4.15) |
where θn(t)→0 when n(t)→∞. Thus,
H(t)−Hn(t)=1−℘W(℘)M(H(t)−θn(t))+℘W(℘)Γ(℘)∫t0(t−ζ)℘−1M(H(ζ)−μn(ζ))dζ. | (4.16) |
Now, we can write
H(t)−H0−1−℘W(℘)M(H(t)−θn(t))−℘W(℘)Γ(℘)∫t0(t−ζ)℘−1M(H(ζ)−μn(ζ))dζ=θn(t)+1−℘W(℘)[M(H(t)−θn(t))−M(H(t))]−℘W(℘)Γ(℘)∫t0(t−ζ)℘−1[M(H(ζ)−μn(ζ))−M(H(ζ))]dζ. | (4.17) |
After applying the norm of the above equation, we will have
‖H(t)−H0(t)−1−℘W(℘)M(H(t))+℘W(℘)Γ(℘)∫t0(t−ζ)℘−1M(H(ζ)dζ‖≤‖θn(t)‖+1−℘W(℘)‖M(H(ζ)−μn(ζ))−M(H(ζ))‖+℘W(℘)Γ(℘)∫t0(t−ζ)℘−1‖M(H(ζ)−μn(ζ))−M(H(ζ))‖dζ≤‖θn(t)‖+1−℘W(℘)L‖θn−1(t)‖+℘t℘W(℘)Γ(℘+1)L‖θn−1(t)‖. |
For n→∞, we have
H(t)−H0=1−℘W(℘)M(H(t))+℘W(℘)Γ(℘)∫t0(t−ζ)℘−1M(H(ζ))dζ. | (4.18) |
This will be the result for the existence of the solution.
In order to prove the uniqueness of the solution, let us assume that H1(t) and H2(t) are two solutions to the problem. So, we have
‖H1(t)−H2(t)‖≤1−℘W(℘)L‖H1(t)−H2(t)‖+℘Lt℘W(℘)Γ(℘+1)‖H1(t)−H2(t)‖≤(1−℘W(℘)L+℘Lt℘Θ(1+℘)Γ(℘))‖H1(t)−H2(t)‖⋮≤(1−℘W(℘)L+℘Lt℘Θ(1+℘)Γ(℘))n‖H1(t)−H2(t)‖. |
So, if we have
1−℘W(℘)L+℘Lt℘Θ(1+℘)Γ(℘)<1, |
then by taking n→∞, we obtain
(1−℘W(℘)L+℘Lt℘Θ(1+℘)Γ(℘))n→0. |
Thus, ‖H1(t)−H2(t)‖=0 holds. Therefore, H1(t)=H2(t) results.
Along with providing new differential operators in fractional calculus, the most important concern will always be the design of efficient approximate algorithms for solving those problems numerically. Thus, there is always a numerical method that needs to be developed for each new definition of an operator. There are advantages, limitations, and requirements associated with each of these numerical methods. Our objective in this section is to design two numerical techniques using the definition of the product integration rule (PI), as outlined in [53].
To extract an efficient numerical technique for ABC fractional problems, we take the following fractional Cauchy problem:
ABCD℘H(t)=N(t,H(t)). | (5.1) |
Based on the application of the ABC fractional integral definition in Eq (2.4) on Eq (5.1), we derive the integral equation as follows:
H(t)−H(t0)=1−℘W(℘)N(t,H(t))+℘W(℘)Γ(℘)∫tt0(t−ζ)℘−1N(ζ,H(ζ))dζ. | (5.2) |
Setting t=tn=t0+nΔt in Eq (5.2) yields
H(tn)=H(t0)+1−℘W(℘)N(tn,H(tn))+℘W(℘)Γ(℘)n−1∑i=0∫ti+1ti(tn−ζ)℘−1N(ζ,H(ζ))dζ. | (5.3) |
Now, a linearized form of N(ζ,H(ζ)) is considered as follows:
N(ζ,H(ζ))≈N(ti+1,Hi+1)+ζ−ti+1Δt(N(ti+1,Hi+1)−N(ti,Hi)),ζ∈[ti,ti+1], | (5.4) |
where Hi=H(ti).
Using (5.4) in (5.3), and also by doing some algebraic calculations, we obtain [54,55,56]:
Hn=H0+℘ΔtW(℘)(νnN(t0,H0)+n∑i=1ζn−iN(ti,Hi)),n≥1, | (5.5) |
where
σn=(−1+n)℘+1−n(−1+n−℘)Γ(℘+2),ζi={1−℘℘Δt+1Γ(℘+2),i=0,(i−1)℘+1−2i℘+1+(i+1)℘+1Γ(℘+2),i=1,2,…,n−1. | (5.6) |
As a result of (5.5) and (5.6), one can effectively assess the approximate solution to the fractional system (5.1). In particular, to approximate the problem (3.2), we will have
H1,n=H1,0+℘ΔtW(℘)[σn(aH1,01+κH3,0H1,0−d−bH1,0(H1,0+H2,0)−βH1,0H2,0)+n∑i=0ζn−i(aH1,i1+κH3,iH1,i−d−bH1,i(H1,i+H2,i)−βH1,iH2,i)],H2,n=H2,0+℘ΔtW(℘)[σn(βH1,0H2,0−pH2,0H3,0−δH2,0)+n∑i=0ζn−i(βH1,iH2,i−pH2,iH3,i−δH2,i)],H3,n=H3,0+℘ΔtW(℘)[σn(cpH2,0H3,0−μH3,0)+n∑i=0ζn−i(cpH2,iH3,i−μH3,i)]. | (5.7) |
These resulting schemes have implicit structures which can be solved utilizing efficient techniques in solving systems of nonlinear algebraic equations like Newton's method.
In this part, to extract a numerical scheme for CFC fractional problem (3.3), we study the following fractional system:
CFCD℘H(t)=N(t,H(t)). | (5.8) |
Utilizing the corresponding fractional integral operator (2.9) on both sides of (2.8) yields
H(t)−H(0)=1−℘Q(℘)N(t,H(t))+℘Q(℘)∫t0N(ζ,H(ζ))dζ. | (5.9) |
Taking t=tn+1 in (5.9), one has
H(tn+1)−H(0)=(2−℘)(1−℘)2N(tn,H(tn))+℘(2−℘)2∫tn+10N(ζ,H(ζ))dζ, | (5.10) |
and
H(tn)−H(0)=(2−℘)(1−℘)2N(tn−1,H(tn−1))+℘(2−℘)2∫tn0N(ζ,H(ζ))dζ. | (5.11) |
Inserting Eq (5.11) into Eq (5.10), we obtain
H(tn+1)=H(tn)+(2−℘)(1−℘)2[N(tn,H(tn))−N(tn−1,H(tn−1))]+℘(2−℘)2∫tn+1tnN(ζ,H(ζ))dζ, | (5.12) |
where
∫tn+1tnN(ζ,H(ζ))dζ=3Δt2N(tn,Hn)−Δt2N(tn−1,Hn−1). | (5.13) |
Thus, we get
Hn+1=Hn+[(2−℘)(1−℘)2+3Δt4℘(2−℘)]N(tn,Hn)−[(2−℘)(1−℘)2+Δt4℘(2−℘)]N(tn−1,Hn−1). | (5.14) |
Accordingly, the following iterative schemes are determined in order to approximate the problem (3.3) in the following manner [57]:
H1,n+1=H1,n+[(2−℘)(1−℘)2+3Δt4℘(2−℘)](aH1,n1+κH3,nH1,n−d−βH1,nH2,n−bH1,n(H1,n+H2,n))−[(2−℘)(1−℘)2+Δt4℘(2−℘)](aH1,n1+κH3,nH1,n−1−d−βH1,n−1H2,n−1−bH1,n−1(H1,n−1+H2,n−1)),H2,n+1=H2,n+[(2−℘)(1−℘)2+3Δt4℘(2−℘)](βH1,nH2,n−pH2,nH3,n−δH2,n)−[(2−℘)(1−℘)2+Δt4℘(2−℘)](βH1,n−1H2,n−1−pH2,n−1H3,n−1−δH2,n−1),H3,n+1=H3,n+[(2−℘)(1−℘)2+3Δt4℘(2−℘)](cpH2,nH3,n−μH3,n)−[(2−℘)(1−℘)2+Δt4℘(2−℘)](cpH2,n−1H3,n−1−μH3,n−1). | (5.15) |
The results of scheme model (3.3) will be obtained using these explicit iterative schemes.
A description of the numerical properties of the system is presented in this section. To this end, it is imperative to examine the equilibrium points for the model in more detail.
As mentioned earlier, the positive equilibrium point of
Pi=(H∗1,H∗2,H∗3) |
for the model is a positive solution for the following system:
aH∗11+κH∗3−dH∗1−bH∗1(H∗1+H∗2)−βH∗1H∗2=0,βH∗1H∗2−pH∗2H∗3−δH∗2=0,cpH∗2H∗3−μH∗3=0. | (6.1) |
From the last equation of (6.1), we immediately conclude that
H∗2=μcp. | (6.2) |
Considering this result in the second equation of the system, it reads
H∗1=pH∗3+δβ. | (6.3) |
Taking these results into account in the first equation of the system along with some simplifications, a quadratic equation for H∗3 is obtained as
C2H∗32+C1H∗3+C0=0, | (6.4) |
where
C2=bcκp2,C1=bcδκp+βcdκp+bβκμ+bcp2+β2κμ,C0=−aβcp+bδcp+dβcp+bμβ+β2μ. |
The performed numerical simulations in this paper are based on the following parameters:
a=0.5, d=0.1, b=0.1, p=1, δ=0.2, c=0.8, μ=0.3, β=0.5, κ=0.4. | (6.5) |
For these particular choices, the equilibrium point for the model will be determined as follows:
(H∗∗1,H∗∗2,H∗∗3)=(1.120356776,0.375,0.3601783881). | (6.6) |
In what will come later in this section, the level of sensitivity of the model to the existing parameters will be checked. These results can be considered a confirmation of the theoretical results related to the model.
Figures 1 and 2 demonstrate the model's sensitivity to the changes of the parameter ℘ in the two approximate methods of the article. Convergence of the model to equilibrium point (H∗∗1,H∗∗2,H∗∗3) is evident in these graphs.
It seems that in Figure 1, for smaller values of ℘, the speed of convergence to the balanced point of the system occurs faster, and with its increase, the results will be more unstable and accompanied by fluctuating behavior.
It seems that in Figure 2, the oscillatory behavior increases in the model, and as a result the speed of convergence is very slow.
The fear parameter (κ) is one of the most important components defined in the model, and it strongly influences the type of system behavior. In [52], a detailed analysis of the effect of this parameter on the results is presented and can be considered a good benchmark for comparing our results. Figures 3 and 4 demonstrate the model's sensitivity with respect to the changes of parameter κ in the two approximate methods of the article.
In this case, the positive equilibrium point is (pH∗3+δβ,μcp,H∗3) where H∗3 is determined from
0.08κH∗32+(0.146κ+0.08)H∗3−0.054=0. | (6.7) |
In Figures 3 and 4, for κ=0, with no fear factor, the equilibrium point of the system is obtained
(H∗1,H∗2,H∗3)=(1.75,0.375,0.675), |
whose Jacobian matrix is
J(H∗1,H∗2,H∗3)=[−740−212003160−38027500], | (6.8) |
with the following eigenvalues:
[−0.09046466345−0.04226766828+0.6244525470i−0.04226766828−0.6244525470i]. |
This is a clear proof of the stability of this equilibrium point.
Also, for κ=0.4, the equilibrium point of the system is obtained
(H∗1,H∗2,H∗3)=(1.120356778,0.375,0.360178389), |
whose Jacobian matrix is
J(H∗1,H∗2,H∗3)=[−3649+169√2411080+520√241471200−39√24120031400−2600√241(27+13√241)23160−380−173100+13√2411000], | (6.9) |
with the following eigenvalues:
[−0.01004360203+0.4818151018i−0.01004360203−0.4818151018i−0.09194847354]. |
With the increase of the real negative parts of the eigenvalues, the instability of the system is gradually increased, which is also clearly evident in the graphs. Finally, for κ=1, we have a unique positive equilibrium
(H∗1,H∗2,H∗3)=(0.843122550,0.375,0.221561275), |
whose Jacobian matrix is
J(H∗1,H∗2,H∗3)=[−2029+13√17089−1320+40√17089291200−3√170892007760−80√17089(−33+√17089)23160−380−113100+√170891000], | (6.10) |
with the following eigenvalues:
[0.004096458172+0.4025677279i0.004096458172−0.4025677279i−0.09250517127]. |
So, a clear proof of the instability of this equilibrium point is observed.
The numerical results obtained in this case are completely consistent with the numerical properties reported in [52].
Figures 5 and 6 demonstrate the model's sensitivity with respect to the changes of parameter β in the two approximate methods of the article. In these diagrams, it can be seen that as β increases, the equilibrium type changes from an interior point to a planar point. For these situations, the infected predator population is on the way to extinction. For example, for β=1.2, we have a unique positive equilibrium
(H∗1,H∗2,H∗3)=(0.1666666667,0.2948717949,0), |
whose Jacobian matrix is
J(H∗1,H∗2,H∗3)=[−0.0166666667−0.2166666667−0.033333333340.35384615390.0−0.294871794900.0−0.0641025641], | (6.11) |
with the following eigenvalues:
[−0.008333333350+0.2767620318i−0.008333333350−0.2767620318i−0.06410256410]. |
Figures 7 and 8 demonstrate the model's sensitivity with respect to the changes of the attack rate on the infected prey in the two approximate methods of the article. The important thing that can be seen from the results is that with the increase of the value for the parameter, the type of equilibrium point in the problem changes completely.
The models in eco-epidemiology are computational tools that describe ecology and epidemiology problems in a meaningful way. The use of novel mathematical definitions in modeling eco-epidemiological scenarios can be very helpful and lead to significant results in real-world problems. The aim of this paper is to study a nonlinear predator-prey system where the prey growth rate is reduced due to anti-predator behavior. This paper employs two new definitions in fractional calculus called the ABC and CFC fractional derivatives. These two definitions are useful tools that can be used for solving the model. Our research results may be of great value to scholars in the future, when they want to apply our employed techniques to model real problems related to the epidemic and control it more efficiently.
The authors extend their appreciation to Prince Sattam bin Abdulaziz University for funding this research work through the project number (PSAU/2023/01/23035).
The authors declare that they have no competing interests.
[1] |
H. Markowitz, Portfolio selection, J. Fin., 7 (1952), 77–91. https://doi.org/10.2307/2975974 doi: 10.2307/2975974
![]() |
[2] |
P. Artzner, F. Delbaen, J. Eber, D. Heath, Coherent measures of risk, Math. Financ., 9 (1999), 203–228. https://doi.org/10.1111/1467-9965.00068 doi: 10.1111/1467-9965.00068
![]() |
[3] | J. Longerstaey, M. Spencer, Riskmetricstm–Technical document, 4 Eds., New York: Morgan Guaranty Trust Company of New York, 1996. |
[4] |
F. Y. Chen, Analytical VaR for international portfolios with common jumps, Comput. Math. Appl., 62 (2011), 3066–3076. https://doi.org/10.1016/j.camwa.2011.08.018 doi: 10.1016/j.camwa.2011.08.018
![]() |
[5] |
J. W. Goh, K. G. Lim, M. Sim, W. Zhang, Portfolio value-at-risk optimization for asymmetrically distributed asset returns, Eur. J. Oper. Res., 221 (2012), 397–406. https://doi.org/10.1016/j.ejor.2012.03.012 doi: 10.1016/j.ejor.2012.03.012
![]() |
[6] |
S. Basak, A. Shapiro, Value-at-risk based risk management: Optimal policies and asset prices, Rev. Fin. Stud., 14 (2001), 371–405. https://doi.org/10.1093/rfs/14.2.371 doi: 10.1093/rfs/14.2.371
![]() |
[7] |
T. Rockfeller, S. Uryasev, Optimization of conditional value-at-risk, J. Risk, 2 (2000), 21–41. https://doi.org/10.21314/JOR.2000.038 doi: 10.21314/JOR.2000.038
![]() |
[8] |
R. T. Rockfeller, S. Uryasev, Conditional value-at-risk for general loss distribution, J. Bank. Financ., 26 (2002), 1443–1471. https://doi.org/10.1016/S0378-4266(02)00271-6 doi: 10.1016/S0378-4266(02)00271-6
![]() |
[9] |
S. Alexander, T. F. Coleman, Y. Li, Minimizing CVaR and VaR for a portfolio of derivatives, J. Bank. Finan., 30 (2006), 583–605. https://doi.org/10.1016/j.jbankfin.2005.04.012 doi: 10.1016/j.jbankfin.2005.04.012
![]() |
[10] |
S. Zhu, M. Fukushima, Worst-case conditional value-at-risk with application to robust portfolio management, Oper. Res., 57 (2009), 1155–1168. https://doi.org/10.1287/opre.1080.0684 doi: 10.1287/opre.1080.0684
![]() |
[11] |
S. Yau, R. H. Kwon, J. S. Rogers, D. Wu, Financial and operational decisions in the electricity sector: Contract portfolio optimization with the conditional value-at-risk criterion, Int. J. Prod. Econ., 134 (2011), 67–77. https://doi.org/10.1016/j.ijpe.2010.10.007 doi: 10.1016/j.ijpe.2010.10.007
![]() |
[12] |
L. J. Hong, G. Liu, Simulating sensitivities of conditional value at risk, Manage. Sci., 55 (2009), 281–293. https://doi.org/10.1287/mnsc.1080.0901 doi: 10.1287/mnsc.1080.0901
![]() |
[13] |
S. Zhao, Q. Lu, L. Han, Y. Liu, F. Hu, A mean-CVaR-skewness portfolio optimization model based on asymmetric Laplace distribution, Ann. Oper. Res., 226 (2015), 727–739. https://doi.org/10.1007/s10479-014-1654-y doi: 10.1007/s10479-014-1654-y
![]() |
[14] |
F. G. Ferreira, R. T. Cardoso, Mean-CVaR portfolio optimization approaches with variable cardinality constraint and rebalancing process, Arch. Comput. Method. Eng., 28 (2021), 3703–3720. https://doi.org/10.1007/s11831-020-09522-1 doi: 10.1007/s11831-020-09522-1
![]() |
[15] |
C. I. Fábián, Handling CVaR objectives and constraints in two-stage stochastic models, Eur. J. Oper. Res., 191 (2008), 888–911. https://doi.org/10.1016/j.ejor.2007.02.052 doi: 10.1016/j.ejor.2007.02.052
![]() |
[16] |
W. Liu, L. Yang, B. Yu, Kernel density estimation based distributionally robust mean-CVaR portfolio optimization, J. Glob. Optim., 84 (2022), 1053–1077. https://doi.org/10.1007/s10898-022-01177-5 doi: 10.1007/s10898-022-01177-5
![]() |
[17] |
N. Abudurexiti, K. He, D. Hu, S. T. Rachev, H. Sayit, R. Sun, Portfolio analysis with mean-CVaR and mean-CVaR-skewness criteria based on mean–variance mixture models, Ann. Oper. Res., 336 (2024), 945–966. https://doi.org/10.1007/s10479-023-05396-1 doi: 10.1007/s10479-023-05396-1
![]() |
[18] |
F. Q. Lu, M. Huang, W. K. Ching, T. K. Siu, Credit portfolio management using two-level particle swarm optimization, Inform. Sci., 237 (2013), 162–175. https://doi.org/10.1016/j.ins.2013.03.005 doi: 10.1016/j.ins.2013.03.005
![]() |
[19] |
T. Zhang, Z. Liu, Fireworks algorithm for mean-VaR/CVaR models, Physica A: Stat. Mech. Appl., 483 (2017), 1–8. https://doi.org/10.1016/j.physa.2017.04.036 doi: 10.1016/j.physa.2017.04.036
![]() |
[20] |
J. Zhai, M. Bai, H. Wu, Mean-risk-skewness models for portfolio optimization based on uncertain measure, Optimization, 67 (2018), 701–714. https://doi.org/10.1080/02331934.2018.1426577 doi: 10.1080/02331934.2018.1426577
![]() |
[21] |
Y. Li, B. Zhou, Y. Tan, Portfolio optimization model with uncertain returns based on prospect theory, Complex Intell. Syst., 8 (2022), 4529–4542. https://doi.org/10.1007/s40747-021-00493-9 doi: 10.1007/s40747-021-00493-9
![]() |
[22] |
F. Lu, T. Yan, H. Bi, M. Feng, S. Wang, M. Huang, A bilevel whale optimization algorithm for risk management scheduling of information technology projects considering outsourcing, Knowl.-Based Syst., 235 (2022), 107600. https://doi.org/10.1016/j.knosys.2021.107600 doi: 10.1016/j.knosys.2021.107600
![]() |
[23] |
J. Danane, M. Yavuz, M. Yıldız, Stochastic modeling of three-species prey–predator model driven by Lévy Jump with Mixed Holling-Ⅱ and Beddington–DeAngelis functional responses, Fractal Fract., 7 (2023), 751. https://doi.org/10.3390/fractalfract7100751 doi: 10.3390/fractalfract7100751
![]() |
[24] |
Y. Song, G. Zhao, B. Zhang, H. Chen, W. Deng, W. Deng, An enhanced distributed differential evolution algorithm for portfolio optimization problems, Eng. Appl. Artif. Intel., 121 (2023), 106004. https://doi.org/10.1016/j.engappai.2023.106004 doi: 10.1016/j.engappai.2023.106004
![]() |
[25] |
X. S. Yang, A. H. Gandomi, Bat algorithm: A novel approach for global engineering optimization, Eng. Computation., 29 (2012), 464–483. https://doi.org/10.1108/02644401211235834 doi: 10.1108/02644401211235834
![]() |
[26] |
A. H. Gandomi, A. H. Alavi, Krill herd: A new bio-inspired optimization algorithm, Commun. Nonlinear Sci., 12 (2012), 4831–4845. https://doi.org/ 10.1016/j.cnsns.2012.05.010 doi: 10.1016/j.cnsns.2012.05.010
![]() |
[27] |
S. Mirjalili, S. M. Mirjalili, A. Lewis, Grey wolf optimizer, Adv. Eng. Softw., 69 (2014), 46–61. https://doi.org/10.1016/j.advengsoft.2013.12.007 doi: 10.1016/j.advengsoft.2013.12.007
![]() |
[28] |
A. Askarzadeh, A novel metaheuristic method for solving constrained engineering optimization problems: Crow search algorithm, Comput. Struct., 169 (2016), 1–12. https://doi.org/10.1016/j.compstruc.2016.03.001 doi: 10.1016/j.compstruc.2016.03.001
![]() |
[29] |
S. Mirjalili, A. Lewis, The whale optimization algorithm, Adv. Eng. Softw., 95 (2016), 51–67. https://doi.org/10.1016/j.advengsoft.2016.01.008 doi: 10.1016/j.advengsoft.2016.01.008
![]() |
[30] |
S. Saremi, S. Mirjalili, A. Lewis, Grasshopper optimisation algorithm: Theory and application, Adv. Eng. Softw., 105 (2017), 30–47. https://doi.org/10.1016/j.advengsoft.2017.01.004 doi: 10.1016/j.advengsoft.2017.01.004
![]() |
[31] |
G. Wang, Moth search algorithm: A bio-inspired metaheuristic algorithm for global optimization problems, Memetic Comp., 10 (2018), 151–164. https://doi.org/10.1007/s12293-016-0212-3 doi: 10.1007/s12293-016-0212-3
![]() |
[32] |
N. A. Kallioras, N. D. Lagaros, D. N. Avtzis, Pity beetle algorithm–A new metaheuristic inspired by the behavior of bark beetles, Adv. Eng. Softw., 147 (2018), 147–166. https://doi.org/10.1016/j.advengsoft.2018.04.007 doi: 10.1016/j.advengsoft.2018.04.007
![]() |
[33] |
A. A. Heidari, S. Mirjalili, H. Faris, I. Aljarah, M. Mafarja, H. Chen, Harris hawks optimization: Algorithm and applications, Future Gener. Comp. Syst., 97 (2019), 849–872. https://doi.org/10.1016/j.future.2019.02.028 doi: 10.1016/j.future.2019.02.028
![]() |
[34] |
M. Jain, V. Singh, A. Rani, A novel nature-inspired algorithm for optimization: Squirrel search algorithm, Swarm Evol. Comput., 44 (2019), 148–175. https://doi.org/10.1016/j.swevo.2018.02.013 doi: 10.1016/j.swevo.2018.02.013
![]() |
[35] |
S. Arora, S. Singh, Butterfly optimization algorithm: A novel approach for global optimization, Soft Comput., 23 (2019), 715–734. https://doi.org/10.1007/s00500-018-3102-4 doi: 10.1007/s00500-018-3102-4
![]() |
[36] |
A. Faramarzi, M. Heidarinejad, S. Mirjalili, A. H. Gandomi, Marine Predators Algorithm: A nature-inspired metaheuristic, Expert Syst. Appl., 152 (2020), 113377. https://doi.org/10.1016/j.eswa.2020.113377 doi: 10.1016/j.eswa.2020.113377
![]() |
[37] |
M. Khishe, M. R. Mosavi, Chimp optimization algorithm, Expert Syst. Appl., 149 (2020), 113338. https://doi.org/10.1016/j.eswa.2020.113338 doi: 10.1016/j.eswa.2020.113338
![]() |
[38] |
S. Li, H. Chen, M. Wang, A. A. Heidari, S. Mirjalili, Slime mould algorithm: A new method for stochastic optimization, Future Gener. Comp. Syst., 111 (2020), 300–323. https://doi.org/10.1016/j.future.2020.03.055 doi: 10.1016/j.future.2020.03.055
![]() |
[39] |
A. Mohammadi-Balani, M. D. Nayeri, A. Azar, M. Taghizadeh-Yazdi, Golden eagle optimizer: A nature-inspired metaheuristic algorithm, Comput. Ind. Eng., 152 (2021), 107050. https://doi.org/10.1016/j.cie.2020.107050 doi: 10.1016/j.cie.2020.107050
![]() |
[40] |
D. Połap, M. Woźniak, Red fox optimization algorithm, Expert Syst. Appl., 166 (2021), 114107. https://doi.org/10.1016/j.eswa.2020.114107 doi: 10.1016/j.eswa.2020.114107
![]() |
[41] |
Y. Yang, H. Chen, A. A. Heidari, A. H. Gandomi, Hunger games search: Visions, conception, implementation, deep analysis, perspectives, and towards performance shifts, Expert Syst. Appl., 177 (2021), 114864. https://doi.org/10.1016/j.eswa.2021.114864 doi: 10.1016/j.eswa.2021.114864
![]() |
[42] |
I. Ahmadianfar, A. A. Heidari, A. H. Gandomi, X. Chu, H. Chen, RUN beyond the metaphor: An efficient optimization algorithm based on Runge Kutta method, Expert Syst. Appl., 181 (2021), 115079. https://doi.org/10.1016/j.eswa.2021.115079 doi: 10.1016/j.eswa.2021.115079
![]() |
[43] |
J. Tu, H. Chen, M. Wang, A. H. Gandomi, The colony predation algorithm, J. Bionic Eng., 181 (2021), 674–710. https://doi.org/10.1007/s42235-021-0050-y doi: 10.1007/s42235-021-0050-y
![]() |
[44] |
I. Ahmadianfar, A. A. Heidari, S. Noshadian, H. Chen, A. H Gandomi, INFO: An efficient optimization algorithm based on weighted mean of vectors, Expert Syst. Appl., 195 (2021), 116516. https://doi.org/10.1016/j.eswa.2022.116516 doi: 10.1016/j.eswa.2022.116516
![]() |
[45] |
B. Abdollahzadeh, F. S. Gharehchopogh, S. Mirjalili, African vultures optimization algorithm: A new nature-inspired metaheuristic algorithm for global optimization problems, Comput. Ind. Eng., 158 (2021), 107408. https://doi.org/10.1016/j.cie.2021.107408 doi: 10.1016/j.cie.2021.107408
![]() |
[46] |
B. Abdollahzadeh, F. S. Gharehchopogh, S. Mirjalili, Artificial gorilla troops optimizer: A new nature-inspired metaheuristic algorithm for global optimization problems, Int. J. Intell. Syst., 36 (2021), 5887–5958. https://doi.org/10.1002/int.22535 doi: 10.1002/int.22535
![]() |
[47] |
F. A. Hashim, E. H. Houssein, K. Hussain, M. S. Mabrouk, W. Al-Atabany, Honey Badger Algorithm: New metaheuristic algorithm for solving optimization problems, Math. Comput. Simulat., 192 (2022), 84–110. https://doi.org/10.1016/j.matcom.2021.08.013 doi: 10.1016/j.matcom.2021.08.013
![]() |
[48] |
W. Zhao, L. Wang, S. Mirjalili, Artificial hummingbird algorithm: A new bio-inspired optimizer with its engineering applications, Comput. Method. Appl. Mech. Eng., 388 (2022), 114194. https://doi.org/10.1016/j.cma.2021.114194 doi: 10.1016/j.cma.2021.114194
![]() |
[49] |
B. Abdollahzadeh, F. S. Gharehchopogh, N. Khodadadi, S. Mirjalili, Mountain gazelle optimizer: A new nature-inspired metaheuristic algorithm for global optimization problems, Adv. Eng. Softw., 174 (2022), 103282. https://doi.org/10.1016/j.advengsoft.2022.103282 doi: 10.1016/j.advengsoft.2022.103282
![]() |
[50] |
E. H. Houssein, D. Oliva, N. A. Samee, N. F. Mahmoud, M. M. Emam, Liver Cancer Algorithm: A novel bio-inspired optimizer, Comput. Biol. Med., 165 (2023), 107389. https://doi.org/10.1016/j.compbiomed.2023.107389 doi: 10.1016/j.compbiomed.2023.107389
![]() |
[51] |
H. Su, D. Zhao, A. A. Heidari, L. Liu, X. Zhang, M. Mafarja, et al., RIME: A physics-based optimization, Neurocomputing, 532 (2023), 183–214. https://doi.org/10.1016/j.neucom.2023.02.010 doi: 10.1016/j.neucom.2023.02.010
![]() |
[52] |
C. Zhong, G. Li, Z. Meng, Beluga whale optimization: A novel nature-inspired metaheuristic algorithm, Knowl.-Based Syst., 251 (2022), 109215. https://doi.org/10.1016/j.knosys.2022.109215 doi: 10.1016/j.knosys.2022.109215
![]() |
[53] |
D. H. Wolpert, W. G. Macready, No free lunch theorems for optimization, IEEE T. Evolut. Comput., 1 (1997), 67–82. https://doi.org/10.1109/4235.585893 doi: 10.1109/4235.585893
![]() |
[54] |
M. M. Mafarja, S. Mirjalili, Hybrid whale optimization algorithm with simulated annealing for feature selection, Neurocomputing, 260 (2017), 302–312. https://doi.org/10.1016/j.neucom.2017.04.053 doi: 10.1016/j.neucom.2017.04.053
![]() |
[55] |
M. Abdel-Basset, W. Ding, D. El-Shahat, A hybrid Harris Hawks optimization algorithm with simulated annealing for feature selection, Artif Intell. Rev., 54 (2021), 593–637. https://doi.org/10.1007/s10462-020-09860-3 doi: 10.1007/s10462-020-09860-3
![]() |
[56] |
P. J. Gaidhane, M. J. Nigam, A hybrid grey wolf optimizer and artificial bee colony algorithm for enhancing the performance of complex systems, J. Comput. Sci., 27 (2018), 284–302. https://doi.org/10.1016/j.jocs.2018.06.008 doi: 10.1016/j.jocs.2018.06.008
![]() |
[57] |
B. Farnad, A. Jafarian, D. Baleanu, A new hybrid algorithm for continuous optimization problem, Appl. Math. Model., 55 (2018), 652–673. https://doi.org/10.1016/j.apm.2017.10.001 doi: 10.1016/j.apm.2017.10.001
![]() |
[58] |
M. AkbaiZadeh, T. Niknam, A. Kavousi-Fard, Adaptive robust optimization for the energy management of the grid-connected energy hubs based on hybrid meta-heuristic algorithm, Energy, 235 (2021), 121171. https://doi.org/10.1016/j.energy.2021.121171 doi: 10.1016/j.energy.2021.121171
![]() |
[59] |
A. A. Najafi, S. Mushakhian, Multi-stage stochastic mean–semivariance–CVaR portfolio optimization under transaction costs, Appl. Math. Comput., 256 (2015), 445–458. https://doi.org/10.1016/j.amc.2015.01.050 doi: 10.1016/j.amc.2015.01.050
![]() |
[60] |
M. F. Leung, J. Wang, Cardinality-constrained portfolio selection based on collaborative neurodynamic optimization, Neural Networks, 145 (2022), 68–79. https://doi.org/10.1016/j.neunet.2021.10.007 doi: 10.1016/j.neunet.2021.10.007
![]() |
[61] |
H. Sorensen, Parametric inference for diffusion processes observed at discrete points in time: A survey, Int. Stat. Rev., 72 (2004), 337–354. https://doi.org/10.1111/j.1751-5823.2004.tb00241.x doi: 10.1111/j.1751-5823.2004.tb00241.x
![]() |
[62] | R. Cont, P. Tankov, Financial modelling with jump processes, 1 Eds., New York: Chapman and Hall/CRC, 2003. https://doi.org/10.1201/9780203485217 |
[63] |
D. Ardia, J. David, O. Arango, N. D. G. Gómez, Jump-diffusion calibration using differential evolution, Wilmott, 55 (2011), 76–79. https://doi.org/10.1002/wilm.10034 doi: 10.1002/wilm.10034
![]() |
[64] |
R. Y. Rubinstein, Optimization of computer simulation models with rare events, Eur. J. Oper. Res., 99 (1997), 89–112. https://doi.org/10.1016/S0377-2217(96)00385-2 doi: 10.1016/S0377-2217(96)00385-2
![]() |
[65] |
P. T. de Boer, D. P. Kroese, R. Y. Rubinstein, A fast cross-entropy method for estimating buffer overflows in queueing networks, Manage. Sci., 50 (2004), 883–895. https://doi.org/10.1287/mnsc.1030.0139 doi: 10.1287/mnsc.1030.0139
![]() |
[66] |
J. C. Chan, D. P. Kroese, Improved cross-entropy method for estimation, Stat. Comput., 22 (2012), 1031–1040. https://doi.org/10.1007/s11222-011-9275-7 doi: 10.1007/s11222-011-9275-7
![]() |
[67] |
G. Alon, D. P. Kroese, T. Raviv, R. Y. Rubinstein, Application of the cross-entropy method to the buffer allocation problem in a simulation-based environment, Ann. Oper. Res., 134 (2005), 137–151. https://doi.org/10.1007/s10479-005-5728-8 doi: 10.1007/s10479-005-5728-8
![]() |
[68] |
R. Caballero, A. G. Hernández-Díaz, M. Laguna, J. Molina, Cross entropy for multiobjective combinatorial optimization problems with linear relaxations, Eur. J. Oper. Res., 243 (2015), 362–368. https://doi.org/10.1016/j.ejor.2014.07.046 doi: 10.1016/j.ejor.2014.07.046
![]() |
[69] |
R. Rubinstein, The cross-entropy method for combinatorial and continuous optimization, Methodol. Comput. Appl., 1 (1999), 127–190. https://doi.org/10.1023/A:1010091220143 doi: 10.1023/A:1010091220143
![]() |
[70] |
D. P. Kroese, S. Porotsky, R. Y. Rubinstein, The cross-entropy method for continuous multi-extremal optimization, Methodol. Comput. Appl., 8 (2006), 383–407. https://doi.org/10.1007/s11009-006-9753-0 doi: 10.1007/s11009-006-9753-0
![]() |
[71] |
J. Bekker, C. Aldrich, The cross-entropy method in multi-objective optimisation: An assessment, Eur. J. Oper. Res., 211 (2011), 112–121. https://doi.org/10.1016/j.ejor.2010.10.028 doi: 10.1016/j.ejor.2010.10.028
![]() |
[72] |
K. Chepuri, T. Homem-De-Mello, Solving the vehicle routing problem with stochastic demands using the cross-entropy method, Ann. Oper. Res., 134 (2005), 153–181. https://doi.org/10.1007/s10479-005-5729-7 doi: 10.1007/s10479-005-5729-7
![]() |
[73] |
I. Szita, A. Lörincz, Learning Tetris using the noisy cross-entropy method, Neural Comput., 18 (2006), 2936–2941. https://doi.org/10.1162/neco.2006.18.12.2936 doi: 10.1162/neco.2006.18.12.2936
![]() |
[74] |
M. Laguna, A. Duarte, R. Marti, Hybridizing the cross-entropy method: An application to the max-cut problem, Comput. Oper. Res., 36 (2009), 487–498. https://doi.org/10.1016/j.cor.2007.10.001 doi: 10.1016/j.cor.2007.10.001
![]() |
[75] |
M. Maher, R. Liu, D. Ngoduy, Signal optimization using the cross entropy method, Transport. Res. C: Emer. Technol., 27 (2013), 76–88. https://doi.org/10.1016/j.trc.2011.05.018 doi: 10.1016/j.trc.2011.05.018
![]() |
[76] |
G. R. Lamonica, M. C. Recchioni, F. M. Chelli, L. Salvati, The efficiency of the cross-entropy method when estimating the technical coefficients of input-output tables, Spat. Econ. Anal., 15 (2020), 62–91. https://doi.org/10.1080/17421772.2019.1615634 doi: 10.1080/17421772.2019.1615634
![]() |
[77] |
M. L. Cardoso, L. F. Venturini, Y. L. Baracy, I. M. B. Ulisses, L. E. Bremermann, A. P. Grilo-Pavani, et al., Fault indicator placement optimization using the cross-entropy method and traffic simulation data, Electr. Pow. Syst. Res., 212 (2022), 108391. https://doi.org/10.1016/j.epsr.2022.108391 doi: 10.1016/j.epsr.2022.108391
![]() |
[78] |
A. E. Eiben, C. A. Schipper, On evolutionary exploration and exploitation, Fund. Inform., 35 (1998), 35–50. https://doi.org/10.3233/FI-1998-35123403 doi: 10.3233/FI-1998-35123403
![]() |
[79] |
H. Chen, Z. Wang, D. Wu, H. Jia, C. Wen, H. Rao, et al., An improved multi-strategy beluga whale optimization for global optimization problems, Math. Biosci. Eng., 20 (2023), 13267–13317. https://doi.org/10.3934/mbe.2023592 doi: 10.3934/mbe.2023592
![]() |
[80] |
A. G. Hussien, R. A. Khurma, A. Alzaqebah, M. Amin, F. A. Hashim, Novel memetic of beluga whale optimization with self-adaptive exploration–exploitation balance for global optimization and engineering problems, Soft Comput., 27 (2023), 13951–13989. https://doi.org/10.1007/s00500-023-08468-3 doi: 10.1007/s00500-023-08468-3
![]() |
[81] | N. H. Awad, M. Z. Ali, P. N. Suganthan, J. J. Liang, B. Y. Qu, Problem defnitions and evaluation criteria for the CEC 2017 special session and competition on single objective real-parameter numerical optimization, 2016. Available from: https://github.com/P-N-Suganthan/CEC2017-BoundContrained/blob/master/Definitions%20of%20%20CEC2017%20benchmark%20suite%20final%20version%20updated.pdf. |
[82] | P. Fortune, Are stock returns different over weekends? A jump diffusion analysis of the weekend effect, In: New England Economic Review, 10 (1999), 3–19. https://fedinprint.org/item/fedbne/41360 |
1. | Sha Lin, Xin-Jiang He, Analytically pricing variance and volatility swaps with stochastic volatility, stochastic equilibrium level and regime switching, 2023, 217, 09574174, 119592, 10.1016/j.eswa.2023.119592 | |
2. | Shubin Ou, Guohe Deng, Petr H. Jek, Extremum Options Pricing of Two Assets under a Double Nonaffine Stochastic Volatility Model, 2023, 2023, 1563-5147, 1, 10.1155/2023/1165629 | |
3. | Xu Chen, Xin-Xin Gong, Youfa Sun, Siu-Long Lei, A Preconditioned Policy–Krylov Subspace Method for Fractional Partial Integro-Differential HJB Equations in Finance, 2024, 8, 2504-3110, 316, 10.3390/fractalfract8060316 |