Loading [MathJax]/jax/element/mml/optable/MathOperators.js
Research article Special Issues

Bus timetable optimization model in response to the diverse and uncertain requirements of passengers for travel comfort

  • Received: 25 November 2022 Revised: 17 February 2023 Accepted: 21 February 2023 Published: 24 February 2023
  • Most existing public transit systems have a fixed dispatching and service mode, which cannot effectively allocate resources from the perspective of the interests of all participants, resulting in resource waste and dissatisfaction. Low passenger satisfaction leads to a considerable loss of bus passengers and further reduces the income of bus operators. This study develops an optimization model for bus schedules that considers vehicle types and offers two service levels based on heterogeneous passenger demands. In this process, passenger satisfaction, bus company income, and government subsidies are considered. A bilevel model is proposed with a lower-level passenger ride simulation model and an upper-level multiobjective optimization model to maximize the interests of bus companies, passengers, and the government. To verify the effectiveness of the proposed methodology, a real-world case from Guangzhou is presented and analyzed using the nondominated sorting genetic algorithm-Ⅱ (NSGA-Ⅱ), and the related Pareto front is obtained. The results show that the proposed bus operation system can effectively increase the benefits for bus companies, passengers, and the government.

    Citation: Peiqun Lin, Chenxing He, Lingshu Zhong, Mingyang Pei, Chuhao Zhou, Yang Liu. Bus timetable optimization model in response to the diverse and uncertain requirements of passengers for travel comfort[J]. Electronic Research Archive, 2023, 31(4): 2315-2336. doi: 10.3934/era.2023118

    Related Papers:

    [1] Qian Lin, Yan Zhu . Unicyclic graphs with extremal exponential Randić index. Mathematical Modelling and Control, 2021, 1(3): 164-171. doi: 10.3934/mmc.2021015
    [2] Zhen Lin . On the sum of powers of the Aα-eigenvalues of graphs. Mathematical Modelling and Control, 2022, 2(2): 55-64. doi: 10.3934/mmc.2022007
    [3] Iman Malmir . Novel closed-loop controllers for fractional nonlinear quadratic systems. Mathematical Modelling and Control, 2023, 3(4): 345-354. doi: 10.3934/mmc.2023028
    [4] Zhibo Cheng, Pedro J. Torres . Periodic solutions of the Lp-Minkowski problem with indefinite weight. Mathematical Modelling and Control, 2022, 2(1): 7-12. doi: 10.3934/mmc.2022002
    [5] Mrutyunjaya Sahoo, Dhabaleswar Mohapatra, S. Chakraverty . Wave solution for time fractional geophysical KdV equation in uncertain environment. Mathematical Modelling and Control, 2025, 5(1): 61-72. doi: 10.3934/mmc.2025005
    [6] Vladimir Stojanovic . Fault-tolerant control of a hydraulic servo actuator via adaptive dynamic programming. Mathematical Modelling and Control, 2023, 3(3): 181-191. doi: 10.3934/mmc.2023016
    [7] Jiaquan Huang, Zhen Jia, Peng Zuo . Improved collaborative filtering personalized recommendation algorithm based on k-means clustering and weighted similarity on the reduced item space. Mathematical Modelling and Control, 2023, 3(1): 39-49. doi: 10.3934/mmc.2023004
    [8] Qian Wang, Xue Han . Comparing the number of ideals in quadratic number fields. Mathematical Modelling and Control, 2022, 2(4): 268-271. doi: 10.3934/mmc.2022025
    [9] Yongming Li, Shou Ma, Kunting Yu, Xingli Guo . Vehicle kinematic and dynamic modeling for three-axles heavy duty vehicle. Mathematical Modelling and Control, 2022, 2(4): 176-184. doi: 10.3934/mmc.2022018
    [10] Yanchao He, Yuzhen Bai . Finite-time stability and applications of positive switched linear delayed impulsive systems. Mathematical Modelling and Control, 2024, 4(2): 178-194. doi: 10.3934/mmc.2024016
  • Most existing public transit systems have a fixed dispatching and service mode, which cannot effectively allocate resources from the perspective of the interests of all participants, resulting in resource waste and dissatisfaction. Low passenger satisfaction leads to a considerable loss of bus passengers and further reduces the income of bus operators. This study develops an optimization model for bus schedules that considers vehicle types and offers two service levels based on heterogeneous passenger demands. In this process, passenger satisfaction, bus company income, and government subsidies are considered. A bilevel model is proposed with a lower-level passenger ride simulation model and an upper-level multiobjective optimization model to maximize the interests of bus companies, passengers, and the government. To verify the effectiveness of the proposed methodology, a real-world case from Guangzhou is presented and analyzed using the nondominated sorting genetic algorithm-Ⅱ (NSGA-Ⅱ), and the related Pareto front is obtained. The results show that the proposed bus operation system can effectively increase the benefits for bus companies, passengers, and the government.



    Let C denote the complex plane and Cn the n-dimensional complex Euclidean space with an inner product defined as z,w=nj=1zj¯wj. Let B(a,r)={zCn:|za|<r} be the open ball of Cn. In particular, the open unit ball is defined as B=B(0,1).

    Let H(B) denote the set of all holomorphic functions on B and S(B) the set of all holomorphic self-mappings of B. For given φS(B) and uH(B), the weighted composition operator on or between some subspaces of H(B) is defined by

    Wu,φf(z)=u(z)f(φ(z)).

    If u1, then Wu,φ is reduced to the composition operator usually denoted by Cφ. If φ(z)=z, then Wu,φ is reduced to the multiplication operator usually denoted by Mu. Since Wu,φ=MuCφ, Wu,φ can be regarded as the product of Mu and Cφ.

    If n=1, B becomes the open unit disk in C usually denoted by D. Let Dm be the mth differentiation operator on H(D), that is,

    Dmf(z)=f(m)(z),

    where f(0)=f. D1 denotes the classical differentiation operator denoted by D. As expected, there has been some considerable interest in investigating products of differentiation and other related operators. For example, the most common products DCφ and CφD were extensively studied in [1,10,11,12,13,23,25,26], and the products

    MuCφD,CφMuD,MuDCφ,CφDMu,DMuCφ,DCφMu (1.1)

    were also extensively studied in [14,18,22,27]. Following the study of the operators in (1.1), people naturally extend to study the operators (see [5,6,30])

    MuCφDm,CφMuDm,MuDmCφ,CφDmMu,DmMuCφ,DmCφMu.

    Other examples of products involving differentiation operators can be found in [7,8,19,32] and the related references.

    As studying on the unit disk becomes more mature, people begin to become interested in exploring related properties on the unit ball. One method for extending the differentiation operator to Cn is the radial derivative operator

    f(z)=nj=1zjfzj(z).

    Naturally, replacing D by in (1.1), we obtain the following operators

    MuCφ,CφMu,MuCφ,CφMu,MuCφ,CφMu. (1.2)

    Recently, these operators have been studied in [31]. Other operators involving radial derivative operators have been studied in [21,33,34].

    Interestingly, the radial derivative operator can be defined iteratively, namely, mf can be defined as mf=(m1f). Similarly, using the radial derivative operator can yield the related operators

    MuCφm,CφMum,MumCφ,CφmMu,mMuCφ,mCφMu. (1.3)

    Clearly, the operators in (1.3) are more complex than those in (1.2). Since CφMum=MuφCφm, the operator MuCφm can be regarded as the simplest one in (1.3) which was first studied and denoted as mu,φ in [24]. Recently, it has been studied again because people need to obtain more properties about spaces to characterize its properties (see [29]).

    To reconsider the operator CφmMu, people find the fact

    CφmMu=mi=0Cimi(miu)φ,φ. (1.4)

    Motivated by (1.4), people directly studied the sum operator (see [2,28])

    Smu,φ=mi=0MuiCφi,

    where uiH(B), i=¯0,m, and φS(B). Particularly, if we set u0um10 and um=u, then Smu,φ=MuCφm; if we set u0um10 and um=uφ, then Smu,φ=CφMum. In [28], Stević et al. studied the operators Smu,φ from Hardy spaces to weighted-type spaces on the unit ball and obtained the following results.

    Theorem A. Let mN, ujH(B), j=¯0,m, φS(B), and μ a weight function on B. Then, the operator Smu,φ:HpHμ is bounded and

    supzBμ(z)|uj(φ(z))||φ(z)|<+,j=¯1,m, (1.5)

    if and only if

    I0=supzBμ(z)|u0(z)|(1|φ(z)|2)np<+

    and

    Ij=supzBμ(z)|uj(z)||φ(z)|(1|φ(z)|2)np+j<+,j=¯1,m.

    Theorem B. Let mN, ujH(B), j=¯0,m, φS(B), and μ a weight function on B. Then, the operator Smu,φ:HpHμ is compact if and only if it is bounded,

    lim|φ(z)|1μ(z)|u0(z)|(1|φ(z)|2)np=0

    and

    lim|φ(z)|1μ(z)|uj(z)||φ(z)|(1|φ(z)|2)np+j=0,j=¯1,m.

    It must be mentioned that we find that the necessity of Theorem A requires (1.5) to hold. Inspired by [2,28], here we use a new method and technique without (1.5) to study the sum operator Smu,φ from logarithmic Bergman-type space to weighted-type space on the unit ball. To this end, we need to introduce the well-known Bell polynomial (see [3])

    Bm,k(x1,x2,,xmk+1)=m!mk1i=1ji!mk1i=1(xii!)ji,

    where all non-negative integer sequences j1, j2,,jmk+1 satisfy

    mk+1i=1ji=kandmk+1i=1iji=m.

    In particular, when k=0, one can get B0,0=1 and Bm,0=0 for any mN. When k=1, one can get Bi,1=xi. When m=k=i, Bi,i=xi1 holds.

    In this section, we need to introduce logarithmic Bergman-type space and weighted-type space. Here, a bounded positive continuous function on B is called a weight. For a weight μ, the weighted-type space Hμ consists of all fH(B) such that

    fHμ=supzBμ(z)|f(z)|<+.

    With the norm Hμ, Hμ becomes a Banach space. In particular, if μ(z)=(1|z|2)σ(σ>0), the space Hμ is called classical weighted-type space usually denoted by Hσ. If μ1, then space Hμ becomes the bounded holomorphic function space usually denoted by H.

    Next, we need to present the logarithmic Bergman-type space on B (see [4] for the unit disk case). Let dv be the standardized Lebesgue measure on B. The logarithmic Bergman-type space Apwγ,δ consists of all fH(B) such that

    fpApwγ,δ=B|f(z)|pwγ,δ(z)dv(z)<+,

    where 1<γ<+, δ0, 0<p<+ and wγ,δ(z) is defined by

    wγ,δ(z)=(log1|z|)γ[log(11log|z|)]δ.

    When p1, Apwγ,δ is a Banach space. While 0<p<1, it is a Fréchet space with the translation invariant metric ρ(f,g)=fgpApωγ,δ.

    Let φS(B), 0r<1, 0γ<, δ0, and aB{φ(0)}. The generalized counting functions are defined as

    Nφ,γ,δ(r,a)=zj(a)φ1(a)wγ,δ(zj(a)r)

    where |zj(a)|<r, counting multiplicities, and

    Nφ,γ,δ(a)=Nφ,γ,δ(1,a)=zj(a)φ1(a)wγ,δ(zj(a)).

    If φS(D), then the function Nφ,γ,δ has the integral expression: For 1γ<+ and δ0, there is a positive function F(t) satisfying

    Nφ,γ,δ(r,u)=r0F(t)Nφ,1(t,u)dt,r(0,1),uφ(0).

    When φS(D) and δ=0, the generalized counting functions become the common counting functions. Namely,

    Nφ,γ(r,a)=zφ1(a),|z|<r(logr|z|)γ,

    and

    Nφ,γ(a)=Nφ,γ(1,a)=zφ1(a)(log1|z|)γ.

    In [17], Shapiro used the function Nφ,γ(1,a) to characterize the compact composition operators on the weighted Bergman space.

    Let X and Y be two topological spaces induced by the translation invariant metrics dX and dY, respectively. A linear operator T:XY is called bounded if there is a positive number K such that

    dY(Tf,0)KdX(f,0)

    for all fX. The operator T:XY is called compact if it maps bounded sets into relatively compact sets.

    In this paper, j=¯k,l is used to represent j=k,...,l, where k,lN0 and kl. Positive numbers are denoted by C, and they may vary in different situations. The notation ab (resp. ab) means that there is a positive number C such that aCb (resp. aCb). When ab and ba, we write ab.

    In this section, we obtain some properties on the logarithmic Bergman-type space. First, we have the following point-evaluation estimate for the functions in the space.

    Theorem 3.1. Let 1<γ<+, δ0, 0<p<+ and 0<r<1. Then, there exists a positive number C=C(γ,δ,p,r) independent of zK={zB:|z|>r} and fApwγ,δ such that

    |f(z)|C(1|z|2)γ+n+1p[log(11log|z|)]δpfApwγ,δ. (3.1)

    Proof. Let zB. By applying the subharmonicity of the function |f|p to Euclidean ball B(z,r) and using Lemma 1.23 in [35], we have

    |f(z)|p1v(B(z,r))B(z,r)|f(w)|pdv(w)C1,r(1|z|2)n+1B(z,r)|f(w)|pdv(w). (3.2)

    Since r<|z|<1 and 1|w|21|z|2, we have

    log1|w|1|w|1|z|log1|z| (3.3)

    and

    log(1log1|w|)log(1log1|z|). (3.4)

    From (3.3) and (3.4), it follows that there is a positive constant C2,r such that wγ,δ(z)C2,rwγ,δ(w) for all wB(z,r). From this and (3.2), we have

    |f(z)|pC1,rC2,r(1|z|2)n+1wγ,δ(z)B(z,r)|f(w)|pwγ,δ(w)dv(w)C1,rC2,r(1|z|2)n+1wγ,δ(z)fpApwγ,δ. (3.5)

    From (3.5) and the fact log1|z|1|z|1|z|2, the following inequality is right with a fixed constant C3,r

    |f(z)|pC1,rC2,rC3,r(1|z|2)n+1+γ[log(11log|z|)]δfpApwγ,δ.

    Let C=C1,rC2,rC3,rp. Then the proof is end.

    Theorem 3.2. Let mN, 1<γ<+, δ0, 0<p<+ and 0<r<1. Then, there exists a positive constant Cm=C(γ,δ,p,r,m) independent of zK and fApwγ,δ such that

    |mf(z)zi1zi2zim|Cm(1|z|2)γ+n+1p+m[log(11log|z|)]δpfApwγ,δ. (3.6)

    Proof. First, we prove the case of m=1. By the definition of the gradient and the Cauchy's inequality, we get

    |f(z)zi||f(z)|˜C1supwB(z,q(1|z|))|f(w)|1|z|, (3.7)

    where i=¯1,n. By using the relations

    1|z|1|z|22(1|z|),
    (1q)(1|z|)1|w|(q+1)(1|z|),

    and

    log(11log|z|)log(11log|w|),

    we obtain the following formula

    |f(w)|˘C1(1|z|2)γ+n+1p[log(11log|z|)]δpfApwγ,δ

    for any wB(z,q(1|z|)). Then,

    supwB(z,q(1|z|))|f(w)|˘C1(1|z|2)γ+n+1p[log(11log|z|)]δpfApwγ,δ.

    From (3.1) and (3.2), it follows that

    |f(z)zi|ˆC1(1|z|2)γ+n+1p+1[log(11log|z|)]δpfApwγ,δ. (3.8)

    Hence, the proof is completed for the case of m=1.

    We will use the mathematical induction to complete the proof. Assume that (3.6) holds for m<a. For convenience, let g(z)=a1f(z)zi1zi2zia1. By applying (3.7) to the function g, we obtain

    |g(z)zi|˜C1supwB(z,q(1|z|))|g(w)|1|z|. (3.9)

    According to the assumption, the function g satisfies

    |g(z)|ˆCa1(1|z|2)γ+n+1p+a1[log(11log|z|)]δpfApwγ,δ.

    By using (3.8), the following formula is also obtained

    |g(z)zi|ˆCa(1|z|2)γ+n+1p+a[log(11log|z|)]δpfApwγ,δ.

    This shows that (3.6) holds for m=a. The proof is end.

    As an application of Theorems 3.1 and 3.2, we give the estimate in z=0 for the functions in Apωγ,δ.

    Corollary 3.1. Let 1<γ<+, δ0, 0<p<+, and 0<r<2/3. Then, for all fApwγ,δ, it follows that

    |f(0)|C(1r2)γ+n+1p[log(11logr)]δpfApwγ,δ, (3.10)

    and

    |mf(0)zl1zlm|Cm(1r2)γ+n+1p+m[log(11logr)]δpfApwγ,δ, (3.11)

    where constants C and Cm are defined in Theorems 3.1 and 3.2, respectively.

    Proof. For fApwγ,δ, from Theorem 3.1 and the maximum module theorem, we have

    |f(0)|max|z|=r|f(z)|C(1r2)γ+n+1p[log(11logr)]δpfApwγ,δ,

    which implies that (3.10) holds. By using the similar method, we also have that (3.11) holds.

    Next, we give an equivalent norm in Apwγ,δ, which extends Lemma 3.2 in [4] to B.

    Theorem 3.3. Let r0[0,1). Then, for every fApwγ,δ, it follows that

    fpApwγ,δBr0B|f(z)|pwγ,δ(z)dv(z). (3.12)

    Proof. If r0=0, then it is obvious. So, we assume that r0(0,1). Integration in polar coordinates, we have

    fpApwγ,δ=2n10wγ,δ(r)r2n1drS|f(rζ)|pdσ(ζ).

    Put

    A(r)=wγ,δ(r)r2n1andM(r,f)=S|f(rζ)|pdσ(ζ).

    Then it is represented that

    fpApwγ,δr00+1r0M(r,f)A(r)dr. (3.13)

    Since M(r,f) is increasing, A(r) is positive and continuous in r on (0,1) and

    limr0A(r)=limx+xγ[log(1+1x)]δe(2n1)x=limx+xγδe(2n1)x=0,

    that is, there is a constant ε>0(ε<r0) such that A(r)<A(ε) for r(0,ε). Then we have

    r00M(r,f)A(r)dr2r01r0maxεrr0A(r)1+r02r0M(r,f)dr2r01r0maxεrr0A(r)minr0r1+r02A(r)1+r02r0M(r,f)A(r)dr1r0M(r,f)A(r)dr. (3.14)

    From (3.13) and (3.14), we obtain the inequality

    fpApwγ,δ1r0M(r,f)A(r)dr.

    The inequality reverse to this is obvious. The asymptotic relationship (3.12) follows, as desired.

    The following integral estimate is an extension of Lemma 3.4 in [4]. The proof is similar, but we still present it for completeness.

    Lemma 3.1. Let 1<γ<+, δ0, β>γδ and 0<r<1. Then, for each fixed wB with |w|>r,

    Bωγ,δ(z)|1z,w|n+β+1dv(z)1(1|w|)βγ[log(11log|w|)]δ.

    Proof. Fix |w| with |w|>r0 (0<r0<1). It is easy to see that

    log1r1rforr0r<1. (3.15)

    By applying Theorem 3.3 with

    fw(z)=1(1z,w)n+β+1

    and using (3.15), the formula of integration in polar coordinates gives

    B1|1z,w|n+β+1ωγ,δ(z)dv(z)1r0M(r,fw)(1r)γ[log(11logr)]δr2n1dr. (3.16)

    By Proposition 1.4.10 in [15], we have

    M(r,fw)1(1r2|w|2)β+1. (3.17)

    From (3.16) and (3.17), we have

    B1|1z,w|β+2nωγ,δ(z)dv(z)1r01(1r2|w|2)β+1(1r)γ[log(11logr)]δr2n1dr1r01(1r|w|)β+1(1r)γ[log(11logr)]δr2n1dr|w|r01(1r|w|)β+1(1r)γ[log(11logr)]δr2n1dr+1|w|1(1r|w|)β+1(1r)γ[log(11logr)]δr2n1dr=I1+I2.

    Since [log(11logr)]δ is decreasing in r on [|w|,1], we have

    I2=1|w|1(1r|w|)β+1(1r)γ[log(11logr)]δr2n1dr1(1|w|)β+1[log(11log|w|)]δ1|w|(1r)γdr1(1|w|)βγ[log(11log|w|)]δ. (3.18)

    On the other hand, we obtain

    I1=|w|r01(1r|w|)β+1(1r)γ[log(11logr)]δr2n1dr|w|r0(1r)γβ1(log21r)δdr.

    If δ=0 and β>γ, then we have

    I1(0)(1|w|)γβ.

    If δ0, then integration by parts gives

    I1(δ)=1γβ(1|w|)γβ(log21|w|)δ+1γβ(1r0)γβ(log21r0)δ+δγβI1(δ1).

    Since δ<0, γβ<0 and

    (log21r)δ1(log21r)δforr0<r<|w|<1,

    we have

    I1(δ)1γβ(1|w|)γβ(log21|w|)δ+δγβI1(δ)

    and from this follows

    I1(δ)(1|w|)γβ(log21|w|)δ(1|w|)γβ[log(11log|w|)]δ

    provided γβδ<0. The proof is finished.

    The following gives an important test function in Apwγ,δ.

    Theorem 3.4. Let 1<γ<+, δ0, 0<p<+ and 0<r<1. Then, for each t0 and wB with |w|>r, the following function is in Apwγ,δ

    fw,t(z)=[log(11log|w|)]δp(1|w|2)δp+t+1(1z,w)γδ+n+1p+t+1.

    Moreover,

    sup{wB:|w|>r}fw,tApwγ,δ1.

    Proof. By Lemma 3.1 and a direct calculation, we have

    fw,tpApwγ,δ=B|[log(11log|w|)]δp(1|w|2)δp+t+1(1z,w)γδ+n+1p+t+1|pwγ,δ(z)dA(z)=(1|w|2)p(t+1)δ[log(11log|w|)]δ×B1|1z,w|γδ+p(t+1)+n+1wγ,δ(z)dA(z)1.

    The proof is finished.

    In this section, for simplicity, we define

    Bi,j(φ(z))=Bi,j(φ(z),φ(z),,φ(z)).

    In order to characterize the compactness of the operator Smu,φ:Apwγ,δHμ, we need the following lemma. It can be proved similar to that in [16], so we omit here.

    Lemma 4.1. Let 1<γ<+, δ0, 0<p<+, mN, ujH(B), j=¯0,m, and φS(B). Then, the bounded operator Smu,φ:Apwγ,δHμ is compact if and only if for every bounded sequence {fk}kN in Apwγ,δ such that fk0 uniformly on any compact subset of B as k, it follows that

    limkSmu,φfkHμ=0.

    The following result was obtained in [24].

    Lemma 4.2. Let s0, wB and

    gw,s(z)=1(1z,w)s,zB.

    Then,

    kgw,s(z)=sPk(z,w)(1z,w)s+k,

    where Pk(w)=sk1wk+p(k)k1(s)wk1+...+p(k)2(s)w2+w, and p(k)j(s), j=¯2,k1, are nonnegative polynomials for s.

    We also need the following result obtained in [20].

    Lemma 4.3. Let s>0, wB and

    gw,s(z)=1(1z,w)s,zB.

    Then,

    kgw,s(z)=kt=1a(k)t(t1j=0(s+j))z,wt(1z,w)s+t,

    where the sequences (a(k)t)t¯1,k, kN, are defined by the relations

    a(k)k=a(k)1=1

    for kN and

    a(k)t=ta(k1)t+a(k1)t1

    for 2tk1,k3.

    The final lemma of this section was obtained in [24].

    Lemma 4.4. If a>0, then

    Dn(a)=|111aa+1a+n1a(a+1)(a+1)(a+2)(a+n1)(a+n)n2k=0(a+k)n2k=0(a+k+1)n2k=0(a+k+n1)|=n1k=1k!.

    Theorem 4.1. Let 1<γ<+, δ0, 0<p<+, mN, ujH(B), j=¯0,m, and φS(B). Then, the operator Smu,φ:Apwγ,δHμ is bounded if and only if

    M0:=supzBμ(z)|u0(z)|(1|φ(z)|2)γ+n+1p[log(11log|φ(z)|)]δp<+ (4.1)

    and

    Mj:=supzBμ(z)|mi=jui(z)Bi,j(φ(z))|(1|φ(z)|2)γ+n+1p+j[log(11log|φ(z)|)]δp<+ (4.2)

    for j=¯1,m.

    Moreover, if the operator Smu,φ:Apwγ,δHμ is bounded, then

    Smu,φApwγ,δHμmj=0Mj. (4.3)

    Proof. Suppose that (4.1) and (4.2) hold. From Theorem 3.1, Theorem 3.2, and some easy calculations, it follows that

    μ(z)|mi=0ui(z)if(φ(z))|μ(z)mi=0|ui(z)||if(φ(z))|=μ(z)|u0(z)||f(φ(z))|+μ(z)|mi=1ij=1(ui(z)nl1=1nlj=1(jfzl1zl2zlj(φ(z))k1,,kjC(i)k1,,kjjt=1φlt(z)))|=μ(z)|u0(z)f(φ(z))|+μ(z)|mj=1mi=j(ui(z)nl1=1nlj=1(jfzl1zl2zlj(φ(z))k1,,kjC(i)k1,,kjjt=1φlt(z)))|μ(z)|u0(z)|(1|φ(z)|2)γ+n+1p[log(11log|φ(z)|)]δpfApwγ,δ+mj=1μ(z)|mi=jui(z)Bi,j(φ(z))|(1|φ(z)|2)γ+n+1p+j[log(11log|φ(z)|)]δpfApwγ,δ=M0fApwγ,δ+mj=1MjfApwγ,δ. (4.4)

    By taking the supremum in inequality (4.4) over the unit ball in the space Apwγ,δ, and using (4.1) and (4.2), we obtain that the operator Smu,φ:Apwγ,δHμ is bounded. Moreover, we have

    Smu,φApwγ,δHμCmj=0Mj, (4.5)

    where C is a positive constant.

    Assume that the operator Smu,φ:Apwγ,δHμ is bounded. Then there exists a positive constant C such that

    Smu,φfHμCfApwγ,δ (4.6)

    for any fApwγ,δ. First, we can take f(z)=1Apwγ,δ, then one has that

    supzBμ(z)|u0(z)|<+. (4.7)

    Similarly, take fk(z)=zjkApwγ,δ, k=¯1,n and j=¯1,m, by (4.7), then

    μ(z)|u0(z)φk(z)j+mi=j(ui(z)Bi,j(φk(z))))|<+ (4.8)

    for any j{1,2,,m}. Since φ(z)B, we have |φ(z)|1. So, one can use the triangle inequality (4.7) and (4.8), the following inequality is true

    supzBμ(z)|mi=jui(z)Bi,j(φ(z))|<+. (4.9)

    Let wB and dk=γ+n+1p+k. For any j{1,2,,m} and constants ck=c(j)k, k=¯0,m, let

    h(j)w(z)=mk=0c(j)kfw,k(z), (4.10)

    where fw,k is defined in Theorem 3.4. Then, by Theorem 3.4, we have

    Lj=supwBh(j)wApwγ,δ<+. (4.11)

    From (4.6), (4.11), and some easy calculations, it follows that

    LjSmu,φApwγ,δHμSmu,φh(j)φ(w)Hμ=supzBμ(z)|mi=0u0(z)h(j)φ(w)(φ(z))|μ(w)|u0(w)h(j)φ(w)(φ(w))+mi=1(ui(w)ih(j)φ(w)(φ(w)))|=μ(w)|u0(w)h(j)φ(w)(φ(w))+mi=1ui(w)mk=0c(j)kfφ(w),k(φ(w))|=μ(w)|u0(w)c0+c1++cm(1|φ(z)|2)γ+n+1p+mi=1ui(w)Bi,1(φ(w)),φ(w)(d0c0++dmcm)(1|φ(w)|2)γ+n+1p+1++mi=jui(w)Bi,j(φ(w)),φ(w)j(d0dj1c0++dmdm+j1cm)(1|φ(w)|2)γ+n+1p+j++um(w)Bm,m(φ(w)),φ(w)m(d0dm1c0++dmd2m1cm)(1|φ(w)|2)γ+n+1p+m|[log(11log|φ(w)|)]δp. (4.12)

    Since dk>0, k=¯0,m, by Lemma 4.4, we have the following linear equations

    (111d0d1dmj1k=0dkj1k=0dk+mj1k=0dk+mm1k=0dkm1k=0dk+mm1k=0dk+m)(c0c1cjcm)=(0010). (4.13)

    From (4.12) and (4.13), we have

    (4.14)

    On the other hand, from (4.9), we have

    (4.15)

    From (4.14) and (4.15), we get that (4.2) holds for .

    For constants , , let

    (4.16)

    By Theorem 3.4, we know that . From this, (4.12), (4.13) and Lemma 4.4, we get

    So, we have . Moreover, we have

    (4.17)

    From (4.5) and (4.17), we obtain (4.3). The proof is completed.

    From Theorem 4.1 and (1.4), we obtain the following result.

    Corollary 4.1. Let , , and is a weight function on . Then, the operator is bounded if and only if

    and

    for .

    Moreover, if the operator is bounded, then

    Theorem 4.2. Let , , , , , , and . Then, the operator is compact if and only if the operator is bounded,

    (4.18)

    for , and

    (4.19)

    Proof. Assume that the operator is compact. It is obvious that the operator is bounded.

    If , then it is clear that (4.18) and (4.19) are true. So, we suppose that . Let be a sequence in such that

    where are defined in (4.10) for a fixed . Then, it follows that uniformly on any compact subset of as . Hence, by Lemma 4.1, we have

    Then, we can find sufficiently large such that

    (4.20)

    If , then (4.20) is true.

    Now, we discuss the case of . Let , where is defined in (4.16). Then, we also have that and uniformly on any compact subset of as . Hence, by Lemma 4.1, one has that

    (4.21)

    Then, by (4.21), we know that (4.18) is true.

    Now, assume that is bounded, (4.18) and (4.19) are true. One has that

    (4.22)

    and

    (4.23)

    for any . By (4.18) and (4.19), for arbitrary , there is a , for any such that

    (4.24)

    and

    (4.25)

    Assume that is a sequence such that and uniformly on any compact subset of as . Then by Theorem 3.1, Theorem 3.2 and (4.22)–(4.25), one has that

    (4.26)

    Since uniformly on any compact subset of as . By Cauchy's estimates, we also have that uniformly on any compact subset of as . From this and using the fact that is a compact subset of , by letting in inequality (4.26), one get that

    Since is an arbitrary positive number, it follows that

    By Lemma 4.1, the operator is compact.

    As before, we also have the following result.

    Corollary 4.2. Let , , and is a weight function on . Then, the operators is compact if and only if the operator is bounded,

    and

    for .

    In this paper, we study and obtain some properties about the logarithmic Bergman-type space on the unit ball. As some applications, we completely characterized the boundedness and compactness of the operator

    from the logarithmic Bergman-type space to the weighted-type space on the unit ball. Here, one thing should be pointed out is that we use a new method and technique to characterize the boundedness of such operators without the condition (1.5), which perhaps is the special flavour in this paper.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    This work was supported by Sichuan Science and Technology Program (2022ZYD0010) and the Graduate Student Innovation Foundation (Y2022193).

    The authors declare that they have no competing interests.



    [1] V. Guihaire, J. K. Hao, Transit network design and scheduling: A global review, Transp. Res. Part A Policy Pract., 42 (2008), 1251–1273. https://doi.org/10.1016/j.tra.2008.03.011 doi: 10.1016/j.tra.2008.03.011
    [2] J. J. Tang, Y. F. Yang, W. Hao, F. Liu, Y. H. Wang, A data-driven timetable optimization of urban bus line based on multi-objective genetic algorithm, IEEE Trans. Intell. Transp. Syst., 22 (2021), 2417–2429. https://doi.org/10.1109/tits.2020.3025031 doi: 10.1109/tits.2020.3025031
    [3] J. Zhang, L. Tu, F. Zhang, X. J. Yin, J. Sun, H. S. T. Chen, Flexible express bus line planning and operating based on passenger flow analysis, in IEEE International Conference on Intelligent Transportation Systems-ITSC, (2018), 2511–2518.
    [4] M. Y. Pei, P. Q. Lin, R. H. Liu, Y. Y. Ma, Flexible transit routing model considering passengers' willingness to pay, IET Intel. Transport Syst., 13 (2019), 841–850. https://doi.org/10.1049/iet-its.2018.5220 doi: 10.1049/iet-its.2018.5220
    [5] G. Cheng, C. L. He, Analysis of bus travel characteristics and predictions of elderly passenger flow based on smart card data, Electron. Res. Arch., 30 (2022), 4256–4276. https://doi.org/10.3934/era.2022217 doi: 10.3934/era.2022217
    [6] S. Hassold, A. Ceder, Public transport vehicle scheduling featuring multiple vehicle types, Transp. Res. Part B Methodol., 67 (2014), 129–143. https://doi.org/10.1016/j.trb.2014.04.009 doi: 10.1016/j.trb.2014.04.009
    [7] S. Bunte, N. J. P. T. Kliewer, An overview on vehicle scheduling models, Public Transp., 1 (2009), 299–317. https://doi.org/10.1007/s12469-010-0018-5 doi: 10.1007/s12469-010-0018-5
    [8] D. Pena, A. Tchernykh, S. Nesmachnow, R. Massobrio, A. Y. Drozdov, S. N. Garichev, Multiobjective vehicle type and size scheduling problem in urban public transport using MOCell, in 2016 International Conference on Engineering and Telecommunication (EnT), (2016), 110–113. https://doi.org/10.1109/EnT.2016.30
    [9] R. Tang, Y. Bie, Q. Song, X. Xiong, Timetable optimization method for single bus line based on multiple vehicle size model, in CICTP 2019, (2019), 1882–1894.
    [10] Y. Bie, R. Tang, L. Wang, Bus scheduling of overlapping routes with multi-vehicle types based on passenger OD data, IEEE Access, 8 (2020), 1406–1415. https://doi.org/10.1109/access.2019.2961930 doi: 10.1109/access.2019.2961930
    [11] X. Dou, Q. Meng, Feeder bus timetable design and vehicle size setting in peak hour demand conditions, Transp. Res. Rec., 2673 (2019), 321–332. https://doi.org/10.1177/0361198119846462 doi: 10.1177/0361198119846462
    [12] Z. Dai, X. C. Liu, X. Chen, X. Ma, Joint optimization of scheduling and capacity for mixed traffic with autonomous and human-driven buses: A dynamic programming approach, Transp. Res. Part C Emerging Technol., 114 (2020), 598–619. https://doi.org/10.1016/j.trc.2020.03.001 doi: 10.1016/j.trc.2020.03.001
    [13] J. Zhou, Initial boundary value problem for a inhomogeneous pseudo-parabolic equation, Electron. Res. Arch., 28 (2020), 67–90. https://doi.org/10.3934/era.2020005 doi: 10.3934/era.2020005
    [14] Y. Liu, F. Y. Wu, C. Lyu, S. Li, J. P. Ye, X. B. Qu, Deep dispatching: A deep reinforcement learning approach for vehicle dispatching on online ride-hailing platform, Transp. Res. Part E Logist. Transp. Rev., 161 (2022), 102694. https://doi.org/10.1016/j.tre.2022.102694 doi: 10.1016/j.tre.2022.102694
    [15] Y. Bie, R. Tang, Z. Liu, D. Ma, Mixed scheduling strategy for high frequency bus routes with common stops, IEEE Access, 8 (2020), 34442–34454. https://doi.org/10.1109/access.2020.2974740 doi: 10.1109/access.2020.2974740
    [16] Y. Bie, M. Hao, M. Guo, Optimal electric bus scheduling based on the combination of all-stop and short-turning strategies, Sustainability-Basel, 13 (2021). https://doi.org/10.3390/su13041827 doi: 10.3390/su13041827
    [17] B. Hu, X. Wang, W. Chen, Study on combinational scheduling between inter-zone vehicle and regular vehicle for urban public transit, J. Wuhan Univ. Technol., 36 (2012), 1192–1195.
    [18] M. Kim, P. Schonfeld, Conventional, flexible, and variable-type bus services, J. Transp. Eng., 138 (2012), 263–273. https://doi.org/10.1061/(asce)te.1943-5436.0000326 doi: 10.1061/(asce)te.1943-5436.0000326
    [19] Z. Zhou, Z. Ye, Y. Xu, Optimizing combined bus service pattern and frequencies with genetic algorithm, in CICTP 2018: Intelligence, Connectivity, and Mobility, Reston, VA: American Society of Civil Engineers, (2018), 881–892.
    [20] M. Y. Jin, S. X. He, S. C. Zhang, Bus combinational scheduling based on improved genetic algorithm and considering exhaust emission, Transp. Res., 7 (2021), 55–65. https://doi.org/10.16503/j.cnki.2095-9931.2021.02.007 doi: 10.16503/j.cnki.2095-9931.2021.02.007
    [21] Y. Liu, L. Wang, Z. Zeng, Y. Bie, Optimal charging plan for electric bus considering time-of-day electricity tariff, J. Intell. Connected Veh., 5 (2022), 123–137. https://doi.org/10.1108/JICV-04-2022-0008 doi: 10.1108/JICV-04-2022-0008
    [22] J. He, N. Yan, J. Zhang, Y. Yu, T. Wang, Battery electric buses charging schedule optimization considering time-of-use electricity price, J. Intell. Connected Veh., 5 (2022), 138–145.
    [23] W. Zhang, H. Zhao, M. Xu, Optimal operating strategy of short turning lines for the battery electric bus system, Commun. Transp. Res., 1 (2021), 100023. https://doi.org/10.1016/j.commtr.2021.100023 doi: 10.1016/j.commtr.2021.100023
    [24] J. Ji, Y. Bie, Z. Zeng, L. Wang, Trip energy consumption estimation for electric buses, Commun. Transp. Res., 2 (2022), 100069. https://doi.org/10.1016/j.commtr.2022.100069 doi: 10.1016/j.commtr.2022.100069
    [25] Y. Liu, E. Yao, S. Liu, Energy consumption optimization model of multi-type bus operating organization based on time-space network, Appl. Sci.-Basel, 9 (2019). https://doi.org/10.3390/app9163352 doi: 10.3390/app9163352
    [26] G. J. Zhou, D. F. Xie, X. M. Zhao, C. Lu, Collaborative optimization of vehicle and charging scheduling for a bus fleet mixed with electric and traditional buses, IEEE Access, 8 (2020), 8056–8072. https://doi.org/10.1109/access.2020.2964391 doi: 10.1109/access.2020.2964391
    [27] A. Jahic, M. Plenz, M. Eskander, D. Schulz, Route scheduling for centralized electric bus depots, IEEE Open J. Intell. Transp. Syst., 2 (2021), 149–159. https://doi.org/10.1109/ojits.2021.3096115 doi: 10.1109/ojits.2021.3096115
    [28] A. Ceder, Public-transport vehicle scheduling with multi vehicle type, Transp. Res. Part C Emerging Technol., 19 (2011), 485–497. https://doi.org/10.1016/j.trc.2010.07.007 doi: 10.1016/j.trc.2010.07.007
    [29] M. G. Baldoquin, A. J. Rengifo-Campo, A model for solving vehicle scheduling problems: a case study, Rev. Fac. Ing. Univ. Antioquia, 88 (2018), 16–25. https://doi.org/10.17533/udea.redin.n88a03 doi: 10.17533/udea.redin.n88a03
    [30] E. Yao, T. Liu, T. Lu, Y. Yang, Optimization of electric vehicle scheduling with multiple vehicle types in public transport, Sustainable Cities Soc., 52 (2020), 101862. https://doi.org/10.1016/j.scs.2019.101862 doi: 10.1016/j.scs.2019.101862
    [31] O. J. Ibarra-Rojas, R. Giesen, Y. A. Rios-Solis, An integrated approach for timetabling and vehicle scheduling problems to analyze the trade-off between level of service and operating costs of transit networks, Transp. Res. Part B Methodol., 70 (2014), 35–46. https://doi.org/10.1016/j.trb.2014.08.010 doi: 10.1016/j.trb.2014.08.010
    [32] L. Ye, L. Danni, Bus scheduling model based on peak hour volume clustering, in CICTP2015, (2015), 1065–1080.
    [33] J. Li, J. Hu, Y. Zhang, Optimal combinations and variable departure intervals for micro bus system, Tsinghua Sci. Technol., 22 (2017), 282–292. https://doi.org/10.23919/TST.2017.7914200 doi: 10.23919/TST.2017.7914200
    [34] X. Yang, L. Liu, A multi-objective bus rapid transit energy saving dispatching optimization considering multiple types of vehicles, IEEE Access, 8 (2020), 79459–79471. https://doi.org/10.1109/access.2020.2989334 doi: 10.1109/access.2020.2989334
    [35] R. Liu, N. Wang, Data-driven bus route optimization algorithm under sudden interruption of public transport, IEEE Access, 10 (2022), 5250–5263. https://doi.org/10.1109/access.2022.3140947 doi: 10.1109/access.2022.3140947
    [36] X. Zuo, C. Chen, W. Tan, M. Zhou, Vehicle scheduling of an urban bus line via an improved multiobjective genetic algorithm, IEEE Trans. Intell. Transp. Syst., 16 (2015), 1030–1041. https://doi.org/10.1109/tits.2014.2352599 doi: 10.1109/tits.2014.2352599
    [37] O. Ben-ayed, C. E. Blair, Computational difficulties of bilevel linear programming, Oper. Res., 38 (1990), 556–560. https://doi.org/10.1287/opre.38.3.556 doi: 10.1287/opre.38.3.556
    [38] X. Zhao, S. Li, A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions, Electron. Res. Arch., 30 (2022), 4209–4219. https://doi.org/10.3934/era.2022213 doi: 10.3934/era.2022213
    [39] K. Deb, Multi-Objective Optimization Using Evolutionary Algorithms, Springer London, 2001.
  • This article has been cited by:

    1. Hafiz Muhammad Fraz, Kashif Ali, Muhammad Faisal Nadeem, Entropy measures of silicon nanotubes using degree based topological indices, 2025, 100, 0031-8949, 015202, 10.1088/1402-4896/ad94b4
    2. Pranavi Jaina, K. Anil Kumar, J. Vijayasekhar, Application of Zagreb Index Models in Predicting the Physicochemical Properties of Unsaturated Fatty Acids, 2025, 41, 22315039, 201, 10.13005/ojc/410124
  • Reader Comments
  • © 2023 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(2366) PDF downloads(84) Cited by(3)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog