Hua Zhu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Hua Zhu has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
Jianbin Zhao
5 shared publicationsYang Xu
Department of Mathematics, Southwest Jiaotong University, Chengdu, P.R. China
4 shared publications- Jianbin Zhao
Henan Academy of Big Data, Zhengzhou University, Zhengzhou, China
2 shared publications - Bushra Naz1 shared publication
G.Z. Gertner
Department of Forestry, University of Illinois, 1102 South Goodwin, Urbana, IL 16801, USA
1 shared publicationHua Li
1 shared publication
Latest Publications
- Open Access
- 10 May 2026
- Published by Scientific Oasis in Spectrum of Operational Research
- p. 1-40
Complex Pythagorean Fuzzy Aczel–Alsina Weighted Heronian Mean Operators and Their Applications in MCDM
Aggregation operators serve as fundamental mathematical tools for synthesizing multiple inputs into a single representative output. In this study, we introduce a family of aggregation operators (AOs) tailored to the framework of complex Pythagorean fuzzy sets (CPyFSs). Owing to their superior ability to capture both amplitude and phase information, CPyFSs offer enhanced flexibility in modeling uncertainty and vagueness, making them highly suitable for real-world decision-making problems. Motivated by these advantages, this paper develops several novel AOs within the CPyFS environment to address multi-attribute decision-making (MADM) problems more effectively. To further enhance the flexibility and robustness of the proposed operators, Aczél–Alsina (AA) operational laws are incorporated. In particular, we propose the complex Pythagorean fuzzy Aczél–Alsina Heronian mean (CPyFAAHM) operator and the complex Pythagorean fuzzy Aczél–Alsina geometric Heronian mean (CPyFAAGHM) operator, which integrate AA operations with Heronian mean and geometric Heronian mean structures. We investigate the key mathematical properties of the proposed operators, including their structural characteristics and aggregation behavior. Additionally, weighted versions of these operators are developed to accommodate the varying importance of decision attributes. Based on these operators, a MADM methodology is constructed for decision-making under the CPyFS framework. Finally, the effectiveness and practicality of the proposed approach are demonstrated through a numerical example, followed by a comparative analysis with existing MADM methods under complex Pythagorean fuzzy information, highlighting its superiority and applicability.
- 10 May 2026
- Published by Scientific Oasis in Spectrum of Operational Research
- p. 1-40
Open AccessComplex Pythagorean Fuzzy Aczel–Alsina Weighted Heronian Mean Operators and Their Applications in MCDM
Aggregation operators serve as fundamental mathematical tools for synthesizing multiple inputs into a single representative output. In this study, we introduce a family of aggregation operators (AOs) tailored to the framework of complex Pythagorean fuzzy sets (CPyFSs). Owing to their superior ability to capture both amplitude and phase information, CPyFSs offer enhanced flexibility in modeling uncertainty and vagueness, making them highly suitable for real-world decision-making problems. Motivated by these advantages, this paper develops several novel AOs within the CPyFS environment to address multi-attribute decision-making (MADM) problems more effectively. To further enhance the flexibility and robustness of the proposed operators, Aczél–Alsina (AA) operational laws are incorporated. In particular, we propose the complex Pythagorean fuzzy Aczél–Alsina Heronian mean (CPyFAAHM) operator and the complex Pythagorean fuzzy Aczél–Alsina geometric Heronian mean (CPyFAAGHM) operator, which integrate AA operations with Heronian mean and geometric Heronian mean structures. We investigate the key mathematical properties of the proposed operators, including their structural characteristics and aggregation behavior. Additionally, weighted versions of these operators are developed to accommodate the varying importance of decision attributes. Based on these operators, a MADM methodology is constructed for decision-making under the CPyFS framework. Finally, the effectiveness and practicality of the proposed approach are demonstrated through a numerical example, followed by a comparative analysis with existing MADM methods under complex Pythagorean fuzzy information, highlighting its superiority and applicability.
- 1 August 2019
- Published by Elsevier in Expert Systems with Applications
- Vol. 127, 97-108
2-Dimension linguistic PROMETHEE methods for multiple attribute decision making
- 1 August 2019
- Published by Elsevier in Expert Systems with Applications
- Vol. 127, 97-108
2-Dimension linguistic PROMETHEE methods for multiple attribute decision making
- Open Access
- 1 January 2019
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 12 (2) , 1557-1574
2-Dimension Linguistic Bonferroni Mean Aggregation Operators and Their Application to Multiple Attribute Group Decision Making
- 1 January 2019
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 12 (2) , 1557-1574
Open Access2-Dimension Linguistic Bonferroni Mean Aggregation Operators and Their Application to Multiple Attribute Group Decision Making
- 1 December 2017
- Published by SAGE Publications in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
- Vol. 33 (6) , 3939-3947
Study on the properties of A-subset
The concept of A-subset is introduced in lattice implication algebras. Firstly, the properties of the A-subset are discussed when A is a general set of lattice implication algebras. Next, the properties of A-subset are investigated when the A is an LI-ideal of lattice implication algebras. We obtain some properties of A-subset and prove that B(A)(the A-subset of B) is an LI-ideal in lattice implication algebras. Finally, the properties of A-subset are investigated in lattice implication product algebras. We prove that the A-subset of ∏ i = 1 n B i is the product of A-subset of B i ( i = 1, 2, ⋯ , n ) respectively ( ( ∏ i = 1 n B i ) ( ∏ i = 1 n A i ) = ( ∏ i = 1 n B i ( A i ) ) ) .
- 1 December 2017
- Published by SAGE Publications in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
- Vol. 33 (6) , 3939-3947
Study on the properties of A-subset
The concept of A-subset is introduced in lattice implication algebras. Firstly, the properties of the A-subset are discussed when A is a general set of lattice implication algebras. Next, the properties of A-subset are investigated when the A is an LI-ideal of lattice implication algebras. We obtain some properties of A-subset and prove that B(A)(the A-subset of B) is an LI-ideal in lattice implication algebras. Finally, the properties of A-subset are investigated in lattice implication product algebras. We prove that the A-subset of ∏ i = 1 n B i is the product of A-subset of B i ( i = 1, 2, ⋯ , n ) respectively ( ( ∏ i = 1 n B i ) ( ∏ i = 1 n A i ) = ( ∏ i = 1 n B i ( A i ) ) ) .
- 22 November 2016
- Published by World Scientific Pub Co Pte Ltd in International Journal of Information Technology & Decision Making
- Vol. 15 (06) , 1345-1366
Interval-Valued Belief Rule Inference Methodology Based on Evidential Reasoning-IRIMER
- 22 November 2016
- Published by World Scientific Pub Co Pte Ltd in International Journal of Information Technology & Decision Making
- Vol. 15 (06) , 1345-1366
Interval-Valued Belief Rule Inference Methodology Based on Evidential Reasoning-IRIMER
- 1 July 2016
- Published by Elsevier in Knowledge-Based Systems
- Vol. 103, 132-142
2-dimension linguistic computational model with 2-tuples for multi-attribute group decision making
- 1 July 2016
- Published by Elsevier in Knowledge-Based Systems
- Vol. 103, 132-142
2-dimension linguistic computational model with 2-tuples for multi-attribute group decision making
- 31 May 2016
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 9 (4) , 611-620
On derivations of linguistic truth-valued lattice implication algebras
- 31 May 2016
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 9 (4) , 611-620
On derivations of linguistic truth-valued lattice implication algebras
- Open Access
- 1 January 2013
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 6 (6) , 1002-1011
IFI-ideals of lattice implication algebras
The notion of IFI-ideal is introduced in lattice implication algebras. Firstly, the equivalent conditions of IF-ideals and IFI-ideals are given in lattice implication algebras. Then the proposition of IFI-ideal is investigated in lattice implication algebras. Next, the relations between IFI-ideal and IF-ideal, between IFI-ideal and IFI-filter, between IFI-ideal and fuzzy impilcative ideals, between IFI-ideal and implicative ideals are discussed in lattice implication algebras. Moreover, the extension theorem of IFI-ideals is obtained, and Ψ(L) which is composed of all IFI-ideals constitutes a closure system. Finally, we prove that ∀α ∈ [0, 1], A = (µ 0,α , µ 0,α) is an IFI-ideal of lattice implication algebra L if and only if L is a lattice H implication algebra.
- 1 January 2013
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 6 (6) , 1002-1011
Open AccessIFI-ideals of lattice implication algebras
The notion of IFI-ideal is introduced in lattice implication algebras. Firstly, the equivalent conditions of IF-ideals and IFI-ideals are given in lattice implication algebras. Then the proposition of IFI-ideal is investigated in lattice implication algebras. Next, the relations between IFI-ideal and IF-ideal, between IFI-ideal and IFI-filter, between IFI-ideal and fuzzy impilcative ideals, between IFI-ideal and implicative ideals are discussed in lattice implication algebras. Moreover, the extension theorem of IFI-ideals is obtained, and Ψ(L) which is composed of all IFI-ideals constitutes a closure system. Finally, we prove that ∀α ∈ [0, 1], A = (µ 0,α , µ 0,α) is an IFI-ideal of lattice implication algebra L if and only if L is a lattice H implication algebra.