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

An intuitionistic fuzzy site selection decision framework for waste-to-energy projects from the perspective of "Not In My Backyard" risk

  • Received: 03 October 2022 Revised: 09 November 2022 Accepted: 13 November 2022 Published: 24 November 2022
  • MSC : 03E72, 90B50

  • In the process of site selection for waste-to-energy (WtE) projects, the public is concerned about the impact of project construction on the surrounding environment and physical health and thus resists the construction site, leading to the emergence of "Not In My Backyard" (NIMBY) risk, which hinders the implementation of WtE projects. These risks make the ambiguity and uncertainty of scheme evaluation and decision higher. In this regard, this study constructed a WtE project site selection decision framework based on comprehensive consideration of NIMBY risk. Firstly, indicators were selected from cost perception, benefit expectation, and NIMBY risk to construct a WtE project site selection indicator system. Then, based on the "Decision Making Trial and Evaluation Laboratory" (DEMATEL) and the Intuitionistic Fuzzy Multi-criteria Optimization and Compromise Solution (IFVIKOR) method, a site selection decision framework is constructed. The system takes into account the interaction between indicators and obtains a more reasonable index weight. Meanwhile, the intuitionistic fuzzy theory is used to solve the fuzziness and uncertainty in risk assessment and decision-making. Finally, the feasibility of the siting decision system was verified through case studies. The results show that the A3 in this case was considered the best location for the project. In addition, the sensitivity analysis verifies the reliability and stability of the WtE project location decision framework.

    Citation: Yuanlu Qiao, Jingpeng Wang. An intuitionistic fuzzy site selection decision framework for waste-to-energy projects from the perspective of 'Not In My Backyard' risk[J]. AIMS Mathematics, 2023, 8(2): 3676-3698. doi: 10.3934/math.2023184

    Related Papers:

    [1] Ahmed A. El-Deeb, Osama Moaaz, Dumitru Baleanu, Sameh S. Askar . A variety of dynamic α-conformable Steffensen-type inequality on a time scale measure space. AIMS Mathematics, 2022, 7(6): 11382-11398. doi: 10.3934/math.2022635
    [2] Mohammed S. El-Khatib, Atta A. K. Abu Hany, Mohammed M. Matar, Manar A. Alqudah, Thabet Abdeljawad . On Cerone's and Bellman's generalization of Steffensen's integral inequality via conformable sense. AIMS Mathematics, 2023, 8(1): 2062-2082. doi: 10.3934/math.2023106
    [3] Ahmed A. El-Deeb, Dumitru Baleanu, Nehad Ali Shah, Ahmed Abdeldaim . On some dynamic inequalities of Hilbert's-type on time scales. AIMS Mathematics, 2023, 8(2): 3378-3402. doi: 10.3934/math.2023174
    [4] Ahmed A. El-Deeb, Samer D. Makharesh, Sameh S. Askar, Dumitru Baleanu . Bennett-Leindler nabla type inequalities via conformable fractional derivatives on time scales. AIMS Mathematics, 2022, 7(8): 14099-14116. doi: 10.3934/math.2022777
    [5] Elkhateeb S. Aly, Y. A. Madani, F. Gassem, A. I. Saied, H. M. Rezk, Wael W. Mohammed . Some dynamic Hardy-type inequalities with negative parameters on time scales nabla calculus. AIMS Mathematics, 2024, 9(2): 5147-5170. doi: 10.3934/math.2024250
    [6] Marwa M. Ahmed, Wael S. Hassanein, Marwa Sh. Elsayed, Dumitru Baleanu, Ahmed A. El-Deeb . On Hardy-Hilbert-type inequalities with α-fractional derivatives. AIMS Mathematics, 2023, 8(9): 22097-22111. doi: 10.3934/math.20231126
    [7] Bingxian Wang, Mei Xu . Asymptotic behavior of some differential inequalities with mixed delays on time scales and their applications. AIMS Mathematics, 2024, 9(6): 16453-16467. doi: 10.3934/math.2024797
    [8] Jian-Mei Shen, Saima Rashid, Muhammad Aslam Noor, Rehana Ashraf, Yu-Ming Chu . Certain novel estimates within fractional calculus theory on time scales. AIMS Mathematics, 2020, 5(6): 6073-6086. doi: 10.3934/math.2020390
    [9] Awais Younus, Khizra Bukhsh, Manar A. Alqudah, Thabet Abdeljawad . Generalized exponential function and initial value problem for conformable dynamic equations. AIMS Mathematics, 2022, 7(7): 12050-12076. doi: 10.3934/math.2022670
    [10] Haytham M. Rezk, Mohammed Zakarya, Amirah Ayidh I Al-Thaqfan, Maha Ali, Belal A. Glalah . Unveiling new reverse Hilbert-type dynamic inequalities within the framework of Delta calculus on time scales. AIMS Mathematics, 2025, 10(2): 2254-2276. doi: 10.3934/math.2025104
  • In the process of site selection for waste-to-energy (WtE) projects, the public is concerned about the impact of project construction on the surrounding environment and physical health and thus resists the construction site, leading to the emergence of "Not In My Backyard" (NIMBY) risk, which hinders the implementation of WtE projects. These risks make the ambiguity and uncertainty of scheme evaluation and decision higher. In this regard, this study constructed a WtE project site selection decision framework based on comprehensive consideration of NIMBY risk. Firstly, indicators were selected from cost perception, benefit expectation, and NIMBY risk to construct a WtE project site selection indicator system. Then, based on the "Decision Making Trial and Evaluation Laboratory" (DEMATEL) and the Intuitionistic Fuzzy Multi-criteria Optimization and Compromise Solution (IFVIKOR) method, a site selection decision framework is constructed. The system takes into account the interaction between indicators and obtains a more reasonable index weight. Meanwhile, the intuitionistic fuzzy theory is used to solve the fuzziness and uncertainty in risk assessment and decision-making. Finally, the feasibility of the siting decision system was verified through case studies. The results show that the A3 in this case was considered the best location for the project. In addition, the sensitivity analysis verifies the reliability and stability of the WtE project location decision framework.



    The Weighted Complementarity Problem (WCP), which is to find a pair of (x,s,y)Rn×Rn×Rm such that

    x0,s0,xs=w,F(x,s,y)=0, (1.1)

    where, F:R2n+mRn+m is a continuously differentiable function, wRn+ is the given weight vector, xs:=xs is the componentwise product of the vectors x and s. When w=0, WCP (1.1) reduces to the classical Nonlinear Complementarity Problem (NCP). At present, there are many effective algorithms [1,2,3,4,5] that can solve NCP. For examples, Newton method [1], Quasi-Newton method [2], L-M method [3,4], Neural-Networks method [5] etc. If

    F(x,s,y)=Px+Qs+Rya, (1.2)

    problem (1.1) is the Linear Weighted Complementarity Problem (LWCP) studied in this paper, which is to find a pair of (x,s,y)Rn×Rn×Rm such that

    x0,s0,xs=w,Px+Qs+Ry=a, (1.3)

    where, PR(n+m)×n,QR(n+m)×n,RR(n+m)×m,aRn+m, are given matrices and vector. In addition, when

    F(x,s,y)=(f(x)sATyAxb), (1.4)

    problem (1.1) is the perturbed Karush-Kuhn-Tucker(KKT) condition for the following Nonlinear Programming(NLP)

    minf(x),s.t.Ax=b,x0. (1.5)

    Problem(1.3) was introduced by Potra [6] in 2012 and has been widely studied for its important applications in management, market equilibrium, etc. Many equilibrium problems can also be transformed into LWCP to solve, such as the famous Fisher market equilibrium problem [7], and the quadratic programming and weighted center problem [6].

    In recent years, many effective algorithms have been proposed to solve problem (1.1) or (1.3) [8,9,10,11,12,13]. For examples, Chi et al. [9] proposed the full-Newton step infeasible interior-point method for solving LWCP. Zhang et al. [12] proposed the smoothing Newton type method for solving LWCP. Tang et al. [13] proposed the nonmonotone L-M method for NWCP. The interior point method depends on the choice of initial value. The classical Newton method needs the positive definite of Hessian matrix, otherwise, it is difficult to guarantee that the Newton direction is descending. The L-M method does not depend on the choice of initial values, nor does it require the positive definiteness of the Hessian matrix. Therefore, this paper mainly considers using L-M method to solve problem (1.3). Motivated by [13], we consider using a nonmonotone L-M method to solve LWCP.

    LWCP is a more general complementary model. For the solution of this model, we hope to use the WCP functions obtained by the extension of NCP functions. However, due to the existence of weighting term, not all NCP functions can be directly extended to WCP functions. For NCP function in the form of FB function, many scholars have extended it to WCP function. In this paper, motivated by the smoothed penalty function for [14], we construct a smoothng function for WCP. And then use L-M method to approximate the equivalent reconstruction equations of problem (1.3). The comparison experiment of random generation shows the feasibility and effectiveness of our algorithm.

    The following notations will be used throughout this paper. The superscript T denotes transpose. R denotes real numbers, Rn represents the set of all n dimensional real column vectors. The matrix I denotes the identity matrix, and denotes 2-norm. All vectors in this article are column vectors.

    In this section, we study a class of complementary functions with participation weights and discuss its properties. Based on this weighted complementary function, the equivalent reconstruction equations of problem (1.3) are given.

    Definition 2.1. For a fixed c0, a function ϕ:R2R is called a weighted complementarity function [13], if it satisfies

    ϕc(a,b)=0a0,b0,ab=c. (2.1)

    When c=0, ϕc(a,b) reduces to the NCP function.

    In this paper, to solve the LWCP (1.3), we hope to use the WCP functions obtained by the extension of NCP functions. However, due to the existence of weighting term, not all NCP functions can be directly generalized to WCP functions. For example, the two piecewise NCP functions given in [2]:

    ϕ(a,b)={3a(a2b),ba>0,or3b>a0;3a(b2a),a>b>0,or3a>b0;9a+9b,else. (2.2)
    ϕ(a,b)={k2a,bk|a|;2kb(b2a),a>|b|k;2k2a+2kb+(b2a),a<|b|k;k2a+4kb,bk|a|. (2.3)

    For FB function, many scholars have extended it to WCP function. For example, Liu et al. [11] based on the symmetric disturbance FB function in [15] constructed:

    ϕc(μ,a,b)=(1+μ)(a+b)(a+μb)2+(μa+b)2+2c+2μ2, (2.4)

    where, c is a given nonnegative vector.

    Zhang[12] proposed:

    ϕθ(μ,a,b,c)=a2+b22θab+2(1+θ)c+2μab, (2.5)

    where, θ(1,1],c is a given nonnegative vector.

    In addition, [13] provides another smooth function:

    ϕcτ,q(a,b)=(a+b)q(a2+b2+(τ2)ab+(4τ)c)q, (2.6)

    where, c is a given nonnegative vector, τ[0,4) is a constant, q>1 is an odd integer. Compared with (2.4) and (2.5), (2.6) does not need to introduce the smoothing factor μ. By controlling the value of q, smoothing can be achieved. This smoothing method will be used to smooth the new WCP function given below.

    ϕcτ(a,b)=a+bτ(ab)2+(1τ)(a2+b2)+2(1+τ)c, (2.7)

    where, c is a given nonnegative vector, τ[0,1] is a constant.

    Since Eq (2.7) is not smooth, we make the following smoothing treatment:

    ϕcτ,q(a,b)=(a+b)q(τ(ab)2+(1τ)(a2+b2)+2(1+τ)c)q, (2.8)

    where, c is a given nonnegative vector, τ[0,1] is a constant, q>1 is an odd integer.

    Theorem 2.1. Let ϕcτ,q be defined by (2.8) with τ[0,1] and q>1 being a positive odd interger. Then ϕqτ is a family of WCP functions, i.e.,

    ϕcτ,q(a,b)=0a0,b0,ab=c. (2.9)

    Proof. Since for any α,βR and any positive odd interger q, there is αq=βqα=β. So we have

    ϕcτ,q(a,b)=0(a+b)q=(τ(ab)2+(1τ)(a2+b2)+2(1+τ)c)qa+b=τ(ab)2+(1τ)(a2+b2)+2(1+τ)cϕcτ(a,b)=0. (2.10)

    That is to say, we only need to prove that ϕcτ(a,b) is a family of WCP functions. On the one hand, we fist suppose that a,bR satisfy, ϕcτ(a,b)=0 i.e.,

    τ(ab)2+(1τ)(a2+b2)+2(1+τ)c=a+b. (2.11)

    By squaring the two sides of (2.11), we have 2(1+τ)ab=2(1+τ)c, which together with τ[0,1]. yields ab=c. By substituing ab=c into (2.2), we have a2+b2+2ab=a+b0. Since c=ab0, it follows that a0,b0. On the other hand, we suppose that a0,b0,ab=c, then a+b0 and

    τ(ab)2+(1τ)(a2+b2)+2(1+τ)c=a2+b2+2ab=|a+b|=a+b. (2.12)

    Which implies that ϕcτ(a,b)=0.

    Lemma 2.1. Let ϕcτ,q be defined by (2.8) with τ[0,1] and q>1 being a positive odd interger. Let

    hcτ(a,b)=τ(ab)2+(1τ)(a2+b2)+2(1+τ)c. (2.13)

    Then

    (ⅰ)When q>1, ϕcτ,q is continuously differentiable at any (a,b)R2 with

    ϕcτ,q=[ϕcτ,qaϕcτ,qb], (2.14)

    where

    ϕcτ,qa=q[(a+b)q1hcτ(a,b)q2(aτb)],ϕcτ,qb=q[(a+b)q1hcτ(a,b)q2(bτa)].

    (ⅱ)When q>3, ϕcτ,q is twice continuously differentiable at any (a,b)R2 with

    2ϕcτ,q(a,b)=[2ϕcτ,qa22ϕcτ,qab2ϕcτ,qba2ϕcτ,qb2], (2.15)

    where

    2ϕqτa2=q{(q1)(a+b)q2hτ(a,b,c)q4[(q2)(aτb)2+hτ(a,b,c)2]},2ϕcτ,qb2=q{(q1)(a+b)q2hcτ(a,b)q4[(q2)(bτa)2+hcτ(a,b)2]},
    2ϕcτ,qab=2ϕcτ,qba=q{(q1)(a+b)q2hcτ(a,b)q4[(q2)(aτb)(bτa)τhcτ(a,b)2]}.

    Lemma 2.2. Let ϕcτ,q be defined by (2.8) with τ[0,1] and q>1 being a positive odd interger. Defining the closed and convex set Ω(u):={uR2|uθ}, where θ is a positive constant. Then:

    (ⅰ)When q>1, ϕcτ,q is Lipschitz continuous on Ω(u) for any θ>0.

    (ⅱ)When q>3, ϕcτ,q is Lipschitz continuous on Ω(u) for any θ>0.

    Since ϕcτ,q and ϕcτ,q are bounded on the set Ω(u), therefore the conclusion (ⅰ) and (ⅱ) can be obtained from the Mean-Value-Theorem.

    Given weight vector wRn+, let z:=(x,s,y)R2n+m and

    H(z)=H(x,s,y):=(F(x,s,y)Φwτ,q(x,s)), (2.16)

    where

    Φwτ,q(x,s)=(ϕw1τ,q(x1,s1)ϕwnτ,q(xn,sn)). (2.17)

    Then the solution of LWCP (1.3) is equivalent to the approximate solution of the system of equations H(z)=0.

    Lemma2.3. Let H(z):R2n+mR2n+m,Φwτ,q:R2nRn be defined by (2.16) and (2.17), respectively. Then:

    (ⅰ)Φwτ,q(x,s) is continuously differentiable at any z=(x,s,y)R2n+m.

    (ⅱ)H(z) is continuously differentiable at any z=(x,s,y)R2n+m with its Jacobian

    H(z)=(FxFsFyD1D20), (2.18)

    where

    D1=diag{q[(xi+si)q1hwiτ(xi,si)q2(xiτsi)]},i=1,2,,n.D2=diag{q[(xi+si)q1hwiτ(xi,si)q2(siτxi)]},i=1,2,,n.hwiτ(xi,si)=τ(xisi)2+(1τ)(xi2+si2)+2(1+τ)wi,i=1,2,,n.

    Let H(z) be defined by (2.16), then its value function M:R2n+mR+ can be defined as:

    M(z):=12H(z)2. (2.19)

    Obviously, the solution of LWCP (1.3) is also equivalent to the approximate solution of the system of equations M(z)=0. In addition, the following conclusion can be obtained from the Lemma 2.3.

    Lemma 2.4. Let M:R2n+mR+ be defined by (2.19), then M(z) is continuously differentiable at any zR2n+m, and M(z)=H(z)TH(z).

    In this section, based on the WCP function in Section 2, we will give the smooth L-M type algorithm and its convergence.

    Algorithm3.1 (A smooth L-M method)

    Step 0: Choose θ,σ,γ,δ(0,1) and z0:=(x0,s0,y0)R2n+m, let 0ε1, and C0=M(z0). Choose a sequence {ηk|k0,ηk(0,1)}, set k:=0.

    Step 1: Compute H(zk). If H(zk)ε then stop.

    Step 2: Let μk:=θH(zk)2. Compute the search direction dkR2n+m by

    M(zk)+(H(zk)TH(zk)+μkI)dk=0. (3.1)

    Step 3: If dk satisfies

    H(zk+dk)σH(zk). (3.2)

    Then let αk:=1, and go to step 5. Otherwise, go to step 4.

    Step 4: Set jk be the smallest nonnegative integer j satisfying

    M(zk+δjdk)Ckγδjdk2. (3.3)

    let αk:=δjk, and go to step 5.

    Step 5: Set zk+1:=zk+αkdk and

    Qk+1:=ηkQk,Ck+1:=ηkQkCk+M(zk+1)Qk+1. (3.4)

    Step 6: Let k:=k+1, and go to step 1.

    Existing L-M type methods [16,17,18] are usually designed based on the Armijo line search. While algorithm 3.1 adopts a nonmonotone derivate free line search. The choice of ηk controls the degree of nonmonotoicity. If ηk0, then the line search is monotone.

    Theorem3.1. Let {zk} be the sequence generated by Algorithm 3.1. Then, {zk} satisfying M(zk)Ck for all k0.

    Proof. By Algorithm 3.1 C0=M(z0). We first assume that M(zk)Ck. If M(zk)=0, then Algorithm 3.1 terminates. Otherwise M(zk)0 which implies that H(zk)0, hence μk=θH(zk)2>0. So the matrix H(zk)TH(zk)+μkI is positive definite. Thus the search direction dk in step 3 is well-defined and dk0. Since M(zk)0, we have

    M(zk)Tdk=dkT(H(zk)TH(zk)+μkI)dk<0. (3.5)

    This implies that dk is a descent direction of M(zk) at the point zk. Next we will prove that at least one step size is obtained by step 4. Inversely, we assume that for any j, M(zk+δjdk)>Ckγδjdk2, then

    M(zk+δjdk)>Ckγδjdk2M(zk)γδjdk2, (3.6)

    thereby

    M(zk+δjdk)M(zk)+γδjdk2δj>0. (3.7)

    By letting j in (3.7), we have M(zk)Tdk0, which contradicts (3.5). Therefore, we can always get zk+1 by Step 3 or Step 4. If zk+1 is generated by step 3, i.e., H(zk+dk)σH(zk), then 12H(zk+dk)212σ2H(zk)2, so M(zk+1)σ2M(zk). And because, σ(0,1), therefore, we have M(zk+1)σ2M(zk)<M(zk)Ck. If zk+1 is generated by step 4, we can get M(zk+1)Ck directly. So, from(3.4), we can get that CkηkQkM(zk+1)+M(zk+1)Qk+1=M(zk+1). Hence, we conclude that M(zk)Ck for all k0.

    Next, we first suppose that M(zk)0 for all k0. In order to discuss the convergence of algorithm 3.1, we need the following lemma.

    Lemma 3.1. Let {zk} be the sequence generated by Algorithm 3.1, then there exists a nonnegative constant C such that

    lim (3.8)

    Proof. By Theorem3.1, we can get 0 \leqslant M\left( {{z^k}} \right) \leqslant {C_k} for all k \geqslant 0 and {C_{k + 1}} \leqslant \frac{{{\eta _k}{Q_k}{C_k} + {C_k}}}{{{Q_{k + 1}}}} = {C_k}. Hence, by The Monotone Bounded Theorem, there exists a nonnegative constant {C^ * } such that \mathop {\lim }\limits_{k \to \infty } {C_k} = {C^ * } . By the definition of {Q_k} , we have

    {Q_{k + 1}} = 1 + \mathop \Sigma \limits_{i = 0}^k \mathop \Pi \limits_{j = 0}^i {\eta _{k - j}} \leqslant 1 + \mathop \Sigma \limits_{i = 0}^k \eta _{\max }^{i + 1} \leqslant \mathop \Sigma \limits_{i = 0}^\infty \eta _{\max }^i = \frac{1}{{1 - {\eta _{\max }}}}. (3.9)

    Hence, we conclude that {\eta _k}{Q_k} \leqslant \frac{{{\eta _{\max }}}}{{1 - {\eta _{\max }}}} is bounded, which together with \mathop {\lim }\limits_{k \to \infty } {C_k} = {C^ * } yields \mathop {\lim }\limits_{k \to \infty } {\eta _{k - 1}}{Q_{k - 1}}\left( {{C_k} - {C_{k - 1}}} \right) = 0. So, it follows from (3.4) that

    \begin{array}{l} M\left( {{z^{k + 1}}} \right) = {Q_{k + 1}}{C_{k + 1}} - {\eta _k}{Q_k}{C_k} = \left( {{\eta _k}{Q_k} + 1} \right){C_{k + 1}} - {\eta _k}{Q_k}{C_k} \\ \;\;\;\;\;\;\;\;\;\;\;\;\;= {\eta _k}{Q_k}\left( {{C_{k + 1}} - {C_k}} \right) + {C_{k + 1}}. \end{array} (3.10)

    Hence

    \mathop {\lim }\limits_{k \to \infty } M\left( {{z^k}} \right) = \mathop {\lim }\limits_{k \to \infty } \left[ {{\eta _{k - 1}}{Q_{k - 1}}\left( {{C_k} - {C_{k - 1}}} \right) + {C_k}} \right] = {C^ * }. (3.11)

    We complete the proof.

    Theorem3.2. Let \left\{ {{z^k}} \right\} be the sequence generated by Algorithm 3.1. Then any accumulation point {z^ * } of \left\{ {{z^k}} \right\} is a stationary point of M\left( z \right) .

    Proof. By Lemma 3.1, we have \mathop {\lim }\limits_{k \to \infty } M\left( {{z^k}} \right) = \mathop {\lim }\limits_{k \to \infty } {C_k} = {C^ * }, {C^ * } \geqslant 0 . If {C^ * } = 0 , then \mathop {\lim }\limits_{k \to \infty } H\left( {{z^k}} \right) = 0 which together with Lemma 2.4 yields \nabla M\left( {{z^ * }} \right) = 0 . In the following, we discuss the case of {C^ * } > 0 . Set N: = \left\{ {k\left| {\left\| {H\left( {{z^k} + {d_k}} \right)} \right\| \leqslant \sigma \left\| {H\left( {{z^k}} \right)} \right\|} \right.} \right\} . Then N must be a finite set, otherwise M\left( {{z^{k + 1}}} \right) \leqslant {\sigma ^2}M\left( {{z^k}} \right) holds for infinitely many k . By letting k \to \infty with k \in N , we can have {C^ * } \leqslant {\sigma ^2}{C^ * } and 1 \leqslant {\sigma ^2} which contradicts \sigma \in \left( {0, 1} \right) . Therefore, we can suppose that there exists an index \bar k > 0 such that \left\| {H\left( {{z^k} + {d_k}} \right)} \right\| > \sigma \left\| {H\left( {{z^k}} \right)} \right\| for all k \geqslant \bar k . Thereby, there exists a {j_k} such that M\left( {{z^{k + 1}}} \right) \leqslant {C_k} - \gamma {\left\| {{\delta ^{{j_k}}}{d_k}} \right\|^2} , i.e.,

    \gamma {\left\| {{\delta ^{{j_k}}}{d_k}} \right\|^2} \leqslant {C_k} - M\left( {{z^{k + 1}}} \right). (3.12)

    Next, we suppose that {z^ * } is the limit of the subsequence {\left\{ {{z^k}} \right\}_{k \in K}} \subset \left\{ {{z^k}} \right\} where K \in \left\{ {0, 1, 2, \cdots } \right\} , i.e., \mathop {\lim }\limits_{k\left( { \in K} \right) \to \infty } {z^k} = {z^ * } . Hence, by the continuity, we have {C^ * } = M\left( {{z^ * }} \right) = \frac{1}{2}{\left\| {H\left( {{z^ * }} \right)} \right\|^2} . By \mathop {\lim }\limits_{k \to \infty } {\mu _k} = \mathop {\lim }\limits_{k \to \infty } \theta {\left\| {H\left( {{z^k}} \right)} \right\|^2} = \mathop {\lim }\limits_{k \to \infty } 2\theta M\left( {{z^k}} \right) = 2\theta {C^ * } , we can get that

    \mathop {\lim }\limits_{k\left( { \in K} \right) \to \infty } \left[ {H'{{\left( {{z^k}} \right)}^T}H'\left( {{z^k}} \right) + {\mu _k}I} \right] = H'{\left( {{z^ * }} \right)^T}H'\left( {{z^ * }} \right) + 2\theta {C^ * }I. (3.13)

    According to the proof process of theorem 3.1, the matrix H'{\left( {{z^k}} \right)^T}H'\left( {{z^k}} \right) + {\mu _k}I is a symmetric positive definite matrix. In addition, because of {C^ * } > 0 , the matrix H'{\left( {{z^ * }} \right)^T}H'\left( {{z^ * }} \right) + 2\theta {C^ * }I is also symmetric positive definite matrix. Hence, we have

    \mathop {\lim }\limits_{k\left( { \in K} \right) \to \infty } {\left[ {H'{{\left( {{z^k}} \right)}^T}H'\left( {{z^k}} \right) + {\mu _k}I} \right]^{ - 1}} = {\left[ {H'{{\left( {{z^ * }} \right)}^T}H'\left( {{z^ * }} \right) + 2\theta {C^ * }I} \right]^{ - 1}}. (3.14)

    and

    \mathop {\lim }\limits_{k\left( { \in K} \right) \to \infty } {d_k} = {d^ * } = - {\left[ {H'{{\left( {{z^ * }} \right)}^T}H'\left( {{z^ * }} \right) + 2\theta {C^ * }I} \right]^{ - 1}}\nabla M\left( {{z^ * }} \right). (3.15)

    By (3.5), we can get

    \nabla M{\left( {{z^ * }} \right)^T}{d^ * } = \mathop {\lim }\limits_{k\left( { \in K} \right) \to \infty } \nabla M{\left( {{z^k}} \right)^T}{d^k} \leqslant 0. (3.16)

    By letting k \to \infty with k \in N in (3.12), we have \mathop {\lim }\limits_{k\left( { \in K} \right) \to \infty } \left\| {{\delta ^{{j_k}}}{d_k}} \right\| = 0 . If {\delta ^{{j_k}}} > 0 , then \mathop {\lim }\limits_{k\left( { \in K} \right) \to \infty } {d_k} = {d^ * } = 0 which together with (3.15) yields \nabla M\left( {{z^ * }} \right) = 0 . Otherwise, \mathop {\lim }\limits_{k\left( { \in K} \right) \to \infty } {\delta ^{{j_k}}} = 0 . From step 4 and Theorem 3.1

    M({z^k} + {\delta ^{{j_k} - 1}}{d_k}) > {C_k} - \gamma {\left\| {{\delta ^{{j_k} - 1}}{d_k}} \right\|^2} \geqslant M({z^k}) - \gamma {\left\| {{\delta ^{{j_k} - 1}}{d_k}} \right\|^2}, (3.17)

    i.e.,

    \frac{{M({z^k} + {\delta ^{{j_k} - 1}}{d_k}) - M({z^k})}}{{{\delta ^{{j_k} - 1}}}} + \gamma {\left\| {{\delta ^{{j_k} - 1}}{d_k}} \right\|^2} > 0. (3.18)

    Now that M\left( z \right) is continuously differentiable at {z^ * } , so we have

    \nabla M{\left( {{z^ * }} \right)^T}{d^ * } \geqslant 0. (3.19)

    Then, from (3.16), we can get \nabla M{\left( {{z^ * }} \right)^T}{d^ * } = 0 and

    \begin{array}{l} {\left( {{d^ * }} \right)^T}\left( {H'{{\left( {{z^ * }} \right)}^T}H'\left( {{z^ * }} \right) + 2\theta {C^ * }I} \right){d^ * } = - \nabla M{\left( {{z^ * }} \right)^T}{\left[ {H'{{\left( {{z^ * }} \right)}^T}H'\left( {{z^ * }} \right) + 2\theta {C^ * }I} \right]^{ - 1}}\left( {H'{{\left( {{z^ * }} \right)}^T}H'\left( {{z^ * }} \right) + 2\theta {C^ * }I} \right){d^ * } \\ \;\;\;\;\;\;\;\;\;\;\;\;\;\; \;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;= - \nabla M{\left( {{z^ * }} \right)^T}{d^ * } = 0. \end{array}

    Since the matrix H'{\left( {{z^ * }} \right)^T}H'\left( {{z^ * }} \right) + 2\theta {C^ * }I is a positive matrix, so we have

    {d^ * } = - {\left[ {H'{{\left( {{z^ * }} \right)}^T}H'\left( {{z^ * }} \right) + 2\theta {C^ * }I} \right]^{ - 1}}\nabla M{\left( {{z^ * }} \right)^T} = 0. (3.20)

    Now that the matrix {\left[ {H'{{\left( {{z^ * }} \right)}^T}H'\left( {{z^ * }} \right) + 2\theta {C^ * }I} \right]^{ - 1}} is also positive matrix, we can get \nabla M\left( {{z^ * }} \right) = 0.

    In this section, we carry out some numerical experiments on the LWCP by Algorithm 3.1. All experiments were conducted on a ThinkPad480 with a 1.8GHz CPU and 8.0GB RAM. The codes are run in MATLAB R2018b under Win10.

    We first generate the matrices P, Q, R and vector a by following way:

    P = \left( {\begin{array}{*{20}{c}} A \\ M \end{array}} \right), Q = \left( {\begin{array}{*{20}{c}} 0 \\ I \end{array}} \right), P = \left( {\begin{array}{*{20}{c}} 0 \\ { - {A^T}} \end{array}} \right), a = \left( {\begin{array}{*{20}{c}} b \\ { - f} \end{array}} \right), (4.1)

    where A \in {R^{m \times n}} is a full row rank matrix with m < n , the matrix M is an n \times n symmetric semidefinite matrix, b \in {R^m}, f \in {R^n}. In our algorithm we set: \gamma = 0.01, \sigma = 0.5, \delta = 0.8, \theta = {10^{ - 4}}. The initial points are choosing as : {x^0} = \left( {1, \cdots , 1} \right), {s^0} = \left( {1, \cdots , 1} \right), {y^0} = \left( {0, \cdots , 0} \right).

    In the course of experiments, we generate LWCP (1.3) by the following two ways.

    (ⅰ) We take A = randn\left( {m, n} \right) with rank\left( A \right) = m , and M = \frac{{B{B^T}}}{{\left\| {B{B^T}} \right\|}} with B = rand\left( {n, n} \right) . we first generate \hat x = rand\left( {n, 1} \right), f = rand\left( {n, 1} \right) , then we set \hat b: = A\hat x, \hat s = M\hat x + f, w = \hat x\hat s .

    (ⅱ) We choose a = \left( {\begin{array}{*{20}{c}} b \\ { - f} \end{array}} \right) - \xi where \xi \in {R^{n + m}} is a noise. We choose M = diag(v) with v = rand\left( {n, 1} \right) . The matrix A and vectors b, f are generated in the same way as (ⅰ). In the course of experiments, we take \xi = {10^{ - 4}}rand(1, 1)p with p: = {\left( {1, 1, 0, \cdots , 0} \right)^T} \in {R^{n + m}} .

    First, in order to observe the local convergence of algorithm 3.1, we conducted two sets of random test experiments on LWCP (ⅰ) with n = 1000, m = 500 . Figure 1 gives the convergence curve of \left\| {H\left( {{z^k}} \right)} \right\| at the k -th iteration. We can clearly see that algorithm 3.1 is locally fast, or at least locally superlinear.

    Figure 1.  Convergence curve of \left\| {H\left( {{z^k}} \right)} \right\| at the k -th iteration.

    Next, we conducted comparative experiments with [13]. In the course of experiments, the parameters in the WCP functions \phi _{\tau , q}^w are respectively taken as \tau = 0.5, q = 3, \tau = 1, q = 3 and \tau = 0.3, q = 3, \tau = 0.8, q = 3 . The numerical results are presented in Tables 1, 2, Figures 2 and 3 respectively. Where AIT, ACPU, ANH are respectively the average number of iterations, the average CPU time (unit seconds), and the average number \left\| {H\left( {{z^k}} \right)} \right\| of iterations at the end of 10 random experiments. LM represents our experimental result, TLM is the experimental result of [13].

    Table 1.  Numerical results of solving LWCP (ⅰ) ( \tau = 0.5, q = 3 ).
    m n LM TLM
    AIT ACPU ANH AIT ACPU ANH
    200 500 7.9 0.6960 5.0131×10-12 8.0 0.7015 6.0903×10-13
    7.8 0.6974 5.5794×10-12 7.7 0.6906 1.2630×10-11
    7.6 0.6703 8.5289×10-12 7.9 0.7025 3.5098×10-13
    400 800 8.1 2.4705 5.5548×10-13 8.8 3.1241 5.2707×10-13
    8.2 2.5097 7.6171×10-13 8.9 2.6100 2.2961×10-13
    8.2 2.6300 2.4813×10-13 8.1 2.4039 3.6750×10-12
    500 1000 8.1 4.4569 1.2136×10-12 8.1 4.3590 2.2894×10-12
    8.4 4.7697 3.1192×10-13 8.4 4.4993 4.5153×10-12
    8.2 4.8820 2.7039×10-12 8.4 4.4767 9.3738×10-13
    600 1500 7.9 11.2160 9.7961×10-12 8.0 11.6639 1.0240×10-12
    8.0 11.4230 1.0008×10-13 8.0 11.6522 9.3154×10-13
    8.0 11.5575 1.0238×10-12 7.9 11.4497 1.0559×10-11
    1000 1500 9.6 18.4934 5.6351×10-12 9.5 18.6699 1.6880×10-11
    9.9 19.0396 5.2759×10-12 11.1 21.6384 5.9206×10-11
    8.4 16.3751 1.2735×10-11 10.9 21.3177 7.6313×10-12

     | Show Table
    DownLoad: CSV
    Table 2.  Numerical results of solving LWCP (ⅰ) ( \tau = 1, q = 3 ).
    m n LM TLM
    AIT ACPU ANH AIT ACPU ANH
    200 500 7.5 0.6642 1.5973×10-11 8.0 0.7155 9.7275×10-12
    7.4 0.6675 8.8485×10-12 8.4 0.7429 8.7482×10-13
    7.6 0.6661 2.5321×10-12 8.1 0.7167 6.7422×10-13
    400 800 8.0 2.3642 2.4919×10-13 8.8 2.6212 4.6000×10-12
    8.0 2.3791 4.5892×10-13 8.2 2.5740 2.4604×10-13
    8.2 2.4293 9.2368×10-13 9.0 2.6885 1.3216×10-12
    500 1000 8.0 4.3592 6.2691×10-13 8.3 4.5328 3.5736×10-12
    8.1 4.3174 3.1221×10-13 8.2 4.3540 3.2290×10-13
    7.9 4.2089 9.7440×10-12 9.9 5.3469 6.5691×10-12
    600 1500 7.9 11.3807 9.2057×10-12 8.9 12.9567 9.7825×10-13
    7.8 11.2766 1.3435×10-11 8.0 11.6116 9.9437×10-13
    8.0 11.5494 9.8875×10-13 9.2 13.3792 1.0247×10-12
    1000 1500 9.3 17.6422 7.8120×10-12 8.9 17.2609 3.4824×10-12
    8.7 16.3247 4.9019×10-12 8.8 17.3407 4.7999×10-11
    9.3 18.1968 7.8112×10-12 9.4 18.4024 1.3738×10-11

     | Show Table
    DownLoad: CSV
    Figure 2.  Comparison curves of solving LWCP (ⅱ) ( \tau = 0.3, q = 3, m = \frac{n}{2} ).
    Figure 3.  Comparison bars of solving LWCP (ⅱ) ( \tau = 0.8, q = 3, m = \frac{n}{2} ).

    Tables 1 and 2 show the numerical results for LWCP (ⅰ). Where, the parameters are taken as \tau = 0.5, q = 3;\tau = 1, q = 3 respectively. It can be seen from the table that no matter what value \tau takes, our algorithm 3.1 has less iteration time or higher accuracy than algorithm 1 in [13].

    Figures 2 and 3 show the numerical results for solving LWCP (ⅱ). Where, the parameters are respectively taken as \tau = 0.3, q = 3, m = \frac{n}{2};\tau = 0.8, q = 3, m = \frac{n}{2} . It can be seen from the figure that with the increase of dimension, the AIT of algorithm 3.1 fluctuates slightly, but it is always smaller than the AIT in [13]. The ACPU increases steadily and always smaller than the ACPU in [13].

    When \tau = 0.6, q = 3, m = \frac{n}{2} , Figure 4 shows the ACPU and AIT comparison line graphs for LWCP (ⅰ) and LWCP (ⅱ) solved by algorithms 3.1 and [13] respectively. It can be seen from the figure that after adding noise to LWCP (ⅰ), the solution speed of both algorithms decreases, but our algorithm still has certain advantages.

    Figure 4.  Comparison curves of solving LWCP (ⅰ) and LWCP (ⅱ) ( \tau = 0.6, q = 3, m = \frac{n}{2} ).

    In general, the problems generated by numerical experiments converge in a few iterations. The number of iterations varies slightly with the dimension of the problem. Our algorithm is effective for the linear weighted complementarity problem LWCP (1.3), because each problem can be successfully solved in a very short time with a small number of iterations. Numerical results show the feasibility and effectiveness of the algorithm 3.1.

    Based on the idea of L-M method, with the help of a new class of WCP functions {\varphi }_{\tau , q}^{c}(a, b), we give the algorithm 3.1 for solving the LWCP (1.3). Under certain conditions, our algorithm can obtain the approximate solution of LWCP (1.3). Numerical experiments show the feasibility and effectiveness of the algorithm 3.1.

    The authors declare no conflicts of interest.



    [1] I. R. Istrate, D. Iribarren, J. L. Gálvez-Martos, J. Dufour, Review of life-cycle environmental consequences of waste-to-energy solutions on the municipal solid waste management system, Resour. Conserv. Recycl., 157 (2020), 104778. https://doi.org/10.1016/j.resconrec.2020.104778 doi: 10.1016/j.resconrec.2020.104778
    [2] Y. T. Chong, K. M. Teo, L. C. Tang, A lifecycle-based sustainability indicator framework for waste-to-energy systems and a proposed metric of sustainability, Renew. Sustain. Energy Rev., 56 (2016), 797–809. https://doi.org/10.1016/j.rser.2015.11.036 doi: 10.1016/j.rser.2015.11.036
    [3] X. G. Zhao, G. W. Jiang, A. Li. Y. Li, Technology, cost, a performance of waste-to-energy incineration industry in China, Renew. Sustain. Energy Rev., 55 (2016), 115–130. https://doi.org/10.1016/j.rser.2015.10.137
    [4] K. Ghoseiri, J. Lessan, Waste disposal site selection using an analytic hierarchal pairwise comparison and ELECTRE approaches under fuzzy environment, J. Intell. Fuzzy Syst., 26 (2014), 693–704. https://doi.org/10.3233/IFS-120760 doi: 10.3233/IFS-120760
    [5] L. Wang, X. Zhang, Bayesian analytics for estimating risk probability in PPP waste-to-energy projects, J. Manag. Eng., 34 (2018), 1–13. https://doi.org/10.1061/(asce)me.1943-5479.0000658 doi: 10.1061/(asce)me.1943-5479.0000658
    [6] Y. Wu, J. Wang, Y. Hu, Y. Ke, L. Li, An extended TODIM-PROMETHEE method for waste-to-energy plant site selection based on sustainability perspective, Energy, 156 (2018), 1–16. https://doi.org/10.1016/j.energy.2018.05.087 doi: 10.1016/j.energy.2018.05.087
    [7] B. Saveyn, On NIMBY and commuting, Int. Tax Public Financ., 20 (2013), 293–311. https://doi.org/10.1007/s10797-012-9228-x
    [8] S. Belayutham, V. A. González, T. W. Yiu, A cleaner production-pollution prevention based framework for construction site induced water pollution, J. Clean. Prod., 135 (2016), 1363–1378. https://doi.org/10.1016/j.jclepro.2016.07.003 doi: 10.1016/j.jclepro.2016.07.003
    [9] J. Song, D. Song, D. Zhang, Modeling the concession period and subsidy for BOT waste-to-energy incineration projects, J. Constr. Eng. Manag., 141 (2015). https://doi.org/10.1061/(asce)co.1943-7862.0001005
    [10] N. Komendantova, A. Battaglini, Beyond Decide-Announce-Defend (DAD) and Not-in-My-Backyard (NIMBY) models? Addressing the social and public acceptance of electric transmission lines in Germany, Energy Res. Soc. Sci., 22 (2016), 224–231. https://doi.org/10.1016/j.erss.2016.10.001 doi: 10.1016/j.erss.2016.10.001
    [11] L. Sun, D. Zhu, E. H. W. Chan, Public participation impact on environment NIMBY conflict and environmental conflict management: comparative analysis in Shanghai and Hong Kong, Land Use Policy., 58 (2016), 208–217. https://doi.org/10.1016/j.landusepol.2016.07.025 doi: 10.1016/j.landusepol.2016.07.025
    [12] M. A. Petrova, From NIMBY to acceptance: toward a novel framework-VESPA-for organizing and interpreting community concerns, Renew. Energy., 86 (2016), 1280–1294. https://doi.org/10.1016/j.renene.2015.09.047 doi: 10.1016/j.renene.2015.09.047
    [13] R. J. Johnson, M. J. Scicchitano, Don't call me NIMBY: public attitudes toward solid waste facilities, Environ. Behav., 44 (2012), 410–426. https://doi.org/10.1177/0013916511435354 doi: 10.1177/0013916511435354
    [14] D. M. McLaughlin, B. B. Cutts, Neither knowledge deficit nor NIMBY: Understanding opposition to hydraulic fracturing as a nuanced coalition in westmoreland county, Pennsylvania (USA), Environ. Manage., 62 (2018), 305–322. https://doi.org/10.1007/s00267-018-1052-3 doi: 10.1007/s00267-018-1052-3
    [15] H. Jenkins-Smith, H. Kunreuther, Mitigation and benefits measures as policy tools for siting potentially hazardous facilities: determinants of effectiveness and appropriateness, Risk Anal., 21 (2001), 371–382. https://doi.org/10.1111/0272-4332.212118 doi: 10.1111/0272-4332.212118
    [16] Y. Wu, G. Zhai, S. Li, C. Ren, S. Tsuchida, Comparative research on NIMBY risk acceptability between Chinese and Japanese college students, Environ. Monit. Assess., 186 (2014), 6683–6694. https://doi.org/10.1007/s10661-014-3882-7 doi: 10.1007/s10661-014-3882-7
    [17] P. Devine-Wright, Explaining "NIMBY" objections to a power line: the role of personal, place attachment and project-related factors, Environ. Behav., 45 (2013), 761–781. https://doi.org/10.1177/0013916512440435
    [18] A. Schwenkenbecher, What is wrong with nimbys? Renewable energy, landscape impacts and incommensurable values, Environ. Values, 26 (2017), 711–732. https://doi.org/10.3197/096327117X15046905490353 doi: 10.3197/096327117X15046905490353
    [19] E. K. Zavadskas, R. Baušys, M. Lazauskas, Sustainable assessment of alternative sites for the construction of a waste incineration plant by applying WASPAS method with single-valued neutrosophic set, Sustainability, 7 (2015), 15923–15936. https://doi.org/10.3390/su71215792 doi: 10.3390/su71215792
    [20] G. Tavares, Z. Zsigraiová, V. Semiao, Multi-criteria GIS-based siting of an incineration plant for municipal solid waste, Waste Manag., 31 (2011), 1960–1972. https://doi.org/10.1016/j.wasman.2011.04.013 doi: 10.1016/j.wasman.2011.04.013
    [21] M. Eskandari, M. Homaee, S. Mahmodi, An integrated multi criteria approach for landfill siting in a conflicting environmental, economical and socio-cultural area, Waste Manag., 32 (2012), 1528–1538. https://doi.org/10.1016/j.wasman.2012.03.014 doi: 10.1016/j.wasman.2012.03.014
    [22] M. Ekmekçioĝlu, T. Kaya, C. Kahraman, Fuzzy multicriteria disposal method and site selection for municipal solid waste, Waste Manag., 30 (2010), 1729–1736. https://doi.org/10.1016/j.wasman.2010.02.031 doi: 10.1016/j.wasman.2010.02.031
    [23] X. Pan, Y. Wang, K. S. Chin, A large-scale group decision-making method for site selection of waste to energy project under interval Type-2 fuzzy environment, Sustain. Cities Soc., 71 (2021), 103003. https://doi.org/10.1016/j.scs.2021.103003 doi: 10.1016/j.scs.2021.103003
    [24] J. Gao, X. Li, F. Guo, X. Huang, H. Men, M. Li, Site selection decision of waste-to-energy projects based on an extended cloud-TODIM method from the perspective of low-carbon, J. Clean. Prod., 303 (2021), 127036. https://doi.org/10.1016/j.jclepro.2021.127036 doi: 10.1016/j.jclepro.2021.127036
    [25] Y. Wu, L. Qin, C. Xu, S. Ji, Site selection of waste-to-energy (WtE) plant considering public satisfaction by an extended VIKOR method, Math. Probl. Eng., 2018 (2018). https://doi.org/10.1155/2018/5213504 doi: 10.1155/2018/5213504
    [26] M. Rezaei-Shouroki, A. Mostafaeipour, M. Qolipour, Prioritizing of wind farm locations for hydrogen production: a case study, Int. J. Hydrogen Energy, 42 (2017), 9500–9510. https://doi.org/10.1016/j.ijhydene.2017.02.072 doi: 10.1016/j.ijhydene.2017.02.072
    [27] M. Jahangiri, M. Rezaei, A. Mostafaeipour, A. R. Goojani, H. Saghaei, S. J. Hosseini Dehshiri, et al., Prioritization of solar electricity and hydrogen co-production stations considering PV losses and different types of solar trackers: a TOPSIS approach, Renew. Energy, 186 (2022), 889–903. https://doi.org/10.1016/j.renene.2022.01.045
    [28] M. Rezaei, K. R. Khalilpour, M. Jahangiri, Multi-criteria location identification for wind/solar based hydrogen generation: the case of capital cities of a developing country, Int. J. Hydrogen Energy, 45 (2020), 33151–33168. https://doi.org/10.1016/j.ijhydene.2020.09.138 doi: 10.1016/j.ijhydene.2020.09.138
    [29] M. Rezaei, S. A. Alharbi, A. Razmjoo, M. A. Mohamed, Accurate location planning for a wind-powered hydrogen refueling station: fuzzy VIKOR method, Int. J. Hydrogen Energy, 46 (2021), 33360–33374. https://doi.org/10.1016/j.ijhydene.2021.07.154 doi: 10.1016/j.ijhydene.2021.07.154
    [30] M. Akram, G. Ali, J. C. R. Alcantud, New decision-making hybrid model: intuitionistic fuzzy N-soft rough sets, Soft Comput., 23 (2019), 9853–9868. https://doi.org/10.1007/s00500-019-03903-w doi: 10.1007/s00500-019-03903-w
    [31] J. C. R. Alcantud, A. Z. Khameneh, A. Kilicman, Aggregation of infinite chains of intuitionistic fuzzy sets and their application to choices with temporal intuitionistic fuzzy information, Inf. Sci. Ny., 514 (2020), 106–117. https://doi.org/10.1016/j.ins.2019.12.008 doi: 10.1016/j.ins.2019.12.008
    [32] X. Zhao, X. Zhao, G. Jiang, A. Li, L. Wang, Economic analysis of waste-to-energy industry in China, Waste Manag., 48 (2016), 604–618. https://doi.org/10.1016/j.wasman.2015.10.014 doi: 10.1016/j.wasman.2015.10.014
    [33] C. Luo, Y. Ju, E. D. R. Santibanez Gonzalez, P. Dong, A. Wang, The waste-to-energy incineration plant site selection based on hesitant fuzzy linguistic best-worst method ANP and double parameters TOPSIS approach: a case study in China, Energy, 211 (2020), 118564. https://doi.org/10.1016/j.energy.2020.118564 doi: 10.1016/j.energy.2020.118564
    [34] C. Sun, X. Meng, S. Peng, Effects of waste-to-energy plants on China's urbanization: evidence from a hedonic price analysis in Shenzhen, Sustainability, 9 (2017), 1–18. https://doi.org/10.3390/su9030475 doi: 10.3390/su9030475
    [35] Y. Wu, K. Chen, B. Zeng, M. Yang, S. Geng, Cloud-based decision framework for waste-to-energy plant site selection - a case study from China, Waste Manag., 48 (2026), 593–603. https://doi.org/10.1016/j.wasman.2015.11.030 doi: 10.1016/j.wasman.2015.11.030
    [36] J. Song, D. Song, X. Zhang, Y. Sun, Risk identification for PPP waste-to-energy incineration projects in China, Energy Policy, 61 (2013), 953–962. https://doi.org/10.1016/j.enpol.2013.06.041 doi: 10.1016/j.enpol.2013.06.041
    [37] Y. Wu, J. Zhou, Y. Hu, L. Li, X. Sun, A TODIM-based investment decision framework for commercial distributed PV projects under the energy performance contracting (EPC) business model: a case in east-central China, Energies, 11 (2018). https://doi.org/10.3390/en11051210
    [38] S. Kimbrough, D. A. Vallero, R. C. Shores, W. Mitchell, Enhanced, multi criteria based site selection to measure mobile source toxic air pollutants, Transp. Res. D Transp. Environ., 16 (2011), 586–590. https://doi.org/10.1016/j.trd.2011.07.003
    [39] P. G. Savva, C. N. Costa, A. G. Charalambides, Environmental, economical and marketing aspects of the operation of a waste-to-energy plant in the Kotsiatis Landfill in Cyprus, Waste Biomass Valori., 4 (2013), 259–269. https://doi.org/10.1007/s12649-012-9148-0
    [40] I. Arbulú, J. Lozano, J. Rey-Maquieira, The challenges of Tourism to waste-to-energy public-private partnerships, Renew. Sustain. Energy Rev., 72 (2017), 916–921. https://doi.org/10.1016/j.rser.2017.01.036
    [41] I. Khan, Z. Kabir, Waste-to-energy generation technologies and the developing economies: a multi-criteria analysis for sustainability assessment, Renew. Energy, 150 (2020), 320–333. https://doi.org/10.1016/j.renene.2019.12.132 doi: 10.1016/j.renene.2019.12.132
    [42] Y. Xu, A. P. C. Chan, B. Xia, Q. K. Qian, Y. Liu, Y. Peng, Critical risk factors affecting the implementation of PPP waste-to-energy projects in China, Appl. Energy, 158 (2015), 403–411. https://doi.org/10.1016/j.apenergy.2015.08.043 doi: 10.1016/j.apenergy.2015.08.043
    [43] S. Giaccaria, V. Frontuto, Perceived health status and environmental quality in the assessment of external costs of waste disposal facilities. An empirical investigation, Waste Manag. Res., 30 (2012), 864–870. https://doi.org/10.1177/0734242X12445654 doi: 10.1177/0734242X12445654
    [44] A. Thorn, Issue definition and conflict expansion: the role of risk to human health as an issue definition strategy in an environmental conflict, Policy Sci., 51 (2018), 59–76. https://doi.org/10.1007/s11077-018-9312-x doi: 10.1007/s11077-018-9312-x
    [45] P. G. Fredriksson, The siting of hazardous waste facilities in federal systems, Environ. Resour. Econ., 15 (2000), 75–87. https://doi.org/10.1023/A:1008313612369 doi: 10.1023/A:1008313612369
    [46] Q. Yang, Y. Zhu, X. Liu, L. Fu, Q. Guo, Bayesian-based NIMBY crisis transformation path discovery for municipal solid waste incineration in China, Sustainability, 11 (2019). https://doi.org/10.3390/su11082364
    [47] A. Coi, F. Minichilli, E. Bustaffa, S. Carone, M. Santoro, F. Bianchi, et al., Risk perception and access to environmental information in four areas in Italy affected by natural or anthropogenic pollution, Environ. Int., 95 (2016), 8–15. https://doi.org/10.1016/j.envint.2016.07.009
    [48] M. L. Tseng, A causal and effect decision making model of service quality expectation using grey-fuzzy DEMATEL approach, Expert Syst. Appl., 36 (2009), 7738–7748. https://doi.org/10.1016/j.eswa.2008.09.011 doi: 10.1016/j.eswa.2008.09.011
    [49] K. T. Atanassov, Intuitionistic fuzzy sets, Fuzzy Sets Syst., 20 (1986), 87–96. https://doi.org/10.1016/S0165-0114(86)80034-3
    [50] Z. Xu, Intuitionistic fuzzy aggregation operators, IEEE Trans. Fuzzy Syst., 15 (2007), 1179–1187. https://doi.org/10.1016/j.inffus.2012.01.011 doi: 10.1016/j.inffus.2012.01.011
    [51] Z. Xu, An overview of distance and similarity measures of intuitionistic fuzzy sets, Int. J. Uncertainty, Fuzziness Knowledge-Based Syst., 16 (2008), 529–555. https://doi.org/10.1007/s10462-020-09821-w
    [52] E. Szmidt, J. Kacprzyk, Distances between intuitionistic fuzzy sets, Fuzzy Sets Syst., 114 (2000), 505–518. https://doi.org/10.1016/S0165-0114(98)00244-9 doi: 10.1016/S0165-0114(98)00244-9
    [53] Y. Wu, B. Zhang, C. Xu, L. Li, Site selection decision framework using fuzzy ANP-VIKOR for large commercial rooftop PV system based on sustainability perspective, Sustain. Cities Soc., 40 (2018), 454–470. https://doi.org/10.1016/j.scs.2018.04.024 doi: 10.1016/j.scs.2018.04.024
    [54] R. Simanaviciene, L. Ustinovichius, Sensitivity analysis for multiple criteria decision making methods: TOPSIS and SAW, Procedia Soc. Behav. Sci., 2 (2010), 7743–7744. https://doi.org/10.1016/j.sbspro.2010.05.207 doi: 10.1016/j.sbspro.2010.05.207
  • 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(1706) PDF downloads(84) Cited by(6)

Figures and Tables

Figures(4)  /  Tables(11)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog