Elliptical distribution-based weight-determining method for ordered weighted averaging operators

The ordered weighted averaging (OWA) operators play a crucial role in aggregating multiple criteria evaluations into an overall assessment supporting the decision makers’ choice. One key point steps is to determine the associated weights. In this paper, we first briefly review some main methods for determining the weights by using distribution functions. Then we propose a new approach for determining OWA weights by using the regular increasing monotone quantifier. Motivated by the idea of normal distribution-based method to determine the OWA weights, we develop a method based on elliptical distributions for determining the OWA weights, and some of its desirable properties have been investigated.     

Some q-rung orthopair uncertain linguistic aggregation operators and their application to multiple attribute group decision making

q-Rung orthopair fuzzy sets (q-ROFSs), originally presented by Yager, are a powerful fuzzy information representation model, which generalize the classical intuitionistic fuzzy sets and Pythagorean fuzzy sets and provide more freedom and choice for decision makers (DMs) by allowing the sum of the $q\mathrm{t}\mathrm{h}$ power of the membership and the $q\mathrm{t}\mathrm{h}$ power of the nonmembership to be less than or equal to 1. In this paper, a new class of fuzzy sets called q-rung orthopair uncertain linguistic sets (q-ROULSs) based on the q-ROFSs and uncertain linguistic variables (ULVs) is proposed, and this can describe the qualitative assessment of DMs and provide them more freedom in reflecting their belief about allowable membership grades. On the basis of the proposed operational rules and comparison method of q-ROULSs, several q-rung orthopair uncertain linguistic aggregation operators are developed, including the q-rung orthopair uncertain linguistic weighted arithmetic average operator, the q-rung orthopair uncertain linguistic ordered weighted average operator, the q-rung orthopair uncertain linguistic hybrid weighted average operator, the q-rung orthopair uncertain linguistic weighted geometric average operator, the q-rung orthopair uncertain linguistic ordered weighted geometric operator, and the q-rung orthopair uncertain linguistic hybrid weighted geometric operator. Then, some desirable properties and special cases of these new operators are also investigated and studied, in particular, some existing intuitionistic fuzzy aggregation operators and Pythagorean fuzzy aggregation operators are proved to be special cases of these new operators. Furthermore, based on these proposed operators, we develop an approach to solve the multiple attribute group decision making problems, in which the evaluation information is expressed as q-rung orthopair ULVs. Finally, we provide several examples to illustrate the specific decision-making steps and explain the validity and feasibility of two methods by comparing with other methods.     

Multicriteria decision-making using Archimedean aggregation operators in Pythagorean hesitant fuzzy environment

In multicriteria decision-making (MCDM), the existing aggregation operators are mostly based on algebraic t-conorm and t-norm. But, Archimedean t-conorms and t-norms are the generalized forms of t-conorms and t-norms which include algebraic, Einstein, Hamacher, Frank, and other types of t-conorms and t-norms. From that view point, in this paper the concepts of Archimedean t-conorm and t-norm are introduced to aggregate Pythagorean hesitant fuzzy information. Some new operational laws for Pythagorean hesitant fuzzy numbers based on Archimedean t-conorm and t-norm have been proposed. Using those operational laws, Archimedean t-conorm and t-norm-based Pythagorean hesitant fuzzy weighted averaging operator and weighted geometric operator are developed. Some of their desirable properties have also been investigated. Afterwards, these operators are applied to solve MCDM problems in Pythagorean hesitant fuzzy environment. The developed Archimedean aggregation operators are also applicable in Pythagorean fuzzy contexts also. To demonstrate the validity, practicality, and effectiveness of the proposed method, a practical problem is considered, solved, and compared with other existing method.     

改进的区间犹豫算子应用于物流企业选择决策

针对现有区间犹豫模糊Hamacher算子存在的缺陷，构建了一种基于改进的区间犹豫模糊Hamacher加权算子的群决策方法。在分析现有区间犹豫模糊Hamacher算子不能满足幂等性的基础上，定义新的区间犹豫模糊Hamacher四则运算；提出两种改进的区间犹豫模糊Hamacher加权算子，包括改进的区间犹豫模糊Hamacher有序加权平均（I-IVHFHOWA）算子和改进的区间犹豫模糊Hamacher有序加权几何（I-IVHFHOWG）算子，并详细探究它们的常用算子形式以及算子之间的内在联系；建立基于I-IVHFHOWA算子和I-IVHFHOWG算子的物流企业选择决策模型，并通过实例说明模型的有效性。     

Weighted power means of q-rung orthopair fuzzy information and their applications in multiattribute decision making

Weighted power means with weights and exponents serving as their parameters are generalizations of arithmetic means. Taking into account decision makers' flexibility in decision making, each attribute value is usually expressed by a $q$-rung orthopair fuzzy value ($q$-ROFV, $q\ge 1$), where the former indicates the support for membership, the latter support against membership, and the sum of their $q$th powers is bounded by one. In this paper, we propose the weighted power means of $q$-rung orthopair fuzzy values to enrich and flourish aggregations on $q$-ROFVs. First, the $q$-rung orthopair fuzzy weighted power mean operator is presented, and its boundedness is precisely characterized in terms of the power exponent. Then, the $q$-rung orthopair fuzzy ordered weighted power mean operator is introduced, and some of its fundamental properties are investigated in detail. Finally, a novel multiattribute decision making method is explored based on developed operators under the $q$-rung orthopair fuzzy environment. A numerical example is given to illustrate the feasibility and validity of the proposed approach, and it is shown that the power exponent is an index suggesting the degree of the optimism of decision makers.     

Early fault feature extraction of bearings based on Teager energy operator and optimal VMD

As the fault shock component in vibration signals is extremely sparse and weak, it is difficult to extract the fault features when large-scale, low-speed and heavy-duty mechanical equipment is in the early stage of failure. To solve this problem, an early fault feature extraction method based on the Teager energy operator, combined with optimal variational mode decomposition (VMD) is presented in this study. First, the Teager energy operator was used to strengthen the weak shock component of the original signal. Next, a logistic–sine complex chaotic mapping with variable dimensions was constructed to enhance the global search ability and convergence speed of the pigeon-inspired optimization (PIO) algorithm, which is named the variable dimension chaotic pigeon-inspired optimization (VDCPIO) algorithm. Then, the VDCPIO algorithm is used to search for the optimal combination value of key parameters of VMD. The enhanced vibration signal is decomposed into a set of intrinsic mode functions (IMFs) by the optimized VMD, and then kurtosis for every IMF and mean kurtosis of all IMFs are extracted. According to the average kurtosis, several IMFs, whose kurtosis value is greater than the average kurtosis value, are selected to reconstruct a new signal. Then, envelope spectrum analysis of the reconstructed signal is carried out to extract the early fault features. Finally, experimental verification of the method was performed using the simulated signal and measured signal from a rolling bearing; the experimental results indicate that the method presented in this paper is more effective to extract the early fault features of this kind of mechanical equipment.     

多运营商高铁隧道移动网络覆盖方案

高铁移动网络覆盖是国内三大通信运营商的一个重点,而高铁隧道内移动网络覆盖更是运营商的一大难点痛点。文章根据我国中部省份某高铁线路覆盖规划实例,采用“设备+POI+泄漏电缆”模式,即三家运营商信号源设备通过同一POI(point of interface,多系统接入平台)接入,信号输出到泄漏电缆进行隧道覆盖,隧道口场坪站安装宽频切换天线对隧道外进行延伸覆盖,通过链路预算合理布置各运营商主设备信号源,从而实现隧道到室外的无缝覆盖。最后,根据已有成熟网络覆盖解决方案,对未来5G高铁隧道移动网络覆盖方案进行了探讨。     

A directional mutation operator for differential evolution algorithms

Differential evolution (DE) is widely studied in the past decade. In its mutation operator, the random variations are derived from the difference of two randomly selected different individuals. Difference vector plays an important role in evolution. It is observed that the best fitness found so far by DE cannot be improved in every generation. In this article, a directional mutation operator is proposed. It attempts to recognize good variation directions and increase the number of generations having fitness improvement. The idea is to construct a pool of difference vectors calculated when fitness is improved at a generation. The difference vector pool will guide the mutation search in the next generation once only. The directional mutation operator can be applied into any DE mutation strategy. The purpose is to speed up the convergence of DE and improve its performance. The proposed method is evaluated experimentally on CEC 2005 test set with dimension 30 and on CEC 2008 test set with dimensions 100 and 1000. It is demonstrated that the proposed method can result in a larger number of generations having fitness improvement than classic DE. It is combined with eleven DE algorithms as examples of how to combine with other algorithms. After its incorporation, the performance of most of these DE algorithms is significantly improved. Moreover, simulation results show that the directional mutation operator is helpful for balancing the exploration and exploitation capacity of the tested DE algorithms. Furthermore, the directional mutation operator modifications can save computational time compared to the original algorithms. The proposed approach is compared with the proximity based mutation operator as both are claimed to be applicable to any DE mutation strategy. The directional mutation operator is shown to be better than the proximity based mutation operator on the five variants in the DE family. Finally, the applications of two real world engineering optimization problems verify the usefulness of the proposed method.