Loading [MathJax]/jax/output/SVG/jax.js
Research article Special Issues

Modified artificial fish swarm algorithm to solve unrelated parallel machine scheduling problem under fuzzy environment

  • Unrelated parallel machine scheduling problem (UPMSP) in a fuzzy environment is an active research area due to the fuzzy nature of most real-world problems. UPMSP is an NP-hard problem; thus, finding optimal solutions is challenging, particularly when multiple objectives need to be considered. Hence, a metaheuristic algorithm based on a modified artificial fish swarm algorithm (AFSA) is presented in this study to minimize the multi-objective makespan and total tardiness. Three modifications were made to the proposed algorithm. First, aspiration behavior was added to AFSA behaviors to increase effectiveness. Second, improved parameters such as step and visual were used to balance global search capability and convergence rate. Finally, a transformation method was injected to make the algorithm suitable for discrete optimization problems such as UPMSP. The proposed algorithm was compared with AFSA and five modified versions of AFSA to verify and measure the algorithm's effectiveness by conducting three different sizes of problems. Afterward, the Wilcoxon signed-rank test was used to statistically evaluate the algorithm's performance. The results indicate that the proposed algorithm significantly outperformed the other algorithms, especially for medium and large-sized problems.

    Citation: Azhar Mahdi Ibadi, Rosshairy Abd Rahman. Modified artificial fish swarm algorithm to solve unrelated parallel machine scheduling problem under fuzzy environment[J]. AIMS Mathematics, 2024, 9(12): 35326-35354. doi: 10.3934/math.20241679

    Related Papers:

    [1] Saravanan Shanmugam, Mohamed Rhaima, Hamza Ghoudi . Exponential synchronization analysis for complex dynamical networks with hybrid delays and uncertainties under given control parameters. AIMS Mathematics, 2023, 8(12): 28976-29007. doi: 10.3934/math.20231484
    [2] Arthit Hongsri, Wajaree Weera, Thongchai Botmart, Prem Junsawang . Novel non-fragile extended dissipative synchronization of T-S fuzzy complex dynamical networks with interval hybrid coupling delays. AIMS Mathematics, 2023, 8(12): 28601-28627. doi: 10.3934/math.20231464
    [3] Changping Dai, Weiyuan Ma, Ling Guo . Synchronization of generalized fractional complex networks with partial subchannel losses. AIMS Mathematics, 2024, 9(3): 7063-7083. doi: 10.3934/math.2024344
    [4] Pratap Anbalagan, Evren Hincal, Raja Ramachandran, Dumitru Baleanu, Jinde Cao, Chuangxia Huang, Michal Niezabitowski . Delay-coupled fractional order complex Cohen-Grossberg neural networks under parameter uncertainty: Synchronization stability criteria. AIMS Mathematics, 2021, 6(3): 2844-2873. doi: 10.3934/math.2021172
    [5] N. Jayanthi, R. Santhakumari, Grienggrai Rajchakit, Nattakan Boonsatit, Anuwat Jirawattanapanit . Cluster synchronization of coupled complex-valued neural networks with leakage and time-varying delays in finite-time. AIMS Mathematics, 2023, 8(1): 2018-2043. doi: 10.3934/math.2023104
    [6] Zhifeng Lu, Fei Wang, Yujuan Tian, Yaping Li . Lag synchronization of complex-valued interval neural networks via distributed delayed impulsive control. AIMS Mathematics, 2023, 8(3): 5502-5521. doi: 10.3934/math.2023277
    [7] Shuang Li, Xiao-mei Wang, Hong-ying Qin, Shou-ming Zhong . Synchronization criteria for neutral-type quaternion-valued neural networks with mixed delays. AIMS Mathematics, 2021, 6(8): 8044-8063. doi: 10.3934/math.2021467
    [8] Li Liu, Yinfang Song, Hong Yu, Gang Zhang . Almost sure exponential synchronization of multilayer complex networks with Markovian switching via aperiodically intermittent discrete observa- tion noise. AIMS Mathematics, 2024, 9(10): 28828-28849. doi: 10.3934/math.20241399
    [9] Jingyang Ran, Tiecheng Zhang . Fixed-time synchronization control of fuzzy inertial neural networks with mismatched parameters and structures. AIMS Mathematics, 2024, 9(11): 31721-31739. doi: 10.3934/math.20241525
    [10] Rongjie Yu, Hengguo Yu, Min Zhao . Steady states and spatiotemporal dynamics of a diffusive predator-prey system with predator harvesting. AIMS Mathematics, 2024, 9(9): 24058-24088. doi: 10.3934/math.20241170
  • Unrelated parallel machine scheduling problem (UPMSP) in a fuzzy environment is an active research area due to the fuzzy nature of most real-world problems. UPMSP is an NP-hard problem; thus, finding optimal solutions is challenging, particularly when multiple objectives need to be considered. Hence, a metaheuristic algorithm based on a modified artificial fish swarm algorithm (AFSA) is presented in this study to minimize the multi-objective makespan and total tardiness. Three modifications were made to the proposed algorithm. First, aspiration behavior was added to AFSA behaviors to increase effectiveness. Second, improved parameters such as step and visual were used to balance global search capability and convergence rate. Finally, a transformation method was injected to make the algorithm suitable for discrete optimization problems such as UPMSP. The proposed algorithm was compared with AFSA and five modified versions of AFSA to verify and measure the algorithm's effectiveness by conducting three different sizes of problems. Afterward, the Wilcoxon signed-rank test was used to statistically evaluate the algorithm's performance. The results indicate that the proposed algorithm significantly outperformed the other algorithms, especially for medium and large-sized problems.



    It is now widely admitted by the scientific community that the increase of the human activity over the last century exerts a high pressure on the equilibrium of ecological systems, which can account for a major defaunation and a fast loss of biodiversity, often qualified as the "sixth extinction" [7,12]. One of the main causes of this biological crisis is the degradation of the ecological environments of wildlife, which takes various forms, in the forefront of which are deforestation and habitat fragmentation [8,10,13]. Facing the challenge of restoring biodiversity, while maintaining human activity at a reasonable level, a carefully considered solution consists in the implementation of ecological corridors between each component of the fragmented environment, so as to increase the connectivity of natural habitats and to avoid local extinction of several wildlife species. For example, the restoration of aquatic ecosystems by maintaining hydrological connectivity with riparian corridors is studied in [15]; different complexity and connectivity patterns are investigated at multiple scales in [21].

    In this paper, our aim is precisely to propose an original mathematical model, in order to study these ecological concerns. Therefore, we consider a network of ecological systems, which is intended to model the complex dynamics of trophic chains in a degraded area. The complex network structure reproduces the heterogeneous natural environment, which is perturbed by fragmentation, by coupling several patches on which interacting wild species are living. On each patch, the ecological inter-species dynamics are modeled by a Lotka-Volterra predator-prey model with Holling type II functional response, which is able to describe several biological dynamics, such as extinction, coexistence or ecological cycles [9,17,19] (see also e.g. [3,18,23,24] for other Lotka-Volterra type models). Next, the complex network is constructed so that each patch can admit its own dynamic. In this way, the local components of the network can for instance exhibit an extinction equilibrium on some places, whereas other places can present cycles. Furthermore, migrations of biological individuals in space, between each component of the fragmented environment, are taken into account by coupling the patches of the network, as schematized in Figure 1, where the disks model the patches of the fragmented habitat, and the arrows model the ecological corridors between these patches.

    Figure 1.  Example of a complex network of predator-prey systems. The disks model the patches of a fragmented environment, where the inter-species dynamics of Lotka-Volterra type occur. The arrows model the ecological corridors which can be implemented between these patches, so as to increase the migrations in space of the species between each patch.

    With this mathematical model in hand, we analyze the effect of the couplings on the local dynamics of each patch. In particular, we investigate the possibility to modify a local dynamic of extinction of the species, by increasing the couplings with patches on which persistence, with or without oscillations, is ensured. More generally, we search for sufficient conditions of synchronization of the local dynamics, under a variation of the couplings, which roughly means that a unique local dynamic is imposed on each patch. On this point, we establish a novel theorem of near-synchronization, which guarantees that the complex network remains in a neighborhood of a synchronization state, provided the coupling strength is strong enough, even if the local behaviors are non-identical.

    Our choice to model the dynamics of interacting species living in a fragmented environment by a complex network structure follows a line of recent works. Indeed, synchronization in complex networks has been studied in a great number of papers, for various real-world applications, among them coupled oscillators, networks of chemical reactions, neural networks or meta-populations models (see for instance [1,2,5,14] and the references therein). Recently, complex networks of Lotka-Volterra models have been studied in [6]; however, the sufficient conditions of synchronization which have been established in this paper, correspond only to the particular case of identical dynamics. This state of the art highlights the main contributions of the present paper: it is the first time, at our knowledge, that a near-synchronization result for complex networks of non-identical systems is established at a theoretical level.

    Our paper is organized as follows. In the next Section, we show how to construct a complex network of predator-prey systems, stemming from a Lotka-Volterra model embedded with a Holling type II functional response. In Section 3, we establish our main theoretical result, with Theorem 2, which establishes sufficient conditions of near-synchronization in a network of non-identical systems. Finally, in Section 4, we illustrate our theoretical statements by relevant numerical simulations.

    In this section, we present the construction of a complex network of Lotka-Volterra systems, which describes the dynamics of interacting species living in a fragmented environment.

    Let us consider a biological environment in which two species interact. We assume that the densities of the species are determined by a predator-prey model of Lotka-Volterra type, which can be written by:

    {˙x=rx(1x)cxyα+x,˙y=dy+cxyα+x. (2.1)

    Here, x and y denote the prey and predator density, respectively; ˙x and ˙y denote their derivatives with respect to the time variable t. The parameters r, c, d and α are positive coefficients; r is the birth rate of the preys, d is the mortality rate of predators, and c, α determine the non-linear interaction between preys and predators. As mentioned in our introduction, the dynamics of the predator-prey system (2.1) have been widely studied (see for instance [11]). Depending on the values of the parameters r, c, d, α, the solutions of system (2.1) can be attracted to a coexistence equilibrium, to an extinction equilibrium or to a limit cycle. The extinction equilibrium is denoted E0=(0,0). Under the parameter conditions c>d and α<cdd, system (2.1) admits a coexistence equilibrium E1, which implies persistence of each species, given by

    E1=(αdcd,rαcd(1αdcd)). (2.2)

    System (2.1) also admits the equilibrium E2=(1,0). Let us introduce the critical value α0 given by

    α0=cdc+d. (2.3)

    It is well-known (see for instance [11], Chapter 3 or [4], Section 3.4.1) that system (2.1) undergoes a Hopf bifurcation at α=α0. For α<α0, a stable limit cycle bifurcates from the persistence equilibrium E1. This Hopf bifurcation is illustrated in Figure 2. Therefore, for α small enough, system (2.1) presents oscillations, which are interpreted as healthy ecological cycles.

    Figure 2.  Hopf bifurcation occurring in the predator-prey model (2.1) when α crosses the critical value α0=cdc+d. For α>α0, the orbits converge to a stable focus. For α<α0, the system admits a stable limit cycle.

    Next, we assume that the geographical habitat of the species is perturbed by the anthropic extension, so that it is fragmented in several patches. This fragmentation is likely to alter the equilibrium of the ecological system. In order to model such a fragmented environment, we construct a complex network of predator-prey models as follows.

    First, let n>0 denote the number of patches on the fragmented environment. On each patch i{1,,n}, we denote by (xi,yi) the densities of preys and predators respectively. We assume that each patch i{1,,n} can be connected to other patches and we denote by Ni{1,,n} the set of patches which are connected to patch i. We assume that migrations of biological individuals can occur between two connected patches, at rates σ1 for preys and σ2 for predators. In this way, the dynamics of the fragmented environment are determined by the following complex network:

    {˙xi=rixi(1xi)cixiyiαi+xiσ1jNi(xixj),˙yi=diyi+cixiyiαi+xiσ2jNi(yiyj), (2.4)

    for 1in, with σ10 and σ20. Note that the index i ranges over the set {1,,n}, whereas the subscript j, in the two sums which determine the couplings of the network, ranges of the set Ni of the neighbors of i.

    We emphasize that the parameters ri, ci, di, αi can differ from one patch to another, which means that the ecological dynamics are non-identical within the fragmented environment. For instance, some patches could present limit cycles, whereas other patches could exhibit an extinction of both species. Note also that the couplings are symmetric, which means that if the species xi, yi of patch i can move towards some patch j, then the species xj, yj of patch j can conversely move towards patch i.

    One remarkable case of fragmented environment is that of a complete graph topology, for which we have Ni={1,,n}{i}; this situation means that each patch is connected to all other patches. At the opposite, if the coupling parameters σ1, σ2 are equal to 0, then no migration of individuals occur in the network.

    Let us now introduce some notations. Let X=((x1,y1),,(xn,yn))R2n. For each i{1,,n}, we denote

    λi=(ri,ci,di,αi)R4,f1(xi,yi,λi)=rixi(1xi)cixiyiαi+xi,f2(xi,yi,λi)=diyi+cixiyiαi+xi,g1(xi,X,σ1)=σ1jNi(xixj),g2(yi,X,σ2)=σ2jNi(yiyj). (2.5)

    We also denote σ=(σ1,σ2)R2 and

    Λ=(λ1,,λn)R4n,F(X,Λ)=(f1(x1,y1,λ1),f2(x1,y1,λ1),,f1(xn,yn,λn),f2(xn,yn,λn))R2n,G(X,σ)=(g1(x1,X,σ1),g2(y1,X,σ2),,g1(xn,X,σ1),g2(yn,X,σ2))R2n. (2.6)

    With these notations, the complex network (2.4) can be written under the following short form

    ˙X=F(X,Λ)+G(X,σ). (2.7)

    Our first result guarantees that the complex network (2.7) admits global solutions, whose components are non-negative and bounded.

    Theorem 1. Let X0(R+)2n. Then the complex network problem determined by equation (2.7) and X(0)=X0 admits a unique global solution X(t,X0) defined on [0,+), whose components are non-negative.

    Furthermore, the flow induced by equation (2.7) admits a positively invariant region Θ which is compact in (R+)2n.

    Before giving the proof of Theorem 1, we recall a Gronwall type inequality, whose proof can be found in [22] for instance.

    Lemma 1. Let v denote a continuously differentiable function defined on [0,T], with T>0. Assume that v satisfies

    ˙v(t)+δv(t)γ,

    for all t[0,T], with δ>0 and γ>0. Then we have

    v(t)[v(0)γδ]eδt+γδ,t[0,T].

    We continue with the proof of Theorem 1.

    Proof of Theorem 1. Let X0(R+)2n. Standard results of the theory of differential equations (see for instance [16]) guaranty that the Cauchy problem determined by equation (2.7) and the initial condition X(0)=X0 admits a unique local solution, which we denote X(t,X0), defined on [0,T], with T>0.

    Let us now prove that the components of the local solution X(t,X0) are non-negative on [0,T]. First, we recall that the initial condition X0 belongs to (R+)2n. Next, we observe that the equations of system (2.4) can be rewritten

    {˙xi=xiϕ1(xi,yi)+σ1jNixj,˙yi=yiϕ2(x,i,yi)+σ2jNiyj,

    with 1in and

    ϕ1(xi,yi)=xi(1xi)ciyiαi+xiσ1|Ni|,ϕ2(xi,yi)=diyi+ciyiαi+xiσ2|Ni|,

    where |Ni| denotes the cardinal of the finite set Ni. Hence, by virtue of Proposition A.17 in [20], the components (xi,yi)1in satisfy xi(t)0, yi(t)0, for t[0,T].

    Finally, let us prove that the flow induced by equation (2.7) admits a positively invariant region Θ, which is compact in (R+)2n; as a consequence, every local solution X(t,X0) will be global in time. We first remark that for each i{1,,n}, positive coefficients ai, bi can be found such that

    ris(1s)aibis,

    for all sR. Afterwards, we introduce

    d0=min1indi,a0=ni=1ai,b0=min1inbi,c0=min(b0,d0), (2.8)

    and we denote by P the total population of preys and predators in the complex network:

    P(t)=ni=1[xi(t)+yi(t)],t[0,T]. (2.9)

    Since the couplings are symmetric, the sum over i{1,,n} of all equations of system (2.4) leads to

    ˙P(t)=ni=1rixi(t)[1xi(t)]ni=1diyi(t).

    Next, we write

    ni=1diyi(t)d0ni=1yi(t),

    and analogously

    ni=1rixi(t)[1xi(t)]ni=1[aibixi(t)]a0b0ni=1xi(t).

    We obtain

    ˙P(t)+c0P(t)a0.

    Applying Lemma 1 leads to

    P(t)[P(0)a0c0]ec0t+a0c0,

    which implies that the region Θ defined by

    Θ={X=(xi,yi)1in(R+)2n;ni=1(xi+yi)a0c0} (2.10)

    is a positively invariant and compact region. The proof is complete.

    Remark 1. It is worth emphasizing that the bound a0c0 of the positively invariant region Θ defined by (2.10) does not depend on the coupling parameters σ1, σ2. This uniform bound will be of great interest in Section 3 for studying the global dynamics of the complex network (2.7).

    Now that the solutions of the complex network (2.7) are proved to be well defined and global in time, we give the definition of synchronization.

    Definition 1. Let i,j{1,,n} such that ij. We say that the patches i and j of the complex network (2.7) synchronize in Θ if, for any initial condition X0Θ, the solution of (2.7) starting from X0 satisfies

    limt+(|xi(t)xj(t)|2+|yi(t)yj(t)|2)=0.

    We say that the complex network (2.7) synchronizes in Θ if every pair (i,j) of patches synchronizes in Θ.

    Remark 2. Note that synchronization can occur in the complex network (2.7) without imposing any particular asymptotic dynamics; for example, the complex network could synchronize towards a global dynamic of extinction, towards a global dynamic of coexistence, or towards a global dynamic of limit cycles (it could even happen that a new dynamic emerges from the complex network structure). We will establish in Section 3 sufficient conditions of synchronization and discover that a complex network of non-identical instances of the predator-prey model (2.1) is likely not to fully synchronize.

    In this section, we search for sufficient conditions of synchronization in the complex network (2.7). In a great number of papers, sufficient conditions of synchronization are established in the case of complex networks of identical systems. Here, we investigate the case of non-identical systems. We prove a novel theorem which shows that a complex network of non-identical systems can reach a near-synchronization state. For the sake of simplicity, we assume that the graph underlying the complex network (2.7) is complete, that is, each patch is connected to all other patches; equivalently, we have Ni={1,,n}{i} for 1in, where Ni denotes the finite set of patches which are connected to patch i. For all i,j{1,,n}, we introduce the energy functions ui,j defined along the trajectories of the complex network by

    ui,j(t)=12[|xi(t)xj(t)|2+|yi(t)yj(t)|2], (3.1)

    and for λi=(ri,di,ci,αi),λj=(rj,dj,cj,αj)R4, we denote

    λiλj=max{|rirj|,|didj|,|cicj|,|αiαj|}.

    The next theorem establishes an estimate of the energy functions ui,j defined by (3.1).

    Theorem 2. There exist positive constants η, δ such that, for any initial condition X0Θ, the solution of the complex network (2.7), starting from X0, satisfies

    ˙ui,j(t)ηλiλju1/2i,j(t)+[δ2(n1)˜σ]ui,j(t),t>0, (3.2)

    where ˜σ=min{σ1,σ2}.

    Furthermore, the constants η and δ do not depend on the coupling parameters σ1, σ2.

    We begin with a technical lemma.

    Lemma 2. There exist positive constants kr, 1r6, such that the functions f1 and f2 defined in (2.5) satisfy

    |f1(xi,yi,λi)f1(xj,yj,λj)|k1λiλj+k2|xixj|+k3|yiyj|,|f2(xi,yi,λi)f2(xj,yj,λj)|k4λiλj+k5|xixj|+k6|yiyj|, (3.3)

    for all (xi,yi)1in, in the invariant region Θ defined by (2.10) and for all i,j{1,,n}.

    Furthermore, the constants kr, 1r6, do not depend on the coupling parameters σ1, σ2.

    Proof of Lemma 2. Since (xi,yi)1in belongs to the invariant region Θ defined by (2.10), there exists a positive constant K such that

    |xi|K,|yi|K,

    for all i{1,,n}.

    In order to establish the estimates (3.3), we first write

    |diyidjyj||diyidiyj|+|diyjdjyj|,

    which leads to

    |diyidjyj|d+|yiyj|+K|didj|, (3.4)

    where d+=max1indi. Similarly, we have

    |rixi(1xi)rjxj(1xj)||rixi(1xi)rixj(1xj)|+|rixj(1xj)rjxj(1xj)|ri|xi(1xi)xj(1xj)|+K(1+K)|rirj|.

    Now we write

    |xi(1xi)xj(1xj)||xixj|+|x2ix2j||xixj|+|xi+xj|×|xixj|(1+2K)|xixj|,

    from which it follows that

    |rixi(1xi)rjxj(1xj)|r+(1+2K)|xixj|+K(1+K)|rirj|, (3.5)

    where r+=max1inri. Finally, we compute

    |cixiyiαi+xicjxjyjαj+xj||(αj+xj)cixiyi(αi+xi)cjxjyj)(αi+xi)(αj+xj)|1αiαj[|αjcixiyiαicjxjyj|+|cixixjyicjxixjyj|].

    For the first term in the brackets, we write

    |αjcixiyiαicjxjyj||αjcixiyiαjcixjyj|+|αjcixjyjαicjxjyj|αjci|xiyixjyj|+K2|αjciαicj|αjci|xiyixiyj|+αjci|xiyjxjyj|+K2|αjciαicj|αjciK(|yiyj|+|xixj|)+K2αj|cicj|+K2cj|αiαj|.

    For the second term in the brackets, we have

    |cixixjyicjxixjyj||cixixjyicixixjyj|+|cixixjyjcjxixjyj|ciK2|yiyj|+K3|cicj|,

    which leads to

    |cixiyiαi+xicjxjyjαj+xj|α+c+K(α)2|xixj|+a+c+K+c+K2(α)2|yiyj|+K2α++K3(α)2|cicj|+c+K2(α)2|αiαj|, (3.6)

    where α+=max1inαi, c+=max1inci and α=min1inαi.

    Gathering inequalities (3.5) and (3.6) leads to

    |f1(xi,yi,λi)f1(xj,yj,λj)|k1λiλj+k2|xixj|+k3|yiyj|,

    whereas gathering inequalities (3.4) and (3.6) leads to

    |f2(xi,yi,λi)f2(xj,yj,λj)|k4λiλj+k5|xixj|+k6|yiyj|,

    with positive constants kr, 1r6, which do not depend on σ neither on the number n of patches in the network. The proof of Lemma 2 is complete.

    We continue with the proof of Theorem 2.

    Proof of Theorem 2. We compute the derivative of ui,j(t) along a trajectory (xi(t),yi(t))1in of the complex network (2.7), starting from an initial condition (xi,0,yi,0)1inΘ. In order to lighten our notations, we omit the time dependence:

    ˙ui,j=(xixj)(˙xi˙xj)+(yiyj)(˙yi˙yj)=(xixj)[f1(xi,yi,λi)σ1ki(xixk)f1(xj,yj,λj)+σ1kj(xjxk)]+(yiyj)[f2(xi,yi,λi)σ2ki(yiyk)f2(xj,yj,λj)+σ2kj(yjyk)].

    Now, we observe that

    σ1ki(xixk)σ1kj(xjxk)=σ1(n1)(xixj),σ2ki(yiyk)σ2kj(yjyk)=σ2(n1)(yiyj).

    By virtue of Lemma 2, we obtain

    ˙ui,j|xixj||k1λiλj+k2|xixj|+k3|yiyj||σ1(n1)(xixj)2+|yiyj||k4λiλj+k5|xixj|+k6|yiyj||σ2(n1)(yiyj)2max{k1,k4}λiλj×[|xixj|+|yiyj|]+[k2σ1(n1)]|xixj|2+[k6σ2(n1)]|yiyj|2+(k3+k5)|xixj|×|yiyj|.

    Next, we use the standard inequality a+b2×a2+b2, which is valid for all a,bR+, to write

    |xixj|+|yiyj|2|xixj|2+|yiyj|22ui,j,

    thus we have

    max{k1,k4}λiλj×[|xixj|+|yiyj|]ηλiλju1/2i,j,

    with η=2×max{k1,k4}. In parallel, the Young inequality a×ba22+b22 yields

    |xixj|×|yiyj||xixj|22+|yiyj|22ui,j.

    Finally, we set δ=2max{k2,k6}+k3+k5 and obtain

    ˙ui,jηλiλju1/2i,j+[δ2(n1)˜σ]ui,j,

    which completes the proof of Theorem 2.

    Let us now discuss on some consequences of Theorem 2. We observe that estimate (3.2) is a differential inequality, which implies that for all i,j{1,,n}, the energy function ui,j is bounded by the solution w of the Bernoulli equation

    ˙w=ηλiλjw1/2+[δ2(n1)˜σ]w. (3.7)

    If λi=λj, the latter differential equation can be simplified, so that estimate (3.2) becomes

    ˙ui,j(t)[δ2(n1)˜σ]ui,j(t),

    which directly yields the following corollary.

    Corollary 1. Assume that λi=λj for some i,j{1,,n}. Then the patches i and j synchronize if the following condition is fulfilled:

    (n1)˜σ>δ. (3.8)

    If λi=λj for all i,j{1,,n}, then obviously the whole network synchronizes under condition (3.8). Next, since the constant δ does not depend on the coupling parameters σ1, σ2, the sufficient condition (3.8) can easily be satisfied, provided the number n of patches in the network is sufficiently large, or provided the minimum coupling strength ˜σ=min{σ1,σ2} is sufficiently large.

    From the ecological point of view, increasing the number n of patches in the network would correspond to a worse fragmentation of the habitat, which is not a reasonable strategy for our purposes. However, increasing the minimum coupling strength ˜σ can be realized by providing wider ecological corridors.

    The non trivial case of Theorem 2 corresponds to a complex network of non-identical patches, for which we have λiλj for at least one pair (i,j){1,,n}2. In that case, the synchronization state {(xi,yi)=(xj,yj)} is likely to present a soft loss of stability. Indeed, it is well-known that the solution w of the Bernoulli equation (3.7) converges towards a positive limit given by

    limt+w(t)=(ηλiλjδ(n1)˜σ)2,

    provided w(0)>0. We obtain the following corollary.

    Corollary 2. The energy function ui,j defined by (3.1), along with the solution of the complex network (2.7) starting, from X0Θ, satisfies

    0lim supui,j(t)(ηλiλjδ(n1)˜σ)2. (3.9)

    Finally, since the constants η and δ do not depend on the coupling parameters σ1, σ2, then a sufficiently large value of the minimum coupling strength ˜σ ensures that any neighborhood of the synchronization state {(xi,yi)=(xj,yj)} can be reached, which justifies the expression near-synchronization. This remark can be formalized by the following definition.

    Definition 2. Let i,j{1,,n} such that ij. We say that the patches i and j of the complex network (2.7) nearly synchronize in Θ with respect to ˜σ if, for any initial condition X0Θ, and for any ε>0, the solution of (2.7) starting from X0 satisfies

    0limt+(|xi(t)xj(t)|2+|yi(t)yj(t)|2)<ε,

    for ˜σ sufficiently large.

    We say that the complex network (2.7) nearly synchronizes in Θ if every pair (i,j) of patches nearly synchronizes in Θ.

    The discussion above can now be formulated as follows.

    Corollary 3. The complex network (2.7) nearly synchronizes in Θ with respect to the minimum coupling strength ˜σ.

    The latter corollary means that a sufficiently large minimal coupling strength ˜σ ensures that the dynamics of each patch of the complex network (2.4) will be almost identical. Furthermore, by virtue of (3.9), if the minimal coupling strength ˜σ increases, or if the number of patches n increases, then the near-synchronization state is getting closer to a synchronization state. In other words, ˜σ and n can be viewed as parameters to control the level of near-synchronization in the network.

    In this section, we provide two examples that illustrate the near-synchronization pattern of a complex network, under the effect of the couplings. We consider networks with two and ten patches, with different coupling strengths, so as to highlight various emergent dynamics. For the sake of simplicity, we assume that σ1=σ2 and write σ instead of σ1, σ2. Our complete computation codes are provided in the Appendix.

    We start by showing the effect of the coupling in a simple two-patches network. Although it may appear simple, the case of a two-patches network is fundamental, since it models a natural habitat which is divided by a single obstacle. Notably, the construction of a single road crossing a forest ecosystem exerts a high perturbation on the biodiversity hosted by this environment. Similarly, the establishment of a single river barrier or of a single maritime dyke profoundly modifies the behavior of a water hosted ecosystem.

    Therefore, we consider the system given by

    {˙x1=r1x1(1x1)c1x1y1α1+x1σ(x1x2),˙y1=d1y1+c1x1y1α1+x1σ(y1y2),˙x2=r2x2(1x2)c2x2y2α2+x2σ(x2x1),˙y2=d2y2+c2x2y2α2+x2σ(y2y1), (4.1)

    with the parameter values from Table 1 and σ>0. On patch 1, the parameters are chosen so that the system converges to a coexistence steady state (α=0.5) or to a limit cycle (α=0.05): the birth rate r1 of preys and the death rate d1 of predators are of the same order; in both cases, extinction is avoided. On patch 2, the parameters are chosen so that the system converges to the extinction state (it suffices to decrease the birth rate of preys: r1=0.2).

    Table 1.  Parameter values for the two patches network given by system (4.1).
    Patch 1 Patch 2
    Parameter Value Parameter Value
    r1 1 r2 0.2
    d1 1 d2 1
    c1 2 c2 3
    α1 0.5 or 0.05 α2 0.05

     | Show Table
    DownLoad: CSV

    The initial conditions are defined by

    (x1(0),y1(0))=(0.3,0.2),(x2(0),y2(0))=(0.5,0.3).

    We show in Figure 3 the corresponding orbits of the two-patches complex network (4.1), in absence of coupling (σ=0), and in Figure 4 the orbits for a positive coupling strength (σ=0.3); two cases are investigated: in the first case, we have α1=0.5, whereas in the second case, we have α1=0.05. Let us discuss the numerical results in regard of Theorem 2.

    Figure 3.  Orbits of the two-patches network (4.1) in absence of coupling. (a) For σ=0 and α1=0.5, the orbit (x1,y1) of the first patch is attracted to a persistence equilibrium, while the orbit (x2,y2) of the second patch is attracted to the extinction equilibrium. (b) For σ=0 and α1=0.05, the orbit of the second patch is the same, but the orbit (x1,y1) of the first patch is now attracted to a limit cycle.
    Figure 4.  Orbits of the two-patches network (4.1) with a positive coupling strength. (a) For σ=0.3 and α1=0.5, the two patches nearly synchronize towards a persistence equilibrium. (b) For σ=0.3 and α1=0.05, the two patches nearly synchronize towards a limit cycle corresponding to ecological oscillations.

    For σ=0 and α1=0.5 (Figure 3(a)), the orbit (x1,y1) of the first patch is attracted to a persistence equilibrium, while the orbit (x2,y2) of the second patch is attracted to the extinction equilibrium. For σ=0 and α1=0.05 (Figure 3(b)), the orbit of the second patch is the same, but the orbit (x1,y1) of the first patch is now attracted to a limit cycle. We can predict, by virtue of Theorem 2, that the two-patches network will present a near-synchronization dynamic if the coupling strength σ is sufficiently large. However, we aim to describe the common dynamic which is reached under this near-synchronization pattern. Indeed, for σ=0.3, Figure 4 shows that the near-synchronization can hide various emergent dynamics that might occur. For σ=0.3 and α1=0.5 (Figure 4(a)), the two patches nearly synchronize towards a persistence equilibrium, whereas for σ=0.3 and α1=0.05 (Figure 4(b)), the two patches nearly synchronize towards a limit cycle. In both cases, the dynamics are obviously modified: the level of persistence is decreased on patch 1 for α1=0.5 (Figure 4(a)), as well as the amplitude of the oscillations on patch 1 for α1=0.05 (Figure 4(b)); however, the extinction on patch 2 is avoided. Overall, these results that show the good health of the ecosystem (persistence or ecological oscillations) can be recovered by the setting of a strong connection between the patches of the fragmented habitat.

    Finally, we aim to experiment an increase of the number n of patches in the network. Therefore, we consider a ten-patches network with a complete graph topology; we choose randomly a set of parameters for each patch, such that

    0ri1,0di1,0ci3,0.01αi0.41,

    for each i{1,2,,10}; the initial conditions are also chosen randomly in the interval [0.1,0.6]. In this way, the patches of the complex network exhibit various local dynamics in absence of coupling. The corresponding orbits are show in Figure 5; the corresponding time series are also provided in Figure 6. For instance, the orbit (x3,y3) of patch 3 is attracted to a limit cycle; the orbit (x4,y4) of patch 4 converges to the equilibrium E2(1,0) (persistence of the preys and extinction of the predators); the orbit (x6,y6) of patch 6 converges to the extinction equilibrium.

    Figure 5.  Local dynamics in a ten-patches network in absence of coupling (σ=0). The orbits of patches 1,2,3,5,9,10 are attracted to a limit cycle; the orbits of patches 4,7 converge to the equilibrium E2(1,0) (persistence of the preys and extinction of the predators); the orbit of patch 6 converges to the extinction equilibrium.
    Figure 6.  Time series of a ten-patches network in absence of coupling (σ=0). Depending on the values of the parameters, the solutions are attracted to a limit cycle, to the equilibrium E2(1,0) (persistence of the preys and extinction of the predators) or to the extinction equilibrium.

    We depict in Figure 7 the orbits of the same ten-patches complex network, with a relatively large coupling strength (σ=1); the corresponding time series are again provided in Figure 8. According to Theorem 2, we observe that the orbits nearly synchronize. The coupling strength is large enough to ensure that the near-synchronization is very closed to a synchronization state. Furthermore, the near-synchronization is characterized by a limit cycle; the amplitude of that limit cycle can slightly vary from one patch to another (for instance, y7 is less than 0.7, while y8 reaches 0.8).

    Figure 7.  Near-synchronization in a ten-patches network with a relatively large coupling strength (σ=1). The non-identical dynamics are nearly synchronized towards a limit cycle.
    Figure 8.  Time series of a ten-patches network with a relatively large coupling strength (σ=1), showing the near-synchronization of the local dynamics.

    From the ecological point of view, these results show again that healthy biological oscillations can be recovered by the setting of numerous and efficient connections between the patches of a fragmented environment.

    In this paper, we proposed a complex network to model a heterogeneous geographical habitat of species which is perturbed by an anthropic extension, being fragmented in several patches, where the fragmentation is likely to alter the equilibrium of the ecological system. The complex network was constructed by coupling several patches on which interacting wild species are living and where, for each patch, the ecological inter-species dynamics were modeled by a Lotka-Volterra predator-prey model with Holling type II functional response. An important feature of the complex network is that each patch can admit its own dynamic and migrations of biological individuals in space, between each component of the fragmented environment, are taken into account by coupling the patches of the network. We proved new sufficient conditions for the near-synchronization of the complex network, which guarantees that the complex network remains in a neighborhood of a synchronization state, provided the coupling strength is strong enough, even if the local behaviors are non-identical. This result allows us to modify the local dynamic of extinction of the species, by increasing the couplings with patches on which persistence, with or without oscillations, is ensured.

    When proving the sufficient conditions of synchronization, we discovered that a complex network of non-identical instances of the predator-prey model (2.1) is likely not to fully synchronize. This feature motivates the setting of an optimal control problem, so as to exert a command on the dynamics of the complex network (2.7) and to reach a synchronization state, even in the case of non-identical patches. As future work, we intend to apply optimal control theory to remedy the default of synchronization, where the coupling strengths will be represented by external controls acting on the dynamics of the network.

    Another interesting research perspective corresponds to the fact that the dispersion of the species from one patch to another could be modeled at a refined level by adding time delays in the coupling terms; in particular, it will be natural to investigate the impact of time delays on the near synchronization dynamic that we have established in the present paper.

    This work was partially supported by Portuguese funds through CIDMA, The Center for Research and Development in Mathematics and Applications of University of Aveiro, and the Portuguese Foundation for Science and Technology (FCT–Fundação para a Ciência e a Tecnologia), within project UIDB/04106/2020. Silva was also supported by the FCT Researcher Program CEEC Individual 2018 with reference CEECIND/00564/2018.

    All authors declare no conflicts of interest in this paper.

    In this appendix, we provide the computation codes of our numerical simulations. These codes are written in Python3 and require the scientific libraries matplotlib, numpy and scipy.

    Computation code for a two-patches network

    #!/usr/bin/env python3
    # Scientific libraries
    from matplotlib import pyplot as plt
    import numpy as np
    from scipy.integrate import odeint
    from random import random
    # Parameters
    r1 = 1; d1 = 1; c1 = 2; alpha1 = 0.05 # or 0.5
    sigma = 0.3 # or 0
    r2 = 0.2; d2 = 1; c2 = 3; alpha2 = 0.05
    def lotka(X, t):
    x1, y1, x2, y2 = X
    dx1 = r1*x1*(1-x1) - c1*x1*y1/(alpha1+x1) - sigma*(x1-x2)
    dy1 = -d1*y1 + c1*x1*y1/(alpha1+x1) - sigma*(y1-y2)
    dx2 = r2*x2*(1-x2) - c2*x2*y2/(alpha2+x2) + sigma*(x1-x2)
    dy2 = -d2*y2 + c2*x2*y2/(alpha2+x2) + sigma*(y1-y2)
    return [dx1, dy1, dx2, dy2]
    # Phase portrait
    time = np.arange(0, 50, 0.01)
    plt.figure()
    x10 = 0.3; y10 = 0.2; x20 = 0.5; y20 = 0.3
    orbit = odeint(lotka, [x10, y10, x20, y20], time)
    x1, y1, x2, y2 = orbit.T
    plt.plot(x1, y1, 'b', lw = 0.5)
    plt.plot(x2, y2, 'r', lw = 1)
    plt.show()

    Computation code for a ten-patches network

    #!/usr/bin/env python3
    # Scientific libraries
    from matplotlib import pyplot as plt
    import numpy as np
    from scipy.integrate import odeint
    from random import random
    # Parameters
    r1 = random(); d1 = random(); c1 = 3*random(); alpha1 = 0.01 + 0.4*random()
    r2 = random(); d2 = random(); c2 = 3*random(); alpha2 = 0.01 + 0.4*random()
    r3 = random(); d3 = random(); c3 = 3*random(); alpha3 = 0.01 + 0.4*random()
    r4 = random(); d4 = random(); c4 = 3*random(); alpha4 = 0.01 + 0.4*random()
    r5 = random(); d5 = random(); c5 = 3*random(); alpha5 = 0.01 + 0.4*random()
    r6 = random(); d6 = random(); c6 = 3*random(); alpha6 = 0.01 + 0.4*random()
    r7 = random(); d7 = random(); c7 = 3*random(); alpha7 = 0.01 + 0.4*random()
    r8 = random(); d8 = random(); c8 = 3*random(); alpha8 = 0.01 + 0.4*random()
    r9 = random(); d9 = random(); c9 = 3*random(); alpha9 = 0.01 + 0.4*random()
    r10 = random(); d10 = random(); c10 = 3*random(); alpha10 = 0.01 + 0.4*random()
    def lotka(X, t):
    x1, y1, x2, y2, x3, y3, x4, y4, x5, y5, x6, y6, x7, y7, x8, y8, x9, y9, x10, y10 = X
    dx1 = r1*x1*(1-x1) - c1*x1*y1/(alpha1+x1) - sigma*(9*x1-x2-x3-x4-x5-x6-x7-x8-x9-x10)
    dy1 = -d1*y1 + c1*x1*y1/(alpha1+x1) - sigma*(9*y1-y2-y3-y4-y5-y6-y7-y8-y9-y10)
    dx2 = r2*x2*(1-x2) - c2*x2*y2/(alpha2+x2) - sigma*(9*x2-x1-x3-x4-x5-x6-x7-x8-x9-x10)
    dy2 = -d2*y2 + c2*x2*y2/(alpha2+x2) - sigma*(9*y2-y1-y3-y4-y5-y6-y7-y8-y9-y10)
    dx3 = r3*x3*(1-x3) - c3*x3*y3/(alpha3+x3) - sigma*(9*x3-x1-x2-x4-x5-x6-x7-x8-x9-x10)
    dy3 = -d3*y3 + c3*x3*y3/(alpha3+x3) - sigma*(9*y3-y2-y1-y4-y5-y6-y7-y8-y9-y10)
    dx4 = r4*x4*(1-x4) - c4*x4*y4/(alpha4+x4) - sigma*(9*x4-x1-x2-x3-x5-x6-x7-x8-x9-x10)
    dy4 = -d4*y4 + c4*x4*y4/(alpha4+x4) - sigma*(9*y4-y2-y3-y1-y5-y6-y7-y8-y9-y10)
    dx5 = r5*x5*(1-x5) - c5*x5*y5/(alpha5+x5) - sigma*(9*x5-x2-x3-x4-x1-x6-x7-x8-x9-x10)
    dy5 = -d5*y5 + c5*x5*y5/(alpha5+x5) - sigma*(9*y5-y2-y3-y4-y1-y6-y7-y8-y9-y10)
    dx6 = r6*x6*(1-x6) - c6*x6*y6/(alpha6+x6) - sigma*(9*x6-x2-x3-x4-x5-x1-x7-x8-x9-x10)
    dy6 = -d6*y6 + c6*x6*y6/(alpha6+x6) - sigma*(9*y6-y2-y3-y4-y5-y1-y7-y8-y9-y10)
    dx7 = r7*x7*(1-x7) - c7*x7*y7/(alpha7+x7) - sigma*(9*x7-x2-x3-x4-x5-x6-x1-x8-x9-x10)
    dy7 = -d7*y7 + c7*x7*y7/(alpha7+x7) - sigma*(9*y7-y2-y3-y4-y5-y6-y1-y8-y9-y10)
    dx8 = r8*x8*(1-x8) - c8*x8*y8/(alpha8+x8) - sigma*(9*x8-x2-x3-x4-x5-x6-x7-x1-x9-x10)
    dy8 = -d8*y8 + c8*x8*y8/(alpha8+x8) - sigma*(9*y8-y2-y3-y4-y5-y6-y7-y1-y9-y10)
    dx9 = r9*x9*(1-x9) - c9*x9*y9/(alpha9+x9) - sigma*(9*x9-x2-x3-x4-x5-x6-x7-x8-x1-x10)
    dy9 = -d9*y9 + c9*x9*y9/(alpha9+x9) - sigma*(9*y9-y2-y3-y4-y5-y6-y7-y8-y1-y10)
    dx10 = r10*x10*(1-x10) - c10*x10*y10/(alpha10+x10) - sigma*(9*x10-x2-x3-x4-x5-x6-x7-x8-x9-x1)
    dy10 = -d10*y10 + c10*x10*y10/(alpha10+x10) - sigma*(9*y10-y2-y3-y4-y5-y6-y7-y8-y9-y1)
    return [dx1, dy1, dx2, dy2, dx3, dy3, dx4, dy4, dx5, dy5,
    dx6, dy6, dx7, dy7, dx8, dy8, dx9, dy9, dx10, dy10]
    # Phase portrait
    time = np.arange(0,200, 0.01)
    plt.figure()
    X0 = [0.1 + 0.5*random() for k in range(20)]
    sigma = 0 # or 1
    orbit = odeint(lotka, X0, time)
    x1, y1, x2, y2, x3, y3, x4, y4, x5, y5, x6, y6, x7, y7, x8, y8, x9, y9, x10, y10 = orbit.T
    plt.plot(x1, y1)
    plt.plot(x2, y2)
    plt.plot(x3, y3)
    plt.plot(x4, y4)
    plt.plot(x5, y5)
    plt.plot(x6, y6)
    plt.plot(x7, y7)
    plt.plot(x8, y8)
    plt.plot(x9, y9)
    plt.plot(x10, y10)
    plt.show()



    [1] K. Salimifard, D. Mohammadi, R. Moghdani, A. Abbasizad, Green fuzzy parallel machine scheduling with sequence-dependent setup in the plastic moulding industry, Asian J. Manag. Sci. Appl., 4 (2019), 27–48. https://doi.org/10.1504/AJMSA.2019.101423 doi: 10.1504/AJMSA.2019.101423
    [2] M. R. Garey, D. S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, Freeman, San Francisco, (1979). https://doi.org/10.1137/1024022
    [3] A. E. Ezugwu, A. K. Shukla, R. Nath, A. A. Akinyelu, J. O. Agushaka, H. Chiroma, et al., Metaheuristics: A comprehensive overview and classification along with bibliometric analysis. Artif. Intell. Rev., 54 (2021), 4237–4316. https://doi.org/10.1007/s10462-020-0952-0 doi: 10.1007/s10462-020-0952-0
    [4] D. Y. Lin, T. Y. Huang, A hybrid metaheuristic for the unrelated parallel machine scheduling problem, Mathematics, 9 (2021). 1–20. https://doi.org/10.3390/math9070768
    [5] A. E. Ezugwu, F. Akutsah, An improved firefly algorithm for the unrelated parallel machines scheduling problem with sequence-dependent setup times, IEEE Access, 6 (2018), 54459–54478. https://doi.org/10.1109/access.2018.2872110 doi: 10.1109/access.2018.2872110
    [6] C. Chen, M. Fathi, M. Khakifirooz, K. Wu, Hybrid tabu search algorithm for unrelated parallel machine scheduling in semiconductor fabs with setup times, job release, and expired times, Comput. Ind. Eng., 165 (2022), 107915. https://doi.org/10.1016/j.cie.2021.107915 doi: 10.1016/j.cie.2021.107915
    [7] J. B. Abikarram, K. McConky, R. Proano, Energy cost minimization for unrelated parallel machine scheduling under real time and demand charge pricing, J. Clean. Prod., 208 (2019), 232–242. https://doi.org/10.1016/j.jclepro.2018.10.048 doi: 10.1016/j.jclepro.2018.10.048
    [8] N. Vakhania, On preemptive scheduling on unrelated machines using linear programming, AIMS Math., 8 (2023), 7061–7082. https://doi.org/10.3934/math.2023356 doi: 10.3934/math.2023356
    [9] Y. Fu, Y. Hou, Z. Wang, X. Wu, K. Gao, L. Wang, Distributed scheduling problems in intelligent manufacturing systems, Tsinghua Sci. Technol., 26 (2021), 625–645. https://doi.org/10.26599/tst.2021.9010009 doi: 10.26599/tst.2021.9010009
    [10] İ. Sarıçiçek, Multi-objective scheduling by maximizing machine preferences for unrelated parallel machines, Sigma J. Eng. Nat. Sci., 38 (2020), 405–419. https://doi.org/10.5829/idosi.ije.2017.30.02b.09 doi: 10.5829/idosi.ije.2017.30.02b.09
    [11] R. Meng, Y. Rao, Q. Luo, Modeling and solving for bi-objective cutting parallel machine scheduling problem, Ann. Oper. Res., 285 (2020), 223–245. https://doi.org/10.1007/s10479-019-03208-z doi: 10.1007/s10479-019-03208-z
    [12] M. Moser, N. Musliu, A. Schaerf, F. Winter, Exact and metaheuristic approaches for unrelated parallel machine scheduling, J. Scheduling, 25 (2022), 507–534. https://doi.org/10.1007/s10951-021-00714-6 doi: 10.1007/s10951-021-00714-6
    [13] M. Đurasević, D. Jakobović, Heuristic and metaheuristic methods for the unrelated machines scheduling problem: A Survey, IEEE T. Cybernetics, (2021). http://arXiv.org/abs/2107.13106
    [14] A. F. Guevara-Guevara, V. Gómez-Fuentes, L. J. Posos-Rodríguez, N. Remolina-Gómez, E. M. González-Neira, Earliness/tardiness minimization in a no-wait flow shop with sequence-dependent setup times, J. Proj. Manag., 7 (2022). 177–190. https://doi.org/10.5267/j.jpm.2021.12.001
    [15] A. Sadati, R. Tavakkoli-Moghaddam, B. Naderi, M. Mohammadi, A bi-objective model for a scheduling problem of unrelated parallel batch processing machines with fuzzy parameters by two fuzzy multi-objective meta-heuristics, Iran. J. Fuzzy Syst., 16 (2019), 21–40. https://doi.org/10.3233/ifs-151846 doi: 10.3233/ifs-151846
    [16] G. Rivera Zarate, Outranking-based multi-objective PSO for scheduling unrelated parallel machines with a freight industry-oriented application, Instituto de Ingeniería Tecnología. (2021). https://doi.org/10.1016/j.engappai.2021.104556
    [17] A. Fallahi, B. Shahidi-Zadeh, S. T. A. Niaki, Unrelated parallel batch processing machine scheduling for production systems under carbon reduction policies: NSGA-II and MOGWO metaheuristics, Soft Comput., 27 (2023), 17063–17091. https://doi.org/10.1007/s00500-023-08754-0 doi: 10.1007/s00500-023-08754-0
    [18] W. Zhou, F. Chen, X. Ji, H. Li, J. Zhou, A Pareto-based discrete particle swarm optimization for parallel casting workshop scheduling problem with fuzzy processing time, Knowl. Based Syst., (2022), 256, 109872. https://doi.org/10.1016/j.knosys.2022.109872
    [19] M. Z. Erişgin Barak, M. Koyuncu, Fuzzy order acceptance and scheduling on identical parallel machines, Symmetry, 13 (2021), 1236. https://doi.org/10.3390/sym13071236 doi: 10.3390/sym13071236
    [20] J. Rezaeian, S. Mohammad-Hosseini, S. Zabihzadeh, K. Shokoufi, Fuzzy scheduling problem on unrelated parallel machine in JIT production system, Artif. Intell. Evol., 1 (2020), 17–33. https://doi.org/10.37256/aie.112020202 doi: 10.37256/aie.112020202
    [21] K. Li, J. Chen, H. Fu, Z. Jia, W. Fu, Uniform parallel machine scheduling with fuzzy processing times under resource consumption constraint, Appl. Soft Comput., 82 (2019), 1–13. https://doi.org/10.1016/j.asoc.2019.105585 doi: 10.1016/j.asoc.2019.105585
    [22] H. A. Alsattar, A. A. Zaidan, B. B. Zaidan, Novel meta-heuristic bald eagle search optimisation algorithm, Artif. Intell. Rev., 53 (2020), 2237–2264. https://doi.org/10.1007/s10462-019-09732-5 doi: 10.1007/s10462-019-09732-5
    [23] F. Pourpanah, R. Wang, C. P. Lim, X. Z. Wang, D. Yazdani, A review of artificial fish swarm algorithms: Recent advances and applications, Artif. Intell. Rev., 56 (2020), 1867–1903. https://doi.org/10.1007/s10462-022-10214-4 doi: 10.1007/s10462-022-10214-4
    [24] L. Zhao, F. Wang, Y. Bai, Route planning for autonomous vessels based on improved artificial fish swarm algorithm, Ships Offshore Struc., 18 (2023), 897–906. https://doi.org/10.1080/17445302.2022.2081423 doi: 10.1080/17445302.2022.2081423
    [25] W. H. Tan, J. Mohamad-Saleh, Normative fish swarm algorithm (NFSA) for optimization, Soft Comput., 24 (2020), 2083–2099. https://doi.org/10.1007/s00500-019-04040-0 doi: 10.1007/s00500-019-04040-0
    [26] J. Huang, J. Zeng, Y. Bai, Z. Cheng, Z. Feng, L. Qi, et al., Layout optimization of fiber Bragg grating strain sensor network based on modified artificial fish swarm algorithm, Opt. Fiber Technol., 65 (2021), 102583. https://doi.org/10.1016/j.yofte.2021.102583 doi: 10.1016/j.yofte.2021.102583
    [27] F. Wang, L. Zhao, Y. Bai, Path planning for unmanned surface vehicles based on modified Artificial Fish Swarm Algorithm with local optimizer, Math. Probl. Eng., (2022). https://doi.org/10.1155/2022/1283374
    [28] J. Jin, Z. Zhang, L. Zhang, A modified artificial fish swarm algorithm for unit commitment optimization, in 2023 Eighth International Conference on Electromechanical Control Technology and Transportation (ICECTT), 760–767. https://doi.org/10.1117/12.2689449
    [29] Y. Gao, L. Xie, Z. Zhang, Q. Fan, Twin support vector machine based on improved artificial fish swarm algorithm with application to flame recognition, Appl. Intell., 50 (2020), 2312–2327. https://doi.org/10.1007/s10489-020-01676-6 doi: 10.1007/s10489-020-01676-6
    [30] T. Li, F. Yang, D. Zhang, L. Zhai, Computation scheduling of multi-access edge networks based on the artificial fish swarm algorithm, IEEE Access, 9 (2021), 74674–74683. https://doi.org/10.1109/ACCESS.2021.3078539 doi: 10.1109/ACCESS.2021.3078539
    [31] E. B. Tirkolaee, A. Goli, G. W. Weber, Fuzzy mathematical programming and self-adaptive artificial fish swarm algorithm for just-in-time energy-aware flow shop scheduling problem with outsourcing option, IEEE T. Fuzzy Syst., 28 (2020), 2772–2783. https://doi.org/10.1109/TFUZZ.2020.2998174 doi: 10.1109/TFUZZ.2020.2998174
    [32] P. Kongsri, J. Buddhakulsomsiri, A mixed integer programming model for unrelated parallel machine scheduling problem with sequence dependent setup time to minimize makespan and total tardiness, In 2020 IEEE 7th International Conference on Industrial Engineering and Applications (ICIEA), 605–609. https://doi.org/10.1109/iciea49774.2020.9102086
    [33] R. L. Graham, E. L. Lawler, J. K. Lenstra, A. R. Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey, Annals Discrete Math., 5 (1979), 287–326. https://doi.org/10.1016/s0167-5060(08)70356-x doi: 10.1016/s0167-5060(08)70356-x
    [34] Y. Li, J. F. Côté, L. Callegari-Coelho, P. Wu, Novel formulations and logic-based benders decomposition for the integrated parallel machine scheduling and location problem, INFORMS J. Comput., 34 (2022), 1048–1069. https://doi.org/10.1287/ijoc.2021.1113 doi: 10.1287/ijoc.2021.1113
    [35] Y. Li, J. F. Côté, L. C. Coelho, P. Wu, Novel efficient formulation and matheuristic for large-sized unrelated parallel machine scheduling with release dates, Int. J. Prod. Res., 60 (2022), 6104–6123. https://doi.org/10.1080/00207543.2021.1983224 doi: 10.1080/00207543.2021.1983224
    [36] S. Chakraverty, D. M. Sahoo, N. R. Mahato, Defuzzification, In Concepts of Soft Computing, Springer Singapore, 2019,117–127. https://doi.org/10.1007/978-981-13-7430-2_7
    [37] L. A. Zadeh, Fuzzy sets, Inf. Control, 8 (1965), 338–353. https://doi.org/10.1016/s0019-9958(65)90241-x doi: 10.1016/s0019-9958(65)90241-x
    [38] H. J. Zimmermann, Fuzzy set theory, WIRES Comput. Stat., 2 (2010), 317–332. https://doi.org/10.1002/wics.82 doi: 10.1002/wics.82
    [39] H. T. Lee, S. H. Chen, H. Y. Kang, Multicriteria scheduling using fuzzy theory and tabu search, Int. J. Prod. Res., 40 (2002), 1221–1234. https://doi.org/10.1080/00207540110098832 doi: 10.1080/00207540110098832
    [40] S. Banerjee, T. K. Roy, Arithmetic operations on generalized trapezoidal fuzzy number and its applications, Turkish J. Fuzzy Syst., 3 (2012), 16–44.
    [41] J. Shen, An uncertain parallel machine problem with deterioration and learning effect, Comput. Appl. Math., 38 (2019), 1–17. https://doi.org/10.1007/s40314-019-0789-5
    [42] T. W. Liao, P. Su, Parallel machine scheduling in fuzzy environment with hybrid ant colony optimization including a comparison of fuzzy number ranking methods in consideration of spread of fuzziness, Appl. Soft Comput. J., 56 (2017), 65–81. https://doi.org/10.1016/j.asoc.2017.03.004 doi: 10.1016/j.asoc.2017.03.004
    [43] T. S. Liou, M. J. Wang, Ranking fuzzy numbers with integral value, Fuzzy Sets Syst., 50 (1992), 247–255. https://doi.org/10.1016/0165-0114(92)90223-q doi: 10.1016/0165-0114(92)90223-q
    [44] X. L. Li, An optimizing method based on autonomous animats: fish-swarm algorithm, Syst. Eng. Theory Practice, 22 (2002), 32–38.
    [45] A. W. Abdulqader, S. M. Ali, Diversity operators-based Artificial Fish Swarm Algorithm to solve flexible job shop scheduling problem, Baghdad Sci. J., (2023). https://doi.org/10.21123/bsj.2023.6810
    [46] L. Zhang, M. Fu, T. Fei, X. Pan, Application of FWA-Artificial Fish Swarm Algorithm in the Location of Low-Carbon Cold Chain Logistics Distribution Center in Beijing-Tianjin-Hebei Metropolitan Area, Sci. Programming, (2021), 1–10. https://doi.org/10.1155/2021/9945583
    [47] Y. Liu, X. Feng, L. Zhang, W. Hua, K. Li, A pareto artificial fish swarm algorithm for solving a multi-objective electric transit network design problem, Transportmetrica A, 16 (2020), 1648–1670. https://doi.org/10.1080/23249935.2020.1773574 doi: 10.1080/23249935.2020.1773574
    [48] S. Gorgich, S. Tabatabaei, Proposing an energy-aware routing protocol by using fish swarm optimization algorithm in WSN (wireless sensor networks), Wireless Pers. Commun., 119 (2021), 1935–1955. https://doi.org/10.1007/s11277-021-08312-7 doi: 10.1007/s11277-021-08312-7
    [49] R. A. Hasan, R. A. I. Alhayali, M. A., Mohammed, T. Sutikno, An improved fish swarm algorithm to assign tasks and cut down on latency in cloud computing, TELKOMNIKA (Telecommunication Computing Electronics and Control), 20 (2022), 1103–1108. https://doi.org/10.12928/telkomnika.v20i5.22645 doi: 10.12928/telkomnika.v20i5.22645
    [50] N. M. Sureja, S. P. Patel, Solving a combinatorial optimization problem using artificial fish swarm algorithm, Int. J. Eng. Trends Technol, 68 (2020), 27–32. https://doi.org/10.14445/22315381/ijett-v68i5p206s doi: 10.14445/22315381/ijett-v68i5p206s
    [51] M. Yadollahi, S. S. Razavi, Using Artificial Fish Swarm Algorithm to solve university exam timetabling problem, J. Adv. Comput. Res., 10 (2019), 109–117.
    [52] C. Peraza, P. Ochoa, L. Amador, O. Castillo, Artificial Fish Swarm Algorithm for the Optimization of a Benchmark Set of Functions, In New Perspectives on Hybrid Intelligent System Design based on Fuzzy Logic, Neural Networks and Metaheuristics, Studies in Computational Intelligence, 1050 (2022), (77–92). https://doi.org/10.1007/978-3-031-08266-5_6
    [53] S. P. M. Villablanca, An artificial fish swarm algorithm to solve the set covering problem doctoral dissertation, pontificia universidad católica de valparaíso, (2016).
    [54] J. Derrac, S. García, D. Molina, F. Herrera, A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms, Swarm Evol Comput, 1 (2011), 3–18. https://doi.org/10.1016/j.swevo.2011.02.002 doi: 10.1016/j.swevo.2011.02.002
    [55] F. Wilcoxon, Individual comparisons by ranking methods, Biometrics Bulletin, 1 (1945), 80–83. https://doi.org/10.2307/3001968 doi: 10.2307/3001968
  • This article has been cited by:

    1. M A Aziz-Alaoui, Guillaume Cantin, Alexandre Thorel, Synchronization of Turing patterns in complex networks of reaction–diffusion systems set in distinct domains, 2024, 37, 0951-7715, 025011, 10.1088/1361-6544/ad1a48
  • Reader Comments
  • © 2024 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(546) PDF downloads(33) Cited by(0)

Figures and Tables

Figures(6)  /  Tables(10)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog