
Supply chain management has recently renovated its strategy by implementing a cross-docking scheme. Cross-docking is a calculated logistics strategy where freight emptied from inbound vehicles is handled straightforwardly onto outbound vehicles, eliminating the intermediate storage process. The cross-docking approach thrives on the minimum storage time of goods in the inventory. Most of the cross-docks avail temporary storage docks where items can be stored for up to 24 hours before being packed up for transportation. The storage capacity of the cross-dock varies depending on the nature of ownership. In the rented cross-docks center, the temporary storage docks are considered of infinite capacity. This study believes that the temporary storage facilities owned by the cross-dock center are of finite capacity, which subsequently affects the waiting time of the goods. The flow rate of goods within the cross-docks is expected to be maximum to avoid long waiting for goods in the queue. This paper uses a series of max-flow algorithms, namely Ford Fulkerson, Edmond Karp, and Dinic's, to optimize the flow of goods between the inbound port and the outbound dock and present a logical explanation to reduce the waiting time of the trucks. A numerical example is analyzed to prove the efficacity of the algorithm in finding maximum flow. The result demonstrates that Dinic's algorithm performs better than the Ford Fulkerson and Edmond Karp algorithm at addressing the problem of maximum flow at the cross-dock. The algorithm effectively provided the best result regarding iteration and time complexity. In addition, it also suggested the bottleneck paths of the network in determining the maximum flow.
Citation: Taniya Mukherjee, Isha Sangal, Biswajit Sarkar, Tamer M. Alkadash. Mathematical estimation for maximum flow of goods within a cross-dock to reduce inventory[J]. Mathematical Biosciences and Engineering, 2022, 19(12): 13710-13731. doi: 10.3934/mbe.2022639
[1] | Xiaowei An, Xianfa Song . A spatial SIS model in heterogeneous environments with vary advective rate. Mathematical Biosciences and Engineering, 2021, 18(5): 5449-5477. doi: 10.3934/mbe.2021276 |
[2] | Wenzhang Huang, Maoan Han, Kaiyu Liu . Dynamics of an SIS reaction-diffusion epidemic model for disease transmission. Mathematical Biosciences and Engineering, 2010, 7(1): 51-66. doi: 10.3934/mbe.2010.7.51 |
[3] | Andreas Widder, Christian Kuehn . Heterogeneous population dynamics and scaling laws near epidemic outbreaks. Mathematical Biosciences and Engineering, 2016, 13(5): 1093-1118. doi: 10.3934/mbe.2016032 |
[4] | Jinzhe Suo, Bo Li . Analysis on a diffusive SIS epidemic system with linear source and frequency-dependent incidence function in a heterogeneous environment. Mathematical Biosciences and Engineering, 2020, 17(1): 418-441. doi: 10.3934/mbe.2020023 |
[5] | Danfeng Pang, Yanni Xiao . The SIS model with diffusion of virus in the environment. Mathematical Biosciences and Engineering, 2019, 16(4): 2852-2874. doi: 10.3934/mbe.2019141 |
[6] | Abdelrazig K. Tarboush, Jing Ge, Zhigui Lin . Coexistence of a cross-diffusive West Nile virus model in a heterogenous environment. Mathematical Biosciences and Engineering, 2018, 15(6): 1479-1494. doi: 10.3934/mbe.2018068 |
[7] | Pengfei Liu, Yantao Luo, Zhidong Teng . Role of media coverage in a SVEIR-I epidemic model with nonlinear incidence and spatial heterogeneous environment. Mathematical Biosciences and Engineering, 2023, 20(9): 15641-15671. doi: 10.3934/mbe.2023698 |
[8] | Yan’e Wang , Zhiguo Wang, Chengxia Lei . Asymptotic profile of endemic equilibrium to a diffusive epidemic model with saturated incidence rate. Mathematical Biosciences and Engineering, 2019, 16(5): 3885-3913. doi: 10.3934/mbe.2019192 |
[9] | Baoxiang Zhang, Yongli Cai, Bingxian Wang, Weiming Wang . Dynamics and asymptotic profiles of steady states of an SIRS epidemic model in spatially heterogenous environment. Mathematical Biosciences and Engineering, 2020, 17(1): 893-909. doi: 10.3934/mbe.2020047 |
[10] | Yicang Zhou, Zhien Ma . Global stability of a class of discrete age-structured SIS models with immigration. Mathematical Biosciences and Engineering, 2009, 6(2): 409-425. doi: 10.3934/mbe.2009.6.409 |
Supply chain management has recently renovated its strategy by implementing a cross-docking scheme. Cross-docking is a calculated logistics strategy where freight emptied from inbound vehicles is handled straightforwardly onto outbound vehicles, eliminating the intermediate storage process. The cross-docking approach thrives on the minimum storage time of goods in the inventory. Most of the cross-docks avail temporary storage docks where items can be stored for up to 24 hours before being packed up for transportation. The storage capacity of the cross-dock varies depending on the nature of ownership. In the rented cross-docks center, the temporary storage docks are considered of infinite capacity. This study believes that the temporary storage facilities owned by the cross-dock center are of finite capacity, which subsequently affects the waiting time of the goods. The flow rate of goods within the cross-docks is expected to be maximum to avoid long waiting for goods in the queue. This paper uses a series of max-flow algorithms, namely Ford Fulkerson, Edmond Karp, and Dinic's, to optimize the flow of goods between the inbound port and the outbound dock and present a logical explanation to reduce the waiting time of the trucks. A numerical example is analyzed to prove the efficacity of the algorithm in finding maximum flow. The result demonstrates that Dinic's algorithm performs better than the Ford Fulkerson and Edmond Karp algorithm at addressing the problem of maximum flow at the cross-dock. The algorithm effectively provided the best result regarding iteration and time complexity. In addition, it also suggested the bottleneck paths of the network in determining the maximum flow.
It has been recognized that environmental heterogeneity and individual motility are significant factors that can affect the dynamics of infectious diseases. To investigate the roles of diffusion and spatial heterogeneity on disease dynamics, Allen et al. [1] proposed a frequency-dependent SIS reaction diffusion model
{St−dSΔS=−β(x)SIS+I+γ(x)I,x∈Ω, t>0,It−dIΔI=β(x)SIS+I−γ(x)I,x∈Ω, t>0, | (1.1) |
where S(x,t) and I(x,t) denote the numbers of susceptible and infected individuals at location x and time t, respectively. dS and dI are the diffusion rates of the susceptible and infected individuals. β(x) and γ(x) are positive bounded H¨older continuous functions on ¯Ω that represent the spatially dependent rates of contact transmission and disease recovery at x, respectively. They obtained the explicit formula of the basic reproduction number R0 and characterized whether or not the domain is high (low) risk. They also showed that in high-risk domains (R0>1) the disease-free equilibrium is always unstable, and there is a unique endemic equilibrium, while in low-risk domains (R0<1), the disease-free equilibrium is stable if and only if the infected individuals have mobility above a threshold value (see [1] for more details). Recently, Li etc. [16] considered a SIS epidemic reaction-diffusion model governed by a mass action infection mechanism and linear birth-death growth. They studied the stability of the disease-free equilibrium, uniform persistence property in terms of the basic reproduction number and investigated the asymptotic profile of endemic equilibria in a heterogeneous environment when the movement rate of the susceptible and infected populations is small. Their results showed that factors such as infection mechanism, variation of total population, and population movement play vital but subtle roles in the transmission dynamics of diseases.
Considering an environment with the hostile boundary for the survival of population, such as extremely cold or hot temperature, the lack of resource, and so on, Huang, Han and Liu [12] modified the model (1.1) under the null Dirichlet boundary condition,
{ˉSt−dSΔˉS=−β(x)f(ˉS,ˉI)ˉI+γ(x)ˉI+Λ(x), x∈Ω,t>0,ˉIt−dIΔˉI=β(x)f(ˉS,ˉI)ˉI−γ(x)ˉI, x∈Ω,t>0,ˉS(x,t)=ˉI(x,t)=0, x∈∂Ω,t>0, | (1.2) |
where f(ˉS,ˉI)=ˉSˉS+ˉI, β(x),γ(x)andΛ(x) is positive and continuous on ¯Ω and ∂Ω is C2 smooth. They showed that the disease dies out when R0<1 and persists if R0>1.
When ecological phenomena are described by mathematical models, reaction diffusion systems are usually considered and the domains involved are fixed. However, the changing of domain plays a significance role in the survival of species and the transmission of disease, related problems attract much attention. One of them is the problem with free boundary, which is caused by behaviors of species themselves. In [8], Du and Lin proposed the logistic reaction diffusion model, and gave an spreading-vanishing dichotomy, that is, the population either successfully expends to the entire new environment, or eventually becomes extinct, see also some recent work ([10,14,15,23,24,25,29]) for the spreading of species and ([9,17]) for the transmission of disease. Another problem with regional change is that with evolving domain ([2,3,4,5,6,13]), which is possibly caused by environment and climate. For example, according to monitoring meteorological satellites, Poyang lake in China covered an area of 1407 square kilometers on October 22, 2013, compared with 2022 square kilometers on August 7, its water area in summer is significantly larger than that in winter, the same is true of Dongting lake in China. In addition, in a biological context, the movement of cells is typically modelled as a diffusion-like process. For example, in the urodele amphibian axolotl [19] the pronephric duct extends caudally from the level of somite 7 to the cloaca. This is controlled by migratory cells at the advancing tip of the duct. Over the approximately 20 h this takes to complete, the length of the path in which duct-tip migration takes place increases from about 0.9 to 1.4 mm (lengths estimated from [19]). For infectious diseases, there are similar phenomenons. For example, lakes which habitat infected fishes are periodically evolving. The area infected with Japanese encephalitis (JE) is also periodically evolving. In fact, JE is an acute infectious disease caused by JE virus and transmitted by mosquitoes. Culex is the major vector of JE, and its survival, development and reproduction are influenced heavily by temperature and precipitation. JE virus in mosquitoes lost ability of infection under a temperature below 20oC. In winter temperatures are low and mosquitoes are inactive, there is less JE infection. When warm days come, the area infected with JE expands gradually.
As in [2,22], let Ω(t)⊂Rn be a simply connected bounded shifting domain at time t≥0 with its changing boundary ∂Ω(t). What calls for special attention is that we considered x∈Ω(t)⊂Rn with n≤2 in this paper. For n=1, the evolving interval [0,x(t)] can be regarded as a simplified form of a lake, 0 represents the top of the water column and x(t) is the average depth of the lake, see [11]. Certainly, a lake is actually 3-dimensional and its water area Ω(t)⊂R3. For n=2, the evolving domain Ω(t) can be used to describe the area infected with Japanese encephalitis and the temperature of the area is above 20oC. For any point
x(t)=(x1(t),x2(t),…,xn(t))∈Ω(t), |
we assume that ˉS(x(t),t) and ˉI(x(t),t) are the density of susceptible and infected species at position x(t) and time t≥0. By Reynolds transport theorem ([21]), we have
∂ˉS∂t+∇ˉS⋅a+ˉS(∇⋅a)=dΔˉS+f1(ˉS,ˉI,t) in Ω(t),∂ˉI∂t+∇ˉI⋅a+ˉI(∇⋅a)=dΔˉI+f2(ˉS,ˉI,t) in Ω(t), | (1.3) |
where f1(ˉS,ˉI,t)=−β(x)f(ˉS,ˉI)ˉI+γ(x)ˉI+Λ(x),f2(ˉS,ˉI,t)=β(x)f(ˉS,ˉI)ˉI−γ(x)ˉI and a=˙x(t), ∇ˉS⋅a and ∇ˉI⋅a are called advection terms while (∇⋅a)ˉS and (∇⋅a)ˉI are called dilution terms. In order to circumvent the difficulty induced by the evolving domain, we have to modify equations in (1.3). Let y1,y2,…,yn be fixed cartesian coordinates in a fixed domain Ω(0) such that
x1(t)=ˆx1(y1,y2,…,yn,t), |
x2(t)=ˆx2(y1,y2,…,yn,t), |
… |
xn(t)=ˆxn(y1,y2,…,yn,t). |
Then (ˉS,ˉI) is mapped into the new vector (S,I) defined as
ˉS(x1(t),x2(t),…,xn(t),t)=S(y1,y2,…,yn,t),ˉI(x1(t),x2(t),…,xn(t),t)=I(y1,y2,…,yn,t). | (1.4) |
Thus equations (1.3) can be translated to another form which are defined on the fixed domain Ω(0) with respect to y=(y1,y2,…,yn). However, the new equations are still very complicated. To further simplify the model equations (1.3), we assume that domain evolution is uniform and isotropic. That is, the evolution of the domain takes place at the same proportion in all directions as time elapses. Mathematically, x(t)=(x1(t),x2(t),…,xn(t)) can be described as follows:
(x1(t),x2(t),…,xn(t))=ρ(t)(y1,y2,…,yn),y∈Ω(0), | (1.5) |
where the positive continuous function ρ(t) is called evolving rate subject to ρ(0)=1. Furthermore, if ρ(t)=ρ(t+T) for some T>0, the domain is periodically evolving, which has been discussed in [13,20]. If ˙ρ(t)≥0, the domain is then called growing one ([21,22]), and if ˙ρ(t)≤0, the domain is shrinking, see ([27]) and references therein. Using (1.5) yields
St=ˉSt+∇ˉS⋅a,It=ˉIt+∇ˉI⋅a,a=˙x(t)=˙ρ(t)(y1,y2,…,yn)=˙ρ(t)ρ(t)(x1,x2,…,xn),∇⋅a=n˙ρ(t)ρ(t),ΔˉS=1ρ2(t)ΔS,ΔˉI=1ρ2(t)ΔI. |
Then (1.3) becomes
St=dSρ2(t)ΔS−n˙ρ(t)ρ(t)S+f1(S,I,t),y∈Ω(0), t>0,It=dIρ2(t)ΔI−n˙ρ(t)ρ(t)I+f2(S,I,t),y∈Ω(0), t>0. | (1.6) |
Now we transform the SIS epidemic model on the periodically evolving domain Ω(t) into the following problem in a fixed domain Ω(0):
{St−dSρ2(t)ΔS=−β(ρ(t)y)f(S,I)I+γ(ρ(t)y)I+Λ(ρ(t)y)−n˙ρ(t)ρ(t)S,y∈Ω(0),t>0,It−dIρ2(t)ΔI=β(ρ(t)y)f(S,I)I−γ(ρ(t)y)I−n˙ρ(t)ρ(t)I,y∈Ω(0),t>0,S(y,t)=I(y,t)=0,y∈∂Ω(0),t>0, | (1.7) |
with the initial condition
S(y,0)=S0(y)>0,I(y,0)=I0(y)≥0, I0(y)≢0, y∈¯Ω(0), | (1.8) |
for later application, we also consider problem (1.7) with the periodic condition
S(y,0)=S(y,T),I(y,0)=I(y,T), y∈¯Ω(0), | (1.9) |
where f(S,I) is monotonically decreasing with respect to I and increasing with respect to S and limI→0f(S,I)=1, see for example, f(S,I)=SS+I for the standard incidence rate β(x)SIS+I in [12].
The remaining work is organized as follows. In Section 2, we focus on the existence and uniqueness of disease-free equilibrium (DFE). We define the basic reproduction number and analyze the stability of DFE in Section 3. The paper ends with some simulations and epidemiological explanations for our analytical findings.
We first present the existence and uniqueness of the disease-free equilibrium (S∗(y,t),0). When I=0, (1.7), (1.9) becomes the following problem
{St−dSρ2(t)ΔS=Λ(ρ(t)y)−n˙ρ(t)ρ(t)S, y∈Ω(0),t>0.S(y,t)=0, y∈∂Ω(0),t>0.S(y,0)=S(y,T), y∈¯Ω(0). | (2.1) |
Let u(y,t)=enlnρ(t)S(y,t), then problem (2.1) turns to
{ut−dSρ2(t)Δu=enlnρ(t)Λ(ρ(t)y), y∈Ω(0),t>0.u(y,t)=0, y∈∂Ω(0),t>0.u(y,0)=u(y,T), y∈¯Ω(0). | (2.2) |
In order to find the positive solution of problem (2.2), we define the upper solution ¯u=MW(y) and the lower solution u_=εW(y), where W(y) satisfies the following equations
{−ΔW=1, y∈Ω.W(y)=0, y∈∂Ω. | (2.3) |
Since enlnρ(t)Λ(ρ(t)y) is bounded function, then we can choose sufficiently large M and small ε such that
dSρ2(t)M≥enlnρ(t)Λ(ρ(t)y),dSρ2(t)ε≤enlnρ(t)Λ(ρ(t)y)fory∈¯Ω(0),t∈[0,T], |
which implies
¯ut−dSρ2(t)Δ¯u≥enlnρ(t)Λ(ρ(t)y),u_t−dSρ2(t)Δu_≤enlnρ(t)Λ(ρ(t)y), |
we easily see that ¯u and u_ are the ordered upper and lower solution of problem (2.2). As a result, we conclude that there exists an u∗(y,t)∈[u_,¯u] satisfying problem (2.2). So problem (2.1) admits a positive solution S∗(y,t).
To illustrate the uniqueness of the solution, let S1 and S2 be two solutions. Set
Λ={h∈[0,1], hS1≤S2 in ¯Ω(0)×[0,T]}. |
Clearly Λ contains a neighbourhood of 0. We claim that 1∈Λ. Suppose not, then
h0=supΛ<1. |
Therefore
(S2−h0S1)t−Δ(S2−h0S1)=f(S2,t)−h0f(S1,t). |
Recalling that f(S, t)+K∗S=Λ(ρ(t)y)+(K∗−n˙ρ(t)ρ(t))S is increasing on [0, maxS2] for K∗=nmax[0,T]˙ρ(t)ρ(t). Then
(S2−h0S1)t−Δ(S2−h0S1)+K∗(S2−h0S1)=f(S2,t)−h0f(S1,t)+K∗S2−h0K∗S1≥f(h0S1,t)−h0f(S1,t)≥0 |
for y∈Ω(0),t>0. On the other hand, for y∈∂Ω(0),t>0, S2(y,t)−h0S1(y,t)=0. Using the strong maximum principle we have assertions as follows.
(ⅰ) S2−h0S1≥0(≢0), using the strong maximum principle gives S2−h0S1>0 in Ω(0)×[0,T] with ∂∂S(S2−h0S1)<0 on ∂Ω(0)×[0,T]. Then, clearly there is some ε>0 such that S2−h0S1≥εS1. Thus h0+ε∈Λ, which contradicts the maximality of h0.
(ⅱ) S2−h0S1≡0 in ¯Ω(0)×[0,T]. This case is also impossible since we would have the equation f(S2,t)=h0f(S1,t), but f(S2,t)=f(h0S1,t)>h0f(S1,t).
Therefore, problem (2.1) admits only a positive periodic solution.
First, we define the basic reproduction number (R0), and investigate its properties and implications for the reaction-diffusion system (1.7). Usually, the basic reproduction number is used as threshold for the transmission mechanism of the disease. Biologically, R0 is the expected number of secondary infections due to an infected individual over its infection period [7]. We know that for epidemic models described by spatially-independent systems, R0 can be obtained by the second generation matrix method [26].
First, a routine computation gives rise to the corresponding linearized system of problem (1.7) about the disease free equilibrium (S∗(y,t),0),
{wt−D(t)Δw=A(t)w−B(t)w,y∈Ω(0),t>0,w(y,t)=0,y∈∂Ω(0),t>0, | (3.1) |
with the same periodic condition (1.9), where
w=(uv), D(t)=(dSρ2(t)00dIρ2(t)), |
A(t)=(0γ(ρ(t)y)0β(ρ(t)y)), B(t)=(n˙ρ(t)ρ(t)β(ρ(t)y)0γ(ρ(t)y)+n˙ρ(t)ρ(t)). |
Let V(t,s) be the evolution operator of the problem
{wt−D(t)Δw=−B(t)w,y∈Ω(0),t>0,w(y,t)=0,y∈∂Ω(0),t>0, | (3.2) |
By the standard semigroup theory, it is easily seen that there exist positive constants K and c0 such that
‖V(t,s)‖≤Ke−c0(t−s), ∀t≥s,t,s∈R. |
Let CT be the ordered Banach space consisting of all T− periodic and continuous function from R to C(¯Ω(0),R) with the maximum norm ‖⋅‖ and the positive cone C+T:={ξ∈CT:ξ(t)y≥0,∀ t∈R,y∈¯Ω(0)}. The notation ξ(y,t):=ξ(t)y will be adopted for any given ξ∈CT. After supposing that η=(ξ,ζ)∈CT×CT is the density distribution of w at the spatial locaton y∈Ω(0) and time s, we introduce the linear operator as in [28], which may be called as the next infection operator
L(η)(t):=∫∞0V(t,t−s)A(⋅,t−s)η(⋅,t−s)ds. |
It is easily seen that L is positive, continuous and compact on CT×CT. We define the spectral radius of L
R0=r(L) |
as the basic reproduction number for periodic system (1.7), (1.9). Besides, we have the following results.
Lemma 3.1. (i) R0=μ0, where μ0 is the principle eigenvalue of the following periodic-parabolic eigenvalue problem
{φt−dSρ2(t)Δφ=−β(ρ(t)y)ϕ+γ(ρ(t)y)μϕ−n˙ρ(t)ρ(t)φ, y∈Ω(0),t>0.ϕt−dIρ2(t)Δϕ=β(ρ(t)y)μϕ−γ(ρ(t)y)ϕ−n˙ρ(t)ρ(t)ϕ, y∈Ω(0),t>0.φ(y,t)=ϕ(y,t)=0, y∈∂Ω(0),t>0.φ(y,0)=φ(y,T),ϕ(y,0)=ϕ(y,T), y∈¯Ω(0). | (3.3) |
(ii) sign(1−R0)=signλ0, where λ0 is the principal eigenvalue of the following reaction-diffusion problem
{φt−dSρ2(t)Δφ=−β(ρ(t)y)ϕ+γ(ρ(t)y)ϕ−n˙ρ(t)ρ(t)φ+λφ, y∈Ω(0),t>0.ϕt−dIρ2(t)Δϕ=β(ρ(t)y)ϕ−γ(ρ(t)y)ϕ−n˙ρ(t)ρ(t)ϕ+λϕ, y∈Ω(0),t>0.φ(y,t)=ϕ(y,t)=0, y∈∂Ω(0),t>0.φ(y,0)=φ(y,T),ϕ(y,0)=ϕ(y,T), y∈¯Ω(0). | (3.4) |
Particularly, assume that the coefficients in problem (1.7) are all positive constant, that is β(ρ(t)y)≡β∗ and γ(ρ(t)y)≡γ∗, then
R0=∫T0β∗dt∫T0(dIρ2(t)λ∗+γ∗)dt, | (3.5) |
where λ∗ is the principal eigenvalue of the following problem
{−Δψ=λ∗ψ, y∈Ω(0),ψ=0, y∈∂Ω(0). | (3.6) |
It is easy to see that R0 is decreasing with respect to ¯ρ−2 (: = 1T∫T01ρ2(t)dt).
Theorem 3.2. The following statements are valid:
(i) If R0<1, then the disease-free equilibrium (S∗(y,t),0) is globally asymptotically stable for system (1.7), (1.8), that is to say, for any nonnegative solutions to problem (1.7), (1.8), we can deduce that limt→∞I(y,t)=0 for y∈¯Ω(0) and limm→+∞S(y,t+mT)=S∗(y,t) for (y,t)∈¯Ω(0)×[0,T].
(ii) If R0>1, then there exists ε0>0 such that any positive solution of system (1.7), (1.8) satisfies lim supt→∞‖(S(y,t),I(y,t))−(S∗(y,t),0)‖≥ε0.
Proof: (i) It follows from Lemma 3.1 that problem (3.3) admits an eigen-pair (R0;φ,ϕ) such that ψ(y,t),ϕ(y,t)>0 for (y,t)∈¯Ω(0)×[0,T]. Letting ˉI(y,t)=Me−λtϕ(y,t), where 0<λ≤β(ρ(t)y)(1R0−1) for (y,t)∈¯Ω(0)×[0,T]. Recalling that 0≤f(S,I)≤1, we then have
ˉIt−dIρ2(t)ΔˉI−β(ρ(t)y)f(S,ˉI)ˉI+γ(ρ(t)y)ˉI+n˙ρ(t)ρ(t)ˉI,≥ˉIt−dIρ2(t)ΔˉI−β(ρ(t)y)ˉI+γ(ρ(t)y)ˉI+n˙ρ(t)ρ(t)ˉI,=Me−λtϕt−λMe−λtϕ−Me−λtdIρ2(t)Δϕ−β(ρ(t)y)Me−λtϕ+γ(ρ(t)y)Me−λtϕ+n˙ρ(t)ρ(t)Me−λtϕ,=ˉI{−λ+β(ρ(t)y)R0−β(ρ(t)y)},≥0, |
therefore ˉI is the upper solution of the following problem
{It−dIρ2(t)ΔI=β(ρ(t)y)f(S,I)I−γ(ρ(t)y)I−n˙ρ(t)ρ(t)I, y∈Ω(0),t>0,I(y,t)=0, y∈∂Ω(0),t>0,I(y,0)=I0(y)≥0,I0(y)≢0, y∈¯Ω(0) | (3.7) |
if M is large enough. Since limt→+∞ˉI(y,t)=0, then limt→+∞I(y,t)=0 uniformly for y∈¯Ω(0).
The above limit implies that for any ε>0, there exists Tε>0 such that 0≤I(y,t)≤ε for y∈¯Ω(0) and t>Tε, we then have
−M∗ε+Λ(ρ(t)y)−n˙ρ(t)ρ(t)S≤St−dSρ2(t)ΔS≤M∗ε+Λ(ρ(t)y)−n˙ρ(t)ρ(t)S, |
where M∗=max(y,t)∈¯Ω(0)×[0,T]{β(ρ(t)y)+γ(ρ(t)y)}. Assume that ¯Sε and S_ε are solutions of the following problems
{St−dSρ2(t)ΔS=M∗ε+Λ(ρ(t)y)−n˙ρ(t)ρ(t)S, y∈Ω(0),t>0,S(y,t)=0, y∈∂Ω(0),t>0,S(y,0)=S0(y)>0, y∈¯Ω(0), | (3.8) |
and
{St−dSρ2(t)ΔS=−M∗ε+Λ(ρ(t)y)−n˙ρ(t)ρ(t)S, y∈Ω(0),t>0,S(y,t)=0, y∈∂Ω(0),t>0,S(y,0)=S0(y)>0, y∈¯Ω(0). | (3.9) |
We can deduce that ¯Sε and S_ε are the upper and lower solution of problem (1.7), (1.8), respectively. So the solution (S(y,t),I(y,t)) of problem (1.7), (1.8) satisfies S_ε≤S(y,t)≤¯Sε in Ω(0)×[0,+∞). Let ¯S(m)ε and S_(m)ε be the maximal and minimal sequences obtained from the following problem with initial iterations ¯S(0)ε=¯Sε and S_(0)ε=S_ε,
{(¯S(m)ε)t−dSρ2(t)Δ¯S(m)ε+K1¯S(m)ε=g1(¯S(m−1)ε), y∈Ω(0),t>0,(S_(m)ε)t−dSρ2(t)ΔS_(m)ε+K2S_(m)ε=g2(S_(m−1)ε), y∈Ω(0),t>0,¯S(m)ε(y,t)=S_(m)ε(y,t)=0, y∈∂Ω(0),t>0,¯S(m)ε(y,0)=¯S(m−1)ε(y,T),S_(m)ε(y,0)=S_(m−1)ε(y,T), y∈¯Ω(0), | (3.10) |
where m=1,2,⋯ and
g1(S)=M∗ε+Λ(ρ(t)y)−n˙ρ(t)ρ(t)S+K1S, K1=supt∈[0,+∞]{n˙ρ(t)ρ(t)}, |
g2(S)=−M∗ε+Λ(ρ(t)y)−n˙ρ(t)ρ(t)S+K2S, K2=K1+M∗. |
According to Lemma 3.1 in [18], it follows that the sequences ¯S(m)ε and S_(m)ε admit the monotone property
S_ε≤S_(m−1)ε≤S_(m)ε≤¯S(m)ε≤¯S(m−1)ε≤¯Sε |
and the limits exist,
limm→∞¯S(m)ε=¯S∗ε, limm→∞S_(m)ε=S_∗ε, |
which means that
S_ε≤S_(m−1)ε≤S_(m)ε≤S_∗ε≤¯S∗ε≤¯S(m)ε≤¯S(m−1)ε≤¯Sε. |
Recalling that
S_ε(y,t)≤S(y,t)≤¯Sε(y,t) in ¯Ω(0)×[0,+∞) | (3.11) |
and letting Sm(y,t)=S(y,t+mT) yields
S_ε(y,t+T)≤S1(y,t)≤¯Sε(y,t+T) in ¯Ω(0)×[0,+∞). |
Considering the system (1.7) with the initial condition S0(y)=S1(y,0), since by the initial condition in (3.10) for m=1,
¯S(1)ε(y,0)=¯S(0)ε(y,T)=¯Sε(y,T) |
and
S_(1)ε(y,0)=S_(0)ε(y,T)=S_ε(y,T), |
we see that
S_(1)ε(y,0)≤S1(y,0)≤¯S(1)ε(y,0) in Ω(0), |
and using comparison principle gives that
S_(1)ε(y,t)≤S1(y,t)≤¯S(1)ε(y,t) in Ω(0)×[0,+∞). |
Assume, by induction, that
S_(m−1)ε(y,t)≤Sm−1(y,t)≤¯S(m−1)ε(y,t) in ¯Ω(0)×[0,+∞). |
we can deduce by the comparison principle that
S_(m)ε(y,t)≤Sm(y,t)≤¯S(m)ε(y,t) in ¯Ω(0)×[0,+∞). |
and therefore, for (y,t)∈¯Ω(0)×[0,+∞),
lim infm→∞S_(m)ε(y,t)≤lim infm→∞Sm(y,t)≤lim supm→∞Sm(y,t)≤lim supm→∞¯S(m)ε(y,t). |
On the other hand, for (y,t)∈¯Ω(0)×[0,+∞),
limm→∞S_(m)ε(y,t)=S_∗ε(y,t) and limm→∞¯S(m)ε(y,t)=¯S∗ε(y,t), |
where S_∗ε(y,t) satisfies
{St−dSρ2(t)ΔS=−M∗ε+Λ(ρ(t)y)−n˙ρ(t)ρ(t)S, y∈Ω(0),t>0.S(y,t)=0, y∈∂Ω(0),t>0.S(y,0)=S(y,T), y∈¯Ω(0) | (3.12) |
and ¯S∗ε(y,t) satisfies
{St−dSρ2(t)ΔS=M∗ε+Λ(ρ(t)y)−n˙ρ(t)ρ(t)S, y∈Ω(0),t>0.S(y,t)=0, y∈∂Ω(0),t>0.S(y,0)=S(y,T), y∈¯Ω(0). | (3.13) |
Due to the uniqueness of the solution to problem (2.1), we have
limε→0+¯S∗ε(y,t)=limε→0+S_∗ε(y,t)=S∗(y,t) |
and then
limm→∞S(y,t+mT)=S∗(y,t) for ¯Ω(0)×[0,+∞). |
(ii) Since limI→0f(S,I)=1, take δ0=12(1−1R0)>0, there exists ε0>0 such that
1−δ0≤f(S,I)≤1 |
if 0≤I(y,t)≤ε0.
Assume, for the sake of contradiction, that there exists a positive solution (S,I) of problem (1.7), (1.8) such that
lim supt→∞‖(S(y,t),I(y,t))−(S∗(y,t),0)‖<ε0/2. | (3.14) |
For the above given ε0, there exists Tε0 such that
0≤I(y,t)≤ε0 for(y,t)∈¯Ω(0)×[Tε0,∞). |
Then we have
It−dIρ2(t)ΔI=β(ρ(t)y)f(S,I)I−γ(ρ(t)y)I−n˙ρ(t)ρ(t)I,≥β(ρ(t)y)(1−δ0)I−γ(ρ(t)y)I−n˙ρ(t)ρ(t)I | (3.15) |
for y∈Ω(0),t≥Tε0. We now choose a sufficiently small number η>0 such that
I(y,Tε0)≥ηϕ(y,Tε0), | (3.16) |
where ϕ(y,t)>0 for (y,t)∈¯Ω(0)×[0,T] satisfies (3.3) with R0>1. Set 0<λ0≤12(1−1R0)β(ρ(t)y), and direct calculations show that, I_(y,t)=ηeλ0tϕ(y,t) satisfies
{I_t−dIρ2(t)ΔI_≤β(ρ(t)y)(1−δ0)I_−γ(ρ(t)y)I_−n˙ρ(t)ρ(t)I_, y∈Ω(0),t≥Tε0,I_(y,t)=0, y∈∂Ω(0),t≥Tε0,I_(y,Tε0)≤I(y,Tε0), y∈¯Ω(0). | (3.17) |
It follows from (3.15) and the comparison principle that
I(y,t)≥I_(y,t)=ηeλ0tϕ(y,t)fory∈Ω(0), t≥Tε0, |
therefore, I(y,t)→∞ as t→∞, which contradicts (3.14). This proves statement (ii).
In this section, we first carry out numerical simulations for problem (1.7), (1.8) to illustrate the theoretical results by using Matlab. Let us fix some coefficients. Assume that
dS=0.05, dI=0.02, γ∗=0.1, Λ=2.0, f(S,I)=SS+I, Ω(0)=(0,1),S0(y)=1.3sin(πy)+0.5sin(5πy),I0(y)=1.2sin(πy)+0.5sin(3πy)+0.6sin(5πy) |
and subsequently λ∗=π2, then the asymptotic behaviors of the solution to problem are shown by choosing different ρ(t) and β∗.
Example 1. Fix β∗1=0.27. We first choose ρ1(t)≡1, which means that the habitat is fixed. Direct calculations show that
R0(ρ1)=β∗1(dIρ21λ∗+γ∗)=0.27(0.02π2+0.1)≈0.9079<1. |
It is easily seen from Figure 1 that the infected individual I decays to zero.
Now we choose ρ2(t)=e0.1(1−cos(4t)), it follows from (3.5) that
¯ρ−22=2π∫π20e0.2(cos(4t)−1)dt≈0.8269 |
and
R0(ρ2)=∫π20β∗1dt∫π20(dIρ22(t)λ∗+γ∗)dt=β∗1(dIλ∗¯ρ−22+γ∗)≈1.0257>1. |
It is easily seen from Figure 2 that I stabilizes to a positive periodic steady state.
One can see from the example that the infected individual vanishes in a fixed domain, but persist in a periodically evolving domain.
Example 2. Fix β∗2=0.3. We first choose ρ3(t)≡1 and consider the corresponding problem in the fixed domain. Calculations show that
R0(ρ3)=β∗2(dIρ23λ∗+γ∗)=0.3(0.02π2+0.1)≈1.0087>1. |
It is easily seen from Figure 3 that I stabilizes to a positive periodic steady state.
If we choose ρ4(t)=e−0.2(1−cos(4t)), it follows from (3.5) that
¯ρ−24=2π∫π20e0.4(1−cos(4t))dt≈1.5521 |
and
R0(ρ4)=∫π20β∗2dt∫π20(dIρ22(t)λ∗+γ∗)dt=β∗2(dIλ∗¯ρ−24+γ∗)≈0.7382<1. |
It is easily seen from Figure 4 that I decays to zero and the infected individual vanishes eventually.
Results in the example imply that the infected individual spreads in a fixed domain, but vanishes in a periodically evolving domain.
Shifting of habitat for species or expending of infected domain for disease plays considerable biological significance, related problems have been attracting much attention. To explore the impact of the periodic evolution in habitats on the prevention and control of the infectious disease, we study a SIS reaction-diffusion model with periodical and isotropic domain evolution.
We first transform the SIS epidemic model with periodical evolving domain into a reaction-diffusion system on a fixed domain with time-dependent diffusion term, and then introduce the spatial-temporal risk index R0(ρ) by using the next infection operator. R0(ρ) depends on the domain evolution rate ρ(t) and its average value ¯ρ−2:=1T∫T01ρ2(t)dt plays an important role, see the explicit formula (3.5). It is proved in Theorem 3.2 that If R0<1, the disease-free equilibrium (S∗(y,t),0) is globally asymptotically stable for system (1.7), (1.8), while for R0>1, there exists ε0>0 such that any positive solution of system (1.7), (1.8) satisfies lim supt→∞‖(S(y,t),I(y,t))−(S∗(y,t),0)‖≥ε0, which means the disease-free equilibrium (S∗(y,t),0) is unsatble. Moreover, our numerical simulations show that the periodical domain evolution with large evolution rate has a negative effect on the control of the disease (see Figures 1 and 2), and that with small evolution rate has a positive effect on the control of the disease (see Figures 3 and 4). However, mathematically, we can not derive the property of the endemic equilibrium at present, which deserves further study.
We are very grateful to the anonymous referee for careful reading and helpful comments which led to improvements of our original manuscript. The first author is supported by Research Foundation of Young Teachers of Hexi University(QN2018013) and the second author is supported by the NNSF of China (Grant No. 11771381).
The authors declare there is no conflict of interest.
[1] |
M. R. AlZgool, U. Ahmed, S. A. Shah, Q. AlMaamary, N. AlMahmoud, Examining the interplay of HR initiatives, knowledge management, technological capabilities and product innovation, J. Secur. Sustain. Issues, 10 (2020), 735–748. http://doi.org/10.9770/jssi.2020.10.2(29) doi: 10.9770/jssi.2020.10.2(29)
![]() |
[2] |
M. Tayyab, M. S. Habib, M. S. Jajja, B. Sarkar, Economic assessment of a serial production system with random imperfection and shortages: A step towards sustainability, Comput. Ind. Eng., 171 (2022), 108398. https://doi.org/10.1016/j.cie.2022.108398 doi: 10.1016/j.cie.2022.108398
![]() |
[3] |
A. S. Mahapatra, M. S. Mahapatra, B. Sarkar, S. K. Majumder, Benefit of preservation technology with promotion and time-dependent deterioration under fuzzy learning, Expert Syst. Appl., 201 (2022), 117169. https://doi.org/10.1016/j.eswa.2022.117169 doi: 10.1016/j.eswa.2022.117169
![]() |
[4] |
S. Khalilpourazari, A. Mirzazadeh, G. W. Weber, S. H. R. Pasandideh, A robust fuzzy approach for constrained multi-product economic production quantity with imperfect items and rework process, Optimization, 69 (2020), 63–90. https://doi.org/10.1080/02331934.2019.1630625 doi: 10.1080/02331934.2019.1630625
![]() |
[5] |
B. Sarkar, M. Ullah, M. Sarkar, Environmental and economic sustainability through innovative green products by remanufacturing, J. Clean. Prod., 332 (2022), 129813. https://doi.org/10.1016/j.jclepro.2021.129813 doi: 10.1016/j.jclepro.2021.129813
![]() |
[6] |
S. Kumar, M. Sigroha, K. Kumar, B. Sarkar, Manufacturing/remanufacturing based supply chain management under advertisements and carbon emission process, RAIRO- Oper. Res., 56 (2022), 831–851. https://doi.org/10.1051/ro/2021189 doi: 10.1051/ro/2021189
![]() |
[7] |
R. Lotfi, Y. Z. Mehrjerdi, M. S. Pishvaee, A. Sadeghieh, G. W. Weber, A robust optimization model for sustainable and resilient closed-loop supply chain network design considering conditional value at risk, Numer. Algebra, Control. Optim., 11 (2021), 221–253. https://doi.org/10.3934/naco.2020023 doi: 10.3934/naco.2020023
![]() |
[8] |
T. Paksoy, T. Bektaş, E. Özceylan, Operational and environmental performance measures in a multi-product closed-loop supply chain, Transport Res E-Log, 47 (2011), 532–546. https://doi.org/10.1016/j.tre.2010.12.001 doi: 10.1016/j.tre.2010.12.001
![]() |
[9] |
A. Mondal, S. K. Roy, Multi-objective sustainable opened-and closed-loop supply chain under mixed uncertainty during COVID-19 pandemic situation, Comput. Ind. Eng., 159 (2021), 107453. https://doi.org/10.1016/j.cie.2021.107453 doi: 10.1016/j.cie.2021.107453
![]() |
[10] |
O. Theophilus, M. A. Dulebenets, J. Pasha, O. F. Abioye, M. Kavoosi, Truck scheduling at cross-docking terminals: A follow-up state-of-the-art review, Sustainability, 11 (2019), 5245. https://doi.org/10.3390/su11195245 doi: 10.3390/su11195245
![]() |
[11] |
J. Van Belle, P. Valckenaers, D. Cattrysse, Cross-docking: State of the art, Omega, 40 (2012), 827–846. https://doi.org/10.1016/j.omega.2012.01.005 doi: 10.1016/j.omega.2012.01.005
![]() |
[12] | S. C. Corp, Cross-docking Trend Report, Whitepaper Series, Saddle Creek Corp: Lakeland, FL, USA, 2011. Available from: 070111DCMwe.pdf (distributiongroup.com) |
[13] | G. Stalk, P. Evans, L. E. Shulman, Competing on capabilities: The new rules of corporate strategy, Harv. Bus. Rev., 70 (1992), 57–69. |
[14] | N. S. Ankem, Models for performance analysis of a cross-dock, Master Thesis, University Park, Pennsylvania: Pennsylvania State University, USA, 2017. |
[15] |
Y. Kuo, Optimizing truck sequencing and truck dock assignment in a cross docking system, Expert Syst. Appl., 40 (2013), 5532–5541. https://doi.org/10.1016/j.eswa.2013.04.019 doi: 10.1016/j.eswa.2013.04.019
![]() |
[16] | J. J. Bartholdi Ⅲ, S. T. Hackman, Warehouse and Distribution Science Release 0.94, Supply Chain and Logistics Institute, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, 2011. |
[17] |
K. K. Yang, J. Balakrishnan, C. H. Cheng, An analysis of factors affecting cross docking operations, J. Bus. Logist., 31 (2011), 121–148. https://doi.org/10.1002/j.2158-1592.2010.tb00131.x doi: 10.1002/j.2158-1592.2010.tb00131.x
![]() |
[18] |
J. J. Bartholdi Ⅲ, K. R. Gue, Best shape of a cross-dock, Transp. Sci., 38 (2004), 235–244. https://doi.org/10.1287/trsc.1030.0077 doi: 10.1287/trsc.1030.0077
![]() |
[19] |
I. F. Vis, K. J. Roodbergen, Positioning of goods in a cross-docking environment, Comput. Ind. Eng., 54 (2008), 677–689. https://doi.org/10.1016/j.cie.2007.10.004 doi: 10.1016/j.cie.2007.10.004
![]() |
[20] |
J. J. Bartholdi Ⅲ, K. R. Gue, Reducing labor costs in an LTL crossdocking terminal, Oper. Res., 48 (2000), 823–832. https://doi.org/10.1287/opre.48.6.823.12397 doi: 10.1287/opre.48.6.823.12397
![]() |
[21] |
J. F. Wang, A. Regan, Real-time trailer scheduling for cross dock operations, Transp. J., 47 (2008), 5–20. https://doi.org/10.5325/transportationj.47.2.0005 doi: 10.5325/transportationj.47.2.0005
![]() |
[22] |
G. Tadumadze, N. Boysen, S. Emde, F. Weidinger, Integrated truck and workforce scheduling to accelerate the unloading of trucks, Eur. J. Oper. Res., 278 (2019), 343–362. https://doi.org/10.1016/j.ejor.2019.04.024 doi: 10.1016/j.ejor.2019.04.024
![]() |
[23] | H. G. Resat, P. Berten, Z. Kilek, M. B. Kalay, Design and development of robust optimization model for sustainable cross-docking systems: A case study in electrical devices manufacturing company, In: Muthu, SS (eds) Sustainable Packaging. Environmental Footprints and Eco-design of Products and Processes. Springer, Singapore, (2021), 203–224. https://doi.org/10.1007/978-981-16-4609-6_8 |
[24] |
E. E. Zachariadis, A. I. Nikolopoulou, E. G. Manousakis, P. P. Repoussis, C. D. Tarantilis, The vehicle routing problem with capacitated cross-docking, Expert Syst. Appl., 196 (2022), 116620. https://doi.org/10.1016/j.eswa.2022.116620 doi: 10.1016/j.eswa.2022.116620
![]() |
[25] |
M. Madani-Isfahani, R. Tavakkoli-Moghaddam, B. Naderi, Multiple cross-docks scheduling using two meta-heuristic algorithms, Comput. Ind. Eng., 74 (2014), 129–138. https://doi.org/10.1016/j.cie.2014.05.009 doi: 10.1016/j.cie.2014.05.009
![]() |
[26] |
S. B. Choi, B. K. Dey, S. J. Kim, B. Sarkar, Intelligent servicing strategy for an online-to-offline (O2O) supply chain under demand variability and controllable lead time, RAIRO- Oper. Res., 56 (2022), 1623–1653. https://doi.org/10.1051/ro/2022026 doi: 10.1051/ro/2022026
![]() |
[27] |
B. Pal, A. Sarkar, B. Sarkar, Optimal decisions in a dual-channel competitive green supply chain management under promotional effort, Expert Syst. Appl., (2023), 118315. https://doi.org/10.1016/j.eswa.2022.118315 doi: 10.1016/j.eswa.2022.118315
![]() |
[28] |
B. Sarkar, S. Bhuniya, A sustainable flexible manufacturing–remanufacturing model with improved service and green investment under variable demand, Expert Syst. Appl., 202 (2022), 117154. https://doi.org/10.1016/j.eswa.2022.117154 doi: 10.1016/j.eswa.2022.117154
![]() |
[29] |
M. S. Habib, M. Omair, M. B. Ramzan, T. N. Chaudhary, M. Farooq, B. Sarkar, A robust possibilistic flexible programming approach toward a resilient and cost-efficient biodiesel supply chain network, J. Clean. Prod., 366 (2022), 132752. https://doi.org/10.1016/j.jclepro.2022.132752 doi: 10.1016/j.jclepro.2022.132752
![]() |
[30] |
B. Sarkar, A. Debnath, A. S. Chiu, W. Ahmed, Circular economy-driven two-stage supply chain management for nullifying waste, J. Clean. Prod., 339 (2022), 130513. https://doi.org/10.1016/j.jclepro.2022.130513 doi: 10.1016/j.jclepro.2022.130513
![]() |
[31] |
A. Garai, B. Sarkar, Economically independent reverse logistics of customer-centric closed-loop supply chain for herbal medicines and biofuel, J. Clean. Prod., 334 (2022), 129977. https://doi.org/10.1016/j.jclepro.2021.129977 doi: 10.1016/j.jclepro.2021.129977
![]() |
[32] | T. Wu, J. Blackhurst, Modelling supply chain information and material perturbations, in Supply Chain Management and Knowledge Management (A. Dwivedi and T. Butcher eds), Palgrave Macmillan, London, (2009), 107–123. https://doi.org/10.1057/9780230234956_6 |
[33] |
B. Ponte, J. Costas, J. Puche, R. Pino, D. de la Fuente, The value of lead time reduction and stabilization: A comparison between traditional and collaborative supply chains, Transport Res. E-Log., 111 (2018), 165–185. https://doi.org/10.1016/j.tre.2018.01.014 doi: 10.1016/j.tre.2018.01.014
![]() |
[34] |
E. B. Tirkolaee, A. Goli, A. Faridnia, M. Soltani, G. W. Weber, Multi-objective optimization for the reliable pollution-routing problem with cross-dock selection using Pareto-based algorithms, J. Clean. Prod., 276 (2020), 122927. https://doi.org/10.1016/j.jclepro.2020.122927 doi: 10.1016/j.jclepro.2020.122927
![]() |
[35] |
J. J. Vogt, The Successful cross-dock based supply chain, J. Bus. Logist., 31 (2010), 99–119. https://doi.org/10.1002/j.2158-1592.2010.tb00130.x doi: 10.1002/j.2158-1592.2010.tb00130.x
![]() |
[36] |
O. Theophilus, M. A. Dulebenets, J. Pasha, Y. Y. Lau, A. M. Fathollahi-Fard, A. Mazaheri, Truck scheduling optimization at a cold-chain cross-docking terminal with product perishability considerations, Comput. Ind. Eng., 156 (2021), 107240. https://doi.org/10.1016/j.cie.2021.107240 doi: 10.1016/j.cie.2021.107240
![]() |
[37] |
M. R. Galbreth, J. A. Hill, S. Handley, An investigation of the value of cross-docking for supply chain management, J. Bus. Logist., 29 (2008), 225–239. https://doi.org/10.1002/j.2158-1592.2008.tb00076.x doi: 10.1002/j.2158-1592.2008.tb00076.x
![]() |
[38] |
M. Vanajakumari, H. Sun, A. Jones, C. Sriskandarajah, Supply chain planning: A case for Hybrid Cross-Docks, Omega, 108 (2022), 102585. https://doi.org/10.1016/j.omega.2021.102585 doi: 10.1016/j.omega.2021.102585
![]() |
[39] |
D. Mardanya, G. Maity, S. K. Roy, The multi-objective multi-item just-in-time transportation problem, Optimization, (2021), 1–32. https://doi.org/10.1080/02331934.2021.1963246 doi: 10.1080/02331934.2021.1963246
![]() |
[40] |
P. B. Castellucci, A. M. Costa, F. Toledo, Network scheduling problem with cross-docking and loading constraints, Comput Oper Res, 132 (2021), 105271. https://doi.org/10.1016/j.cor.2021.105271 doi: 10.1016/j.cor.2021.105271
![]() |
[41] |
B. K. Giri, S. K. Roy, Neutrosophic multi-objective green four-dimensional fixed-charge transportation problem, Int. J. Mach. Learn. Cybern., (2022), 1–24. https://doi.org/10.1007/s13042-022-01582-y doi: 10.1007/s13042-022-01582-y
![]() |
[42] |
S. K. Das, M. Pervin, S. K. Roy, G. W. Weber, Multi-objective solid transportation-location problem with variable carbon emission in inventory management: a hybrid approach, Ann. Oper. Res., (2021), 1–27. https://doi.org/10.1007/s10479-020-03809-z doi: 10.1007/s10479-020-03809-z
![]() |
[43] |
A. M. Fathollahi-Fard, M. Ranjbar-Bourani, N. Cheikhrouhou, M. Hajiaghaei-Keshteli, Novel modifications of social engineering optimizer to solve a truck scheduling problem in a cross-docking system, Comput. Ind. Eng., 137 (2019), 106103, https://doi.org/10.1016/j.cie.2019.106103 doi: 10.1016/j.cie.2019.106103
![]() |
[44] |
M. A. Dulebenets, A diploid evolutionary algorithm for sustainable truck scheduling at a cross-docking facility, Sustainability, 10 (2018), 1333. https://doi.org/10.3390/su10051333 doi: 10.3390/su10051333
![]() |
[45] |
M. A. Dulebenets, A comprehensive evaluation of weak and strong mutation mechanisms in evolutionary algorithms for truck scheduling at cross-docking terminals, IEEE Access, 6 (2018), 65635–65650. https://doi.org/10.1109/ACCESS.2018.2874439 doi: 10.1109/ACCESS.2018.2874439
![]() |
[46] |
M. A. Dulebenets, An adaptive polyploid memetic algorithm for scheduling trucks at a cross-docking terminal, Inf. Sci., 565 (2021), 390–421. https://doi.org/10.1016/j.ins.2021.02.039 doi: 10.1016/j.ins.2021.02.039
![]() |
[47] |
G. C. Issi, R. Linfati, J. W. Escobar, Mathematical optimization model for truck scheduling in a distribution center with a mixed service-mode dock area, J. Adv. Transp., 2020 (2020). https://doi.org/10.1155/2020/8813372 doi: 10.1155/2020/8813372
![]() |
[48] |
A. H. Goodarzi, R. Tavakkoli-Moghaddam, A. Amini, A new bi-objective vehicle routing-scheduling problem with cross-docking: mathematical model and algorithms., Comput. Ind. Eng., 149 (2020), 106832. https://doi.org/10.1016/j.cie.2020.106832 doi: 10.1016/j.cie.2020.106832
![]() |
[49] |
F. Heidari, S. H. Zegordi, R. Tavakkoli-Moghaddam, Modeling truck scheduling problem at a cross-dock facility through a bi-objective bi-level optimization, J. Intell. Manuf., 29 (2018), 1155–1170. https://doi.org/10.1007/s10845-015-1160-3 doi: 10.1007/s10845-015-1160-3
![]() |
[50] |
W. Wisittipanich, T. Irohara, P. Hengmeechai, Truck scheduling problems in the cross docking network, Int. J. Logist. Syst. Manag., 33 (2019), 420–439. https://doi.org/10.1504/IJLSM.2019.101164 doi: 10.1504/IJLSM.2019.101164
![]() |
[51] |
A. Shahmardan, M. S. Sajadieh, Truck scheduling in a multi-door cross-docking center with partial unloading—Reinforcement learning-based simulated annealing approaches, Comput. Ind. Eng., 139 (2020), 106134. https://doi.org/10.1016/j.cie.2019.106134 doi: 10.1016/j.cie.2019.106134
![]() |
[52] |
S. I. Sayed, I. Contreras, J. A. Diaz, D. E. Luna, Integrated cross-dock door assignment and truck scheduling with handling times, TOP, 28 (2020), 705–727. https://doi.org/10.1007/s11750-020-00556-z doi: 10.1007/s11750-020-00556-z
![]() |
[53] |
H. Khorshidian, M. A. Shirazi, S. M. F. Ghomi, An intelligent truck scheduling and transportation planning optimization model for product portfolio in a cross dock, J. Intell. Manuf., 30 (2019), 163–184. https://doi.org/10.1007/s10845-016-1229-7 doi: 10.1007/s10845-016-1229-7
![]() |
[54] |
A. Motaghedi-Larijani, Solving the number of cross-dock open doors optimization problem by combination of NSGA-Ⅱ and multi-objective simulated annealing, Appl. Soft Comput., 128 (2022), 109448. https://doi.org/10.1016/j.asoc.2022.109448 doi: 10.1016/j.asoc.2022.109448
![]() |
[55] |
B. Werners, T. Wülfing, Robust optimization of internal transports at a parcel sorting center operated by Deutsche Post World Net, Eur. J. Oper. Res., 201 (2010), 419–426. https://doi.org/10.1016/j.ejor.2009.02.035 doi: 10.1016/j.ejor.2009.02.035
![]() |
[56] |
F. Essghaier, H. Allaoui, G. Goncalves, Truck to door assignment in a shared cross-dock under uncertainty, Expert Syst. Appl., 182 (2021), 114889. https://doi.org/10.1016/j.eswa.2021.114889 doi: 10.1016/j.eswa.2021.114889
![]() |
[57] |
S. Gelareh, F. Glover, O. Guemri, S. Hanafi, P. Nduwayo, R. Todosijević, A comparative study of formulations for a cross-dock door assignment problem, Omega, 91 (2020), 102015. https://doi.org/10.1016/j.omega.2018.12.004 doi: 10.1016/j.omega.2018.12.004
![]() |
[58] |
M. T. Kyi, S. S. Maw, L. L. Naing, Mathematical estimation for maximum flow in electricity distribution network by Ford-Fulkerson iteration algorithm, Int. J. Sci. Res. Publ., 9 (2019), https://doi.org/10.29322/IJSRP.9.08.2019.p9229 doi: 10.29322/IJSRP.9.08.2019.p9229
![]() |
[59] |
M. T. Kyi, L. L. Naing, Application of Ford-Fulkerson algorithm to maximum flow in water distribution pipeline network, Int. J Sci. Res. Publ., 8 (2018), https://doi.org/10.29322/IJSRP.8.12.2018.p8441 doi: 10.29322/IJSRP.8.12.2018.p8441
![]() |
[60] |
A. Özmen, E. Kropat, G. W. Weber, Robust optimization in spline regression models for multi-model regulatory networks under polyhedral uncertainty, Optimization, 66 (2017), 2135–2155. https://doi.org/10.1080/02331934.2016.1209672 doi: 10.1080/02331934.2016.1209672
![]() |
[61] |
A. Bellanger, S. Hanafi, C. Wilbaut, Three-stage hybrid-flowshop model for cross-docking, Comput Oper Res, 40 (2013), 1109–1121. https://doi.org/10.1016/j.cor.2012.11.009 doi: 10.1016/j.cor.2012.11.009
![]() |
[62] |
C. Daquin, H. Allaoui, G. Goncalves, T. Hsu, Variable neighborhood search based algorithms for crossdock truck assignment, RAIRO Oper. Res., 55 (2021), S2291–S2323. https://doi.org/10.1051/ro/2020087 doi: 10.1051/ro/2020087
![]() |
[63] | L. R. J. Ford, D. R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, NJ. 1962 |
[64] |
J. Edmonds, R. M. Karp, Theoretical improvements in algorithmic efficiency for network flow problems, J. ACM, 19 (1972), 248–264. https://doi.org/10.1145/321694.321699 doi: 10.1145/321694.321699
![]() |
[65] |
C. Jain, D. Garg, Improved Edmond Karp algorithm for network flow problem, Int. J. Comput. Appl., 37 (2012), 48–53. https://doi.org/10.5120/4576-6624 doi: 10.5120/4576-6624
![]() |
[66] |
K. K. Mallick, A. R. Khan, M. M. Ahmed, M. S. Arefin, M. S. Uddin, Modified Edmonds-Karp algorithm to solve maximum flow problem, Open J. App. Sci., 6 (2016), 131–140. https://doi.org/10.4236/ojapps.2016.62014 doi: 10.4236/ojapps.2016.62014
![]() |
[67] |
Y. Peretz, Y. Fischler, A fast parallel max-flow algorithm, J. Parallel Distrib. Comput., 169 (2022), 226–241. https://doi.org/10.1016/j.jpdc.2022.07.003 doi: 10.1016/j.jpdc.2022.07.003
![]() |
[68] |
M. Bulut, E. Özcan, Optimization of electricity transmission by Ford–Fulkerson algorithm, Sustain. Energy, Grids Netw., 28 (2021), 100544. https://doi.org/10.1016/j.segan.2021.100544 doi: 10.1016/j.segan.2021.100544
![]() |
[69] |
M. S. Sabbagh, H. Ghafari, S. R. Mousavi, A new hybrid algorithm for the balanced transportation problem, Comput. Ind. Eng., 82 (2015), 115–126. https://doi.org/10.1016/j.cie.2015.01.018 doi: 10.1016/j.cie.2015.01.018
![]() |
[70] |
D. Goldfarb, Z. Jin, A new scaling algorithm for the minimum cost network flow problem, Oper. Res. Lett., 25 (1999), 205–211. https://doi.org/10.1016/S0167-6377(99)00047-4 doi: 10.1016/S0167-6377(99)00047-4
![]() |
[71] |
H. Bui, E. S. Jung, V. Vishwanath, A. Johnson, J. Leigh, M. E. Papka, Improving sparse data movement performance using multiple paths on the Blue Gene/Q supercomputer, Parallel Comput., 51 (2016), 3–16. https://doi.org/10.1016/j.parco.2015.09.002 doi: 10.1016/j.parco.2015.09.002
![]() |
[72] |
R. M. Kaplan, An improved algorithm for multi-way trading for exchange and barter, Electron. Commer. Res. Appl., 10 (2011), 67–74. https://doi.org/10.1016/j.elerap.2010.08.001 doi: 10.1016/j.elerap.2010.08.001
![]() |
[73] |
G. R. Waissi, Worst case behavior of the Dinic algorithm, Appl. Math. Lett., 4 (1991), 57–60. https://doi.org/10.1016/0893-9659(91)90145-L doi: 10.1016/0893-9659(91)90145-L
![]() |
1. | Yachun Tong, Zhigui Lin, Spatial diffusion and periodic evolving of domain in an SIS epidemic model, 2021, 61, 14681218, 103343, 10.1016/j.nonrwa.2021.103343 | |
2. | Chengxia Lei, Yi Shen, Guanghui Zhang, Yuxiang Zhang, Analysis on a diffusive SEI epidemic model with/without immigration of infected hosts, 2021, 14, 1937-1632, 4259, 10.3934/dcdss.2021131 | |
3. | Wenxuan Li, Suli Liu, Dynamic analysis of a stochastic epidemic model incorporating the double epidemic hypothesis and Crowley-Martin incidence term, 2023, 31, 2688-1594, 6134, 10.3934/era.2023312 | |
4. | Qiang Wen, Guo-qiang Ren, Bin Liu, Spontaneous Infection and Periodic Evolving of Domain in a Diffusive SIS Epidemic Model, 2024, 40, 0168-9673, 164, 10.1007/s10255-024-1107-6 | |
5. | Jie Wang, Ruirui Yang, Jian Wang, Jianxiong Cao, Threshold dynamics scenario of a plants-pollinators cooperative system with impulsive effect on a periodically evolving domain, 2024, 35, 0956-7925, 797, 10.1017/S0956792524000135 |