Harris Hawks Optimizer (HHO) is a recent well-established optimizer based on the hunting characteristics of Harris hawks, which shows excellent efficiency in solving a variety of optimization issues. However, it under...Harris Hawks Optimizer (HHO) is a recent well-established optimizer based on the hunting characteristics of Harris hawks, which shows excellent efficiency in solving a variety of optimization issues. However, it undergoes weak global search capability because of the levy distribution in its optimization process. In this paper, a variant of HHO is proposed using Crisscross Optimization Algorithm (CSO) to compensate for the shortcomings of original HHO. The novel developed optimizer called Crisscross Harris Hawks Optimizer (CCHHO), which can effectively achieve high-quality solutions with accelerated convergence on a variety of optimization tasks. In the proposed algorithm, the vertical crossover strategy of CSO is used for adjusting the exploitative ability adaptively to alleviate the local optimum;the horizontal crossover strategy of CSO is considered as an operator for boosting explorative trend;and the competitive operator is adopted to accelerate the convergence rate. The effectiveness of the proposed optimizer is evaluated using 4 kinds of benchmark functions, 3 constrained engineering optimization issues and feature selection problems on 13 datasets from the UCI repository. Comparing with nine conventional intelligence algorithms and 9 state-of-the-art algorithms, the statistical results reveal that the proposed CCHHO is significantly more effective than HHO, CSO, CCNMHHO and other competitors, and its advantage is not influenced by the increase of problems’ dimensions. Additionally, experimental results also illustrate that the proposed CCHHO outperforms some existing optimizers in working out engineering design optimization;for feature selection problems, it is superior to other feature selection methods including CCNMHHO in terms of fitness, error rate and length of selected features.展开更多
This paper proposes a group decision making method based on entropy of neutrosophic linguistic sets and generalized single valued neutrosophic linguistic operators. This method is applied to solve the multiple attribu...This paper proposes a group decision making method based on entropy of neutrosophic linguistic sets and generalized single valued neutrosophic linguistic operators. This method is applied to solve the multiple attribute group decision making problems under single valued neutrosophic liguistic environment, in which the attribute weights are completely unknown. First, the attribute weights are obtained by using the entropy of neutrosophic linguistic sets. Then three generalized single valued neutrosophic linguistic operators are introduced, including the generalized single valued neutrosophic linguistic weighted averaging(GSVNLWA) operator, the generalized single valued neutrosophic linguistic ordered weighted averaging(GSVNLOWA) operator and the generalized single valued neutrosophic linguistic hybrid averaging(GSVNLHA) operator, and the GSVNLWA and GSVNLHA operators are used to aggregate information. Furthermore, similarity measure based on single valued neutrosophic linguistic numbers is defined and used to sort the alternatives and obtain the best alternative. Finally,an illustrative example is given to demonstrate the feasibility and effectiveness of the developed method.展开更多
Accurate battlefield collection plays a crucial role in the end of thewar. How to effectively improve the ability of accurate battlefield collection hasbecome a hot issue of research. However, the existing support for...Accurate battlefield collection plays a crucial role in the end of thewar. How to effectively improve the ability of accurate battlefield collection hasbecome a hot issue of research. However, the existing support force is limited. Tosolve the problem, an improved ant algorithm is applied to the path optimizationproblem of battlefield collection equipment. A model for solving the collectionpath optimization problem of battlefield collection vehicles was designed, andan example was used to simulate calculations. The final results show that thealgorithm is effective and practical,which improves the army’s ability to accuratelycollect equipment in the modern battlefield.展开更多
文摘Harris Hawks Optimizer (HHO) is a recent well-established optimizer based on the hunting characteristics of Harris hawks, which shows excellent efficiency in solving a variety of optimization issues. However, it undergoes weak global search capability because of the levy distribution in its optimization process. In this paper, a variant of HHO is proposed using Crisscross Optimization Algorithm (CSO) to compensate for the shortcomings of original HHO. The novel developed optimizer called Crisscross Harris Hawks Optimizer (CCHHO), which can effectively achieve high-quality solutions with accelerated convergence on a variety of optimization tasks. In the proposed algorithm, the vertical crossover strategy of CSO is used for adjusting the exploitative ability adaptively to alleviate the local optimum;the horizontal crossover strategy of CSO is considered as an operator for boosting explorative trend;and the competitive operator is adopted to accelerate the convergence rate. The effectiveness of the proposed optimizer is evaluated using 4 kinds of benchmark functions, 3 constrained engineering optimization issues and feature selection problems on 13 datasets from the UCI repository. Comparing with nine conventional intelligence algorithms and 9 state-of-the-art algorithms, the statistical results reveal that the proposed CCHHO is significantly more effective than HHO, CSO, CCNMHHO and other competitors, and its advantage is not influenced by the increase of problems’ dimensions. Additionally, experimental results also illustrate that the proposed CCHHO outperforms some existing optimizers in working out engineering design optimization;for feature selection problems, it is superior to other feature selection methods including CCNMHHO in terms of fitness, error rate and length of selected features.
基金Supported by the Social Science Planning Project of Fujian Province(FJ2016C028)Education and Scientific Research Projects of Young and Middle-aged Teachers in Fujian Province(JAT160556,JAT160559)Research Project of Information Office of Fuzhou University(FXK-16001)
文摘This paper proposes a group decision making method based on entropy of neutrosophic linguistic sets and generalized single valued neutrosophic linguistic operators. This method is applied to solve the multiple attribute group decision making problems under single valued neutrosophic liguistic environment, in which the attribute weights are completely unknown. First, the attribute weights are obtained by using the entropy of neutrosophic linguistic sets. Then three generalized single valued neutrosophic linguistic operators are introduced, including the generalized single valued neutrosophic linguistic weighted averaging(GSVNLWA) operator, the generalized single valued neutrosophic linguistic ordered weighted averaging(GSVNLOWA) operator and the generalized single valued neutrosophic linguistic hybrid averaging(GSVNLHA) operator, and the GSVNLWA and GSVNLHA operators are used to aggregate information. Furthermore, similarity measure based on single valued neutrosophic linguistic numbers is defined and used to sort the alternatives and obtain the best alternative. Finally,an illustrative example is given to demonstrate the feasibility and effectiveness of the developed method.
文摘Accurate battlefield collection plays a crucial role in the end of thewar. How to effectively improve the ability of accurate battlefield collection hasbecome a hot issue of research. However, the existing support force is limited. Tosolve the problem, an improved ant algorithm is applied to the path optimizationproblem of battlefield collection equipment. A model for solving the collectionpath optimization problem of battlefield collection vehicles was designed, andan example was used to simulate calculations. The final results show that thealgorithm is effective and practical,which improves the army’s ability to accuratelycollect equipment in the modern battlefield.
