Search

Academic institutions may be edging towards a global uncertainty, recession, and a string of financial difficulties. An effective course timetabling is one of managerial strategies to optimise the operating costs and resource utilisation. This paper presents the first application of firefly algorithm (FA) and its modifications and hybridisations for solving real-world course timetabling problem. A novel bi-objective firefly algorithm (BOFA) with Pareto dominance approach was developed for optimising the operating costs and resource utilisation. Random key technique was applied for adapting the continuous firefly movement to solve discrete timetabling problem. Five constructive heuristics were additionally embedded into the BOFA for initialising feasible timetables. Computational experiments were sequentially conducted using eleven problem instances obtained from a collaborating university. It was found that the proposed hybridisation outperformed particle swarm optimisation, the classical FA, and modified FA (MFA), in terms of the quality of the timetables obtained, computational times and convergent speed. The proposed hybrid bi-objective FA (HBOFA) yielded better Pareto frontiers than the conventional BOFA with less computational times for all problem instances. [ABSTRACT FROM AUTHOR]

Hyperparameter optimization plays a significant role in the overall performance of machine learning algorithms. However, the computational cost of algorithm evaluation can be extremely high for complex algorithm or large dataset. In this paper, we propose a model-based reinforcement learning with experience variable and meta-learning optimization method to speed up the training process of hyperparameter optimization. Specifically, an RL agent is employed to select hyperparameters and treat the k-fold cross-validation result as a reward signal to update the agent. To guide the agent's policy update, we design an embedding representation called "experience variable" and dynamically update it during the training process. Besides, we employ a predictive model to predict the performance of machine learning algorithm with the selected hyperparameters and limit the model rollout in short horizon to reduce the impact of the inaccuracy of the model. Finally, we use the meta-learning technique to pre-train the model for fast adapting to a new task. To prove the advantages of our method, we conduct experiments on 25 real HPO tasks and the experimental results show that with the limited computational resources, the proposed method outperforms the state-of-the-art Bayesian methods and evolution method. [ABSTRACT FROM AUTHOR]

Digital image technology is penetrating into various fields of people's life, and it has been very mature and can effectively store and transmit data. Moreover, there are still various researches on image recognition, the core of this technology. The algorithm is mainly based on computer technology to obtain the target image for different scene categories, thus completely replacing the traditional classification form. Because of the limitations of traditional identification technology, there are some problems in the actual use. It does not depend on the prior knowledge requirements and can carry out complex feature space division. In this paper, an image recognition computer system is established by introducing an improved neural network algorithm. The algorithm is designed and tested, and the results show it has lower image recognition error rate. Subsequently, this research result is applied to the actual scene for testing. The test results show that the improved neural network optimization algorithm can make the extracted features more accurately expressed in the image processing, which is more effective than the traditional algorithm. [ABSTRACT FROM AUTHOR]

Most genetic operators use random mating selection strategy and fixed rate crossover operator to solve various optimization problems. In order to improve the convergence and diversity of the algorithm, an adaptive adjacent maximum distance crossover operator is proposed in this paper. A new mating selection strategy (distance-based mating selection strategy) and an adaptive mechanism (adaptive crossover strategy based on population convergence) are adopted. Distance-based mating selection strategy purposefully selects parents to produce better offspring. Adaptive crossover strategy based on population convergence increases the convergence speed of the algorithm by controlling the crossover probability. The proposed crossover strategy is evaluated on the simulated binary crossover operators of non-dominated sorting genetic algorithm II and multi-objective evolutionary algorithm based on decomposition. The performance of the algorithm is verified on a series of standard test problems. Finally, the optimization results of the improved algorithm using adaptive adjacent maximum distance crossover operator and the standard algorithm are compared and analyzed. The experimental results show that the algorithm using adaptive adjacent maximum distance crossover operator has better optimization results. [ABSTRACT FROM AUTHOR]

In this paper, a novel optimization algorithm is proposed by hybridizing firefly and whale optimization algorithms and it is applied to the problem of determining optimal design parameters of model predictive control. The developed hybrid algorithm is compared with firefly and whale optimization algorithms considering unimodal, multimodal, composite and CEC-C06 2019 benchmark optimization problems in terms of statistical analysis. Comparison results showed that hybrid algorithm has the best performance for approximately 67% of 39 benchmark functions in finding the minimum in an average of independent 100 experiments for each function. For the functions in which the proposed algorithm gives the best results, approximately 64% improvement is achieved compared to FA and 39% improvement compared to WOA. In terms of convergence speed, in average 2% of improvement is obtained. As an application to engineering problems, optimization of parameters of the model predictive control for inverted pendulum and distillation column is considered and the performance of the proposed algorithm is compared with the performances of firefly algorithm and whale optimization algorithm. For the considered applications, a novel objective function is selected. The selected objective function for hybrid firefly–whale optimization algorithm enables finding the optimal prediction horizon and control horizon as well as the Q and R matrices such that the system responses satisfy desired settling time and maximum overshoot criteria. Most of considered comparisons demonstrate that the proposed hybrid algorithm has better performance. [ABSTRACT FROM AUTHOR]

Decision implication is an elementary representation of decision knowledge in formal concept analysis. Decision implication canonical basis (DICB), a set of decision implications with completeness and non-redundancy, is the most compact representation of decision implications. The method based on true premises (MBTP) for DICB generation is the most efficient one at present. In practical applications, however, data are always changing dynamically, and MBTP, lacking an update mechanism of DICB, still needs to re-generate inefficiently the whole DICB. This paper proposes an incremental algorithm for DICB generation, which obtains a new DICB just by modifying and updating the existing one. Experimental results verify that when samples in data are much more than condition attributes, which is actually a general case in practical applications, the incremental algorithm is significantly superior to MBTP. Furthermore, we conclude that even for the data in which samples are less than condition attributes, when new samples are continually added into data, the incremental algorithm must be also more efficient than MBTP, because the incremental algorithm just needs to modify the existing DICB, which is only a part of work of MBTP. [ABSTRACT FROM AUTHOR]

In this paper, we present a novel hybrid metaheuristic for the Knapsack Problem with Forfeits (KPF). KPF is a recently introduced generalization of the Knapsack Problem. In this variant, a penalty cost incurs whenever both items composing a so-called forfeit pair belong to the solution. Our proposed algorithm, called GA–CG Forfeits, combines the strengths of the Genetic and Carousel Greedy paradigms. In this work, we define the algorithm and compare it with two previously proposed heuristics on a set of benchmark instances. In these tests, GA–CG Forfeits provided significantly better solutions than the other two algorithms on all instances. [ABSTRACT FROM AUTHOR]

This paper puts forward an improved multi-objective bacterial colony chemotaxis (MOBCC) algorithm based on Pareto dominance. A time-varying step size tactic is adopted to increase the global and local searching abilities of the improved MOBCC algorithm. An external archive is created to keep previously found Pareto optimal solutions. A non-dominated sorting method integrating crowding distance assignment is applied to enhance the time efficiency of the improved MOBCC algorithm. A hybrid method combining bacterial individual mutation, oriented mutation of bacterial colony and local search of external archive is applied to enhance the convergence of the algorithm and maintain the diversity of solution set. The framework of MOEAs based on Pareto dominance is integrated into the improved MOBCC algorithm properly through replacements of the bacterial individuals in the bacterial colony, archive operation, and updating of the bacterial colony. The improved MOBCC algorithm is compared with three common multi-objective optimization algorithms SPEA2, NSGA-II and MOEA/D on fifteen test problems and evolution of optimization, and the experimental results confirm the validity of the improved MOBCC algorithm. Furthermore, the effects of the improved MOBCC algorithm's parameters on the performance of the improved MOBCC algorithm are analyzed. [ABSTRACT FROM AUTHOR]

Jaya algorithm is an advanced optimization algorithm, which has been applied to many real-world optimization problems. Jaya algorithm has better performance in some optimization field. However, Jaya algorithm exploration capability is not better. In order to enhance exploration capability of the Jaya algorithm, a self-adaptively commensal learning-based Jaya algorithm with multi-populations (Jaya-SCLMP) is presented in this paper. In Jaya-SCLMP, a commensal learning strategy is used to increase the probability of finding the global optimum, in which the person history best and worst information is used to explore new solution area. Moreover, a multi-populations strategy based on Gaussian distribution scheme and learning dictionary is utilized to enhance the exploration capability, meanwhile every subpopulation employed three Gaussian distributions at each generation, roulette wheel selection is employed to choose a scheme based on learning dictionary. The performance of Jaya-SCLMP is evaluated based on 28 CEC 2013 unconstrained benchmark problems. In addition, three reliability problems, i.e., complex (bridge) system, series system and series–parallel system, are selected. Compared with several Jaya variants and several state-of-the-art other algorithms, the experimental results reveal that Jaya-SCLMP is effective. [ABSTRACT FROM AUTHOR]

During recent decades, evolutionary algorithms have been widely studied in optimization problems. The multi-objective whale optimization algorithm based on multi-leader guiding is proposed in this paper, which attempts to offer a proper framework to apply whale optimization algorithm and other swarm intelligence algorithms to solving multi-objective optimization problems. The proposed algorithm adopts several improvements to enhance optimization performance. First, search agents are classified into leadership set and ordinary set by grid mechanism, and multiple leadership solutions guide the population to search the sparse spaces to achieve more homogeneous exploration in per iteration. Second, the differential evolution and whale optimization algorithm are employed to generate the offspring for the leadership and ordinary solutions, respectively. In addition, a novel opposition-based learning strategy is developed to improve the distribution of the initial population. The performance of the proposed algorithm is verified in contrast to 10 classic or state-of-the-arts algorithms on 20 bi-objective and tri-objective unconstrained problems, and experimental results demonstrate the competitive advantages in optimization quality and convergence speed. Moreover, it is tested on load distribution of hot rolling, and the result proves its good performance in real-world applications. Thus, all of the aforementioned experiments have indicated that the proposed algorithm is comparatively effective and efficient. [ABSTRACT FROM AUTHOR]

Parameter-free algorithms are of an increasing interest in applications that require out-of-the-box solving techniques. For instance, scheduling in volatile environments or control parameters optimisation often requires flexible solving approaches without the need to tune or retune the parameters. In addition, parameter-free algorithms are usually beneficial in solving previously unexplored real-world problem instances. In this paper, we propose a parameter-free local search strategy to solve graph colouring, which is the underlying problem for a number of scheduling applications. Two variants of parameter-free local search are computationally investigated: PFLS-A and PFLS-B. Both of these algorithms are based on accepting strictly improving moves and operating as a random walk if no strictly improving move is found. PFLS-A and PFLS-B differ in randomised versus systematic exploration of the neighbourhood of the current solution. Their cooperative variant CPFLS is also proposed. We compare the results of these three algorithms to the results obtained by 13 other local search methods from the literature. CPFLS provides better or equal results as the other local search algorithms in 67.25 % of per-instance comparisons. This is without employing any explicit or implicit parameters that are usually used in metaheuristics. This hints the promising nature of parameter-free metaheuristics not only for this problem but also metaheuristics in general. [ABSTRACT FROM AUTHOR]

One of the most common tasks of groundwater engineers is to estimate aquifer parameters from transient time-drawdown data which are measured during the execution of pumping tests. The classical method consists in the manual superimposition of the observed time-drawdown data over a type-curve, and the appreciation of the goodness-of-fit is left to the visual inspection of the engineer. The present paper proposes a computerized method based on a new hybrid algorithm named CSARao-1. It combines two recent metaheuristic algorithms: the crow search algorithm (CSA) and Rao-1 algorithm for the optimal aquifer parameters estimation, which inherits the advantages of both algorithms. The CSARao-1 hybrid algorithm along with CSA and Rao-1 algorithm was applied in conjunction with both the Theis solution to analyze time-drawdown datasets coming from confined aquifers systems and the Hantush and Jacob solution to analyze datasets coming from leaky aquifers systems. The proposed approach was coded in FORTRAN programming language and evaluated on fourteen time-drawdown datasets coming from different confined and leaky aquifers systems. The results obtained using CSARao-1 hybrid algorithm were compared to those obtained by applying CSA and Rao-1 algorithm separately, and to those recently published. Globally, the proposed CSARao-1 hybrid algorithm was found to exhibit more accuracy, better robustness and higher rate of convergence over the analyzed transient time-drawdown datasets. [ABSTRACT FROM AUTHOR]

To solve engineering problems with evolutionary algorithms, many expensive function evaluations (FEs) are required. To alleviate this difficulty, surrogate-assisted evolutionary algorithms (SAEAs) have attracted increasingly more attention in both academia and industry. Most existing SAEAs either waste computational resources due to the lack of accuracy of the surrogate model or easily fall into the local optimum as the dimension increases. To address these problems, this paper proposes an adaptive surrogate-assisted particle swarm optimization algorithm. In the proposed algorithm, a surrogate model is adaptively selected from a single model and an ensemble model by comparing the best existing solution and the latest obtained solution. Additionally, a model output criterion based on the standard deviation is suggested to improve the stability and generalization ability of the ensemble model. To verify the performance of the proposed algorithm, 10 benchmark functions with different modalities from 10 to 50 dimensions are tested, and the results are compared with those of five state-of-the-art SAEAs. The experimental results indicate that the proposed algorithm performs well for most benchmark functions within a limited number of FEs. Moreover, the performance of the proposed algorithm in solving engineering problems is verified by applying the algorithm to the PX oxidation process. [ABSTRACT FROM AUTHOR]

In this paper, a hybrid sunflower-teaching learning-based optimization (SFO-TLBO) algorithm has been proposed, integrating two well-known algorithms, namely sunflower optimization, and teaching–learning-based optimization. The proposed hybrid SFO-TLBO algorithm has been incorporated based on the ratio of the fitness value of the search agent and the average fitness value of the population. The SFO has more tendency of global exploration but has a problem of slow convergence speed. On the other hand, the convergence of the TLBO algorithm is fast, but it may get stuck in local optima. In this work, we have hybridized SFO with TLBO to take advantage of both the algorithms and also to balance the trade-off between exploitation and exploration. The proposed hybrid SFO-TLBO has been first applied to nineteen test benchmark functions. The outcomes have been compared with twelve state-of-the-art algorithms. In seventeen benchmark test functions, better performance has been achieved by the proposed hybrid SFO-TLBO. Also, the proposed hybrid SFO-TLBO algorithm has been used to solve an Internet of Vehicles (IoV) optimization problem and performance has been compared with fifteen state-of-the-art algorithms. In solving the IoV problem, hybrid SFO-TLBO has been achieved better performance in comparison with all fifteen considered algorithms which showcases the applicability of hybrid SFO-TLBO algorithm in resolving large-scale, real-world problems. In addition, for feature selection problems, a binary version of hybrid SFO-TLBO has been proposed, in which a wrapper approach is used to decide an optimal subset of features with a k-nearest neighbor classifier. The proposed binary method also determines an optimal value of k for the k-nearest neighbor classifier. The binary hybrid SFO-TLBO algorithm has been applied to the QSAR biodegradation dataset for classification, and for evidencing its efficiency, its performance has been compared with the other state-of-the-art algorithms. The results of the proposed approach are quite encouraging, and an average accuracy of 89.10% has been achieved. [ABSTRACT FROM AUTHOR]

Macular edema (ME) is an essential sort of macular issue caused due to the storing of fluid underneath the macula. Age-related Macular Degeneration (AMD) and diabetic macular edema (DME) are the two customary visual contaminations that can lead to fragmentary or complete vision loss. This paper proposes a deep learning-based predictive algorithm that can be used to detect the presence of a Subretinal hemorrhage. Region Convolutional Neural Network (R-CNN) and faster R-CNN are used to develop the predictive algorithm that can improve the classification accuracy. This method initially detects the presence of Subretinal hemorrhage, and it then segments the Region of Interest (ROI) by a semantic segmentation process. The segmented ROI is applied to a predictive algorithm which is derived from the Fast Region Convolutional Neural Network algorithm, that can categorize the Subretinal hemorrhage as responsive or non-responsive. The dataset, provided by a medical institution, comprised of optical coherence tomography (OCT) images of both pre- and post-treatment images, was used for training the proposed Faster Region Convolutional Neural Network (Faster R-CNN). We also used the Kaggle dataset for performance comparison with the traditional methods that are derived from the convolutional neural network (CNN) algorithm. The evaluation results using the Kaggle dataset and the hospital images provide an average sensitivity, selectivity, and accuracy of 85.3%, 89.64%, and 93.48% respectively. Further, the proposed method provides a time complexity in testing as 2.64s, which is less than the traditional schemes like CNN, R-CNN, and Fast R-CNN. [ABSTRACT FROM AUTHOR]

Recently, some statistical topic modeling approaches based on LDA have been applied in the field of supervised document classification, where the model generation procedure incorporates prior knowledge to improve the classification performance. However, these customizations of topic modeling are limited by the cumbersome derivation of a specific inference algorithm for each modification. In this paper, we propose a new supervised topic modeling approach for document classification problems, Neural Labeled LDA (NL-LDA), which builds on the VAE framework, and designs a special generative network to incorporate prior information. The proposed model can support semi-supervised learning based on the manifold assumption and low-density assumption. Meanwhile, NL-LDA has a consistent and concise inference method while semi-supervised learning and predicting. Quantitative experimental results demonstrate our model has outstanding performance on supervised document classification relative to the compared approaches, including traditional statistical and neural topic models. Specially, the proposed model can support both single-label and multi-label document classification. The proposed NL-LDA performs significantly well on semi-supervised classification, especially under a small amount of labeled data. Further comparisons with related works also indicate our model is competitive with state-of-the-art topic modeling approaches on semi-supervised classification. [ABSTRACT FROM AUTHOR]

In the manufacturing sector, the section that has attained the most demand is metal forming. Most traditional methods in the manufacturing industry are not flexible, thus opted for the single point incremental forming (SPIF) method. However, it encompasses a geometric deviation issue. The prediction of geometric deviation and optimal parameter selection is more tedious in the existing works. In order to trounce these issues, this paper proposes a modified adaptive neuro-fuzzy inferences system (MANFIS)-centred geometric deviation prediction and enhanced squirrel search algorithm (ESSA)-centred optimal parameter selection for SPIF in AA2024-O aluminium alloy sheets. The proposed methodology encompasses '3' sections. Initially, the SPIF designing is performed in which truncated cone shape is chosen and inputted into Computer-Aided Designs/Computer-Aided Manufacturing software. Next, the designed shape is constructed and coordinate-measuring machines gauges the geometric metrics. Therefore, to envisage the geometric deviations, the measured geometric values are rendered as the input to the MANFIS. If the deviation is presented, then the ESSA algorithm chooses the optimal initial parameters, and that selected parameters are suggested to the SPIF design. The minimum roundness deviation together with the position deviation is fixed as the Fitness Function in ESSA. The AA2024-O aluminium alloy sheet is taken for the experimental investigation. In addition, the proposed method's performance is contrasted with prevailing methods centred on statistical metrics and MSE, which exhibits that the proposed methods outweigh the prevailing methods. A better result is attained by the proposed works when analogized to the existent methods by obtaining values of 97.90%, 96.78%, 95.84%, 96.23%, and 0.017% for accuracy, precision, recall, F-measure along with mean error. [ABSTRACT FROM AUTHOR]

Grey Wolf Optimizer (GWO) is a nature-inspired swarm intelligence algorithm that mimics the hunting behavior of grey wolves. GWO, in its basic form, is a real coded algorithm that needs modifications to deal with binary optimization problems. In this paper, previous work on the binarization of GWO are reviewed, and are classified with respect to their encoding scheme, updating strategy, and transfer function. Then, we propose a novel binary GWO algorithm (named SetGWO), which is based on set encoding and uses set operations in its updating strategy. The proposed algorithm uses a completely different encoding scheme that eliminates the need for the transfer function and boundary checking, and also uses lower-dimensional agents; therefore, decreases the running time. Also, by using an exclusive exploration set for each agent, defining a different distance measure and an encircling strategy in discrete spaces, the quality of solutions has been improved. Experimental results on different real-world combinatorial optimization problems and datasets show that SetGWO outperforms other existing binary GWO algorithms in terms of quality of solutions, running time, and scalability. [ABSTRACT FROM AUTHOR]

Balancing the convergence and the diversity is one of the crucial researches in solving multi-objective problems (MOPs). However, the optimization algorithms are inefficient and require massive iterations. The convergence accuracy and the distribution of the obtained non-dominated solutions are defective in solving complex MOPs. To solve these problems, a novel adaptive multi-objective particle swarm optimization using a three-stage strategy (tssAMOPSO) is proposed in this paper. Firstly, an adaptive flight parameter adjustment is proposed to manage the states of the algorithm, switching between the global exploration and the local exploitation. Then, the three-stage strategy, including adaptive optimization, decomposition, and Gaussian attenuation mutation, is conducted by population in each iteration. The three-stage strategy remarkably promotes the diversity and efficiency of the optimization process. Furthermore, the convergence analysis of three-stage strategy is provided in detail. Finally, particles are equipped with memory interval to improve the reliability of personal best selection. In the maintenance of external archive, the proposed fusion index can enhance the quality of non-dominated solutions directly. A series of benchmark instances, ZDT and DTLZ test suits, are used to verify the performance of tssAMOPSO. Several classical and state-of-the-art algorithms are employed for experimental comparisons. Experimental results show that tssAMOPSO outperforms the other algorithms and achieves admirable comprehensive performance. [ABSTRACT FROM AUTHOR]

Class imbalance problems have attracted the research community, but a few works have focused on feature selection with imbalanced datasets. To handle class imbalance problems, we developed a novel fitness function for feature selection using the chaotic salp swarm optimization algorithm, an efficient meta-heuristic optimization algorithm that has been successfully used in a wide range of optimization problems. This paper proposes an AdaBoost algorithm with chaotic salp swarm optimization. The most discriminating features are selected using salp swarm optimization, and AdaBoost classifiers are thereafter trained on the features selected. Experiments show the ability of the proposed technique to find the optimal features with performance maximization of AdaBoost. [ABSTRACT FROM AUTHOR]

Reentry trajectory optimization is a critical optimal control problem for reusable launch vehicle (RLV) with highly nonlinear dynamic characteristics and complex constraints. In this paper, a hybrid parallel Harris hawks optimization (HPHHO) algorithm is proposed to address the problem. HPHHO aims to enhance the performance of existing Harris hawks optimization (HHO) algorithm by three strategies including oppositional learning, smoothing technique and parallel optimization mechanism. At the beginning of each iteration, the opposite population is calculated from the current population by the oppositional learning strategy. Following that, the individuals in the two populations are arranged in ascending order on the basis of the fitness function values, and the top half of the resulting population is selected as the initial population. The selected initial population is divided into two equal subpopulations which are assigned to the differential evolution and the HHO algorithm, respectively. The both algorithms operate in parallel to search and update the solutions of each subpopulation simultaneously. Then the solutions are smoothed for each iteration by the smoothing technique to reduce fluctuations. As a result, the optimal solution obtained by the parallel optimization mechanism avoids falling into local optima. The performance of HPHHO is evaluated by 4 CEC 2005 benchmark functions and 3 constrained continuous optimal control problems, showing better efficiency and robustness in terms of performance metrics, convergence rate and stability. Finally, the simulation results show that the proposed algorithm is very effective, practical and feasible in solving the RLV reentry trajectory optimization problem. [ABSTRACT FROM AUTHOR]

Virtual machine (VM) placement is a fundamental problem about resource scheduling in cloud computing; however, the design and implementation of an efficient VM placement algorithm are very challenging. To better multiplex and share physical hosts in the cloud data centers, this paper presents a VM placement algorithm based on the peak workload characteristics, which models the workload characteristics of VMs with mathematical method, and measures the similarity of VMs' workload with VM peak similarity. Avoiding virtual machines whose workload has high correlation are placed together, it places the virtual machines with peak workload staggering at different time together, which achieves better VM consolidation through VM peak similarity. This paper focuses on the mathematical analysis of VM peak similarity, and proves that compared to cosine-similarity method and correlation-coefficient method, peak-similarity method is better theoretically. Finally, numerical simulations and algorithm experiments show that our proposed peak-similarity-based placement algorithm outperforms the random placement algorithm and correlation-coefficient-based placement algorithm. [ABSTRACT FROM AUTHOR]

In recent times, wireless access technology is becoming increasingly commonplace due to the ease of operation and installation of untethered wireless media. The design of wireless networking is challenging due to the highly dynamic environmental condition that makes parameter optimization a complex task. Due to the dynamic, and often unknown, operating conditions, modern wireless networking standards increasingly rely on machine learning and artificial intelligence algorithms. Genetic algorithms (GAs) provide a well-established framework for implementing artificial intelligence tasks such as classification, learning, and optimization. GAs are well known for their remarkable generality and versatility and have been applied in a wide variety of settings in wireless networks. In this paper, we provide a comprehensive survey of the applications of GAs in wireless networks. We provide both an exposition of common GA models and configuration and provide a broad-ranging survey of GA techniques in wireless networks. We also point out open research issues and define potential future work. While various surveys on GAs exist in the literature, our paper is the first paper, to the best of our knowledge, which focuses on their application in wireless networks. [ABSTRACT FROM AUTHOR]

This paper presents a GPU-accelerated implementation of an image encryption algorithm. The algorithm uses the concepts of a modified XOR cipher to encrypt and decrypt the images, with an encryption pad, generated using the shared secret key and some initialization vectors. It uses a genetically optimized pseudo-random generator that outputs a stream of random bytes of the specified length. The proposed algorithm is subjected to a number of theoretical, experimental, and mathematical analyses, to examine its performance and security against a number of possible attacks, using the following metrics - histogram analysis, correlation analysis, information entropy analysis, NPCR and UACI. The performance analysis carried out shows an average speedup-ratio of 3.489 for encryption, and 4.055 for decryption operation, between the serial and parallel implementations using GPU. The algorithm aims to provide better performance benchmarks, which can significantly improve the experience in the relevant use-cases, like real-time media applications. [ABSTRACT FROM AUTHOR]

Biosignals are nowadays important subjects for scientific researches from both theory, and applications, especially, with the appearance of new pandemics threatening the humanity such as the new coronavirus. One aim in the present work is to prove that wavelets may be a successful machinery to understand such phenomena by applying a step forward extension of wavelets to multi-wavelets. We proposed in a first step to improve multi-wavelet notion by constructing more general families using independent components for multi-scaling and multi-wavelet mother functions. A special multi-wavelet is then introduced, continuous, and discrete multi-wavelet transforms are associated, as well as new filters, and algorithms of decomposition, and reconstruction. Applied breakthroughs of the paper may be summarized in three aims. In a first direction, an approximation (reconstruction) of a classical (stationary, periodic) example dealing with Fourier modes has been conducted in order to confirm the efficiency of the HSch multi-wavelets in approximating such signals and in providing fast algorithms. The second experimentation is concerned with the decomposition and reconstruction application of the HSch multi-wavelet on an ECG signal. The last experimentation is concerned with a de-noising application on a strain of coronavirus signal permitting to localize approximately the transmembrane segments of such a series as neighborhoods of the local maxima of an numerized version of the strain. Accuracy of the method has been evaluated by means of error estimates and statistical tests. [ABSTRACT FROM AUTHOR]

Recently, the slime mould algorithm (SMA) has become popular in function optimization, because it effectively uses exploration and exploitation to reach an optimal solution or near-optimal solution. However, the SMA uses two random search agents from the whole population to decide the future displacement and direction from the best search agents, which limits its exploitation and exploration. To solve this problem, we investigate an adaptive approach to decide whether opposition-based learning (OBL) will be used or not. Sometimes, the OBL is used to further increase the exploration. In addition, it maximizes the exploitation by replacing one random search agent with the best one in the position updating. The suggested technique is called an adaptive opposition slime mould algorithm (AOSMA). The qualitative and quantitative analysis of AOSMA is reported using 29 test functions that consisting of 23 classical test functions and 6 recently used composition functions from the IEEE CEC 2014 test suite. The results are compared with state-of-the-art optimization methods. Results presented in this paper show that AOSMA's performance is better than other optimization algorithms. The AOSMA is evaluated using Wilcoxon's rank-sum test. It also ranked one in Friedman's mean rank test. The proposed AOSMA algorithm would be useful for function optimization to solve real-world engineering problems. [ABSTRACT FROM AUTHOR]

In this paper, a resource flow-based branch-and-bound procedure is designed to solve the well-known resource-constrained project scheduling problem under the mixed uncertainty of fuzziness and randomness (FS-RCPSP). The objective is to minimize the expected makespan of the project subject to precedence and resource constraints. The proposed branch-and-bound can be employed to obtain optimal solutions and also can be truncated in order to find promising near optimal solutions. The depth-first strategy is utilized for constructing the search tree, and earliest start time (EST) concept is adopted for selecting a node for further branching while traversing the tree down to the leaves. The performance of developed branch-and-bound is benchmarked against CPLEX and SADESP across an extensive set of 960 problems. The results returned by the proposed algorithm show experimentally its effectiveness to solve the FS-RCPSP. [ABSTRACT FROM AUTHOR]

Fuzzy support vector machine and their variants are prominent classification techniques that reduce the adverse effects of noises and outliers as compare to classical support vector machine. However, in these methods, only the distance between the training pattern and the class center is considered, and hence, the edge support vectors cannot be distinguished from noises and outliers properly. These limitations are overcome by intuitionistic fuzzy-based support vector machine which allocate two parameters (membership and non-membership degrees) to each pattern of a dataset and hence define score number based on the importance of a pattern. In this paper, an intuitionistic fuzzy proximal support vector machine for multi-category classification problems is proposed. The method significantly reduces the impacts of noises and outliers present in the dataset by assigning the intuitionistic fuzzy score function to each training point based on its location and surroundings. Moreover, the method is computationally efficient as the robust classifiers are obtained by solving the system of linear equations instead of large size quadratic programming problems. In the proposed method, using polynomial and Gaussian kernels, the hyperplanes are also developed in the feature space. The geometrical advantages of the suggested method over the existing techniques are ascertained using the simulated two-dimensional artificial dataset having three target classes. Further, extensive experimental studies on ten UCI benchmark datasets have been performed which demonstrate that the proposed algorithm predicts more precisely about future data as comparison to some well-established algorithms. Figures are also illustrated by varying different parameters involved in the model which confirms the performance of the method over the existing algorithms. Moreover, the analysis of the predictive behavior of the proposed approach is done using the Friedman test, a nonparametric alternative to the analysis of variance test at 5 % significance level. Further, the proposed method has also been applied to image classification and gesture-phase segmentation problems which confirms the efficiency and handling capabilities of the proposed algorithm in practical applications. [ABSTRACT FROM AUTHOR]

For the different degrees of danger caused by different driving habits, a lane departure warning algorithm based on probability statistics of driving habits is proposed in this paper. According to the different driving habits of different drivers, the early warning mechanism can be adaptively adjusted through the method of probability statistics to make lane departure warning more targeted and accurate. Firstly, each frame of image is preprocessed, including gray treatment, edge detection and binarization. Then, Canny operator is used to detect the edge, and Hough transform is applied to detect the lines. And the lane median line equation for the detection and identification of lane also can be calculated. After that, the image coordinate system is transformed into the world coordinate system by means of the formula and matrix of coordinate conversion. According to the theory of Kalman filter, the statistics of lateral acceleration and lateral velocity are updated continuously, and the position of the vehicle in the next moment is predicted by the state transition equation and the forecast equation. From the results of experiments and the comparison with exhaustive algorithms, the advantages of using Kalman filter to predict the location of vehicles and the improved time-to-lane-crossing combined with probabilistic statistics to warning are illustrated clearly. [ABSTRACT FROM AUTHOR]

One of the most effective corrective control strategies to prevent voltage collapse and instability is load shedding. In this paper, a multiple-deme parallel genetic algorithm is used for a suitable design of load shedding. The load shedding algorithm is implemented when the voltage stability margin index of the power system is lower than a predefined value. In order to increase the computational speed, the voltage stability margin index is estimated by a modular neural network method in a fraction of a second. In addition, in order to use the exact values of the voltage stability margin index for neural network training, a simultaneous equilibrium tracing technique has been employed considering the detailed model of the components of the generating units such as the governor and the excitation system. In the proposed algorithm, the entire population is partitioned into several isolated subpopulations (demes) in which demes distributed in different processors and individuals may migrate occasionally from one subpopulation to another. The proposed technique has been tested on New England-39 bus test system, and the obtained results indicate the efficiency of the proposed method. [ABSTRACT FROM AUTHOR]

In this paper, we introduce an alternative construction of graphs on MV-algebras. We called them as MV-graphs whose vertices are the elements of MV-algebra and whose edges are the association of two vertices. We also define graphs of equivalence classes by constructing ▵ ¯ -connection operator and complement annihilator on MV-algebras. We prove some related results based on the algebraic properties of graphs. We handle formation of graph folding on MV-algebras. And, we prove the relation between graphs folding and equivalence classes graph of MV-algebras. Moreover, we associate all of these processes with algorithms to serve related areas that used effectively MV-algebras. [ABSTRACT FROM AUTHOR]

The knapsack problem arises in several real-world applications, like manufacturing systems, transportation, cutting and packing, and hydrological studies. In this paper, we investigate the use of an iterative rounding strategy-based algorithm for tackling a special knapsack problem: the set-union knapsack problem. First, the approach builds a series of starting partial solutions by using the principle of fractional values related to a series of linear relaxations of the (sub)instance at hand. Second, each step of the rounding procedure is coupled with an enhanced local search procedure, where its goal is to search around a local partial solution by applying the so-called critical element tailored for the problem studied. Third, both degrading and re-optimization strategies are introduced in order to extend the diversified search space. Finally, all strategies are embedded into an iterative search in order to augmenting the quality of the solutions. The performance of the proposed method is evaluated on benchmark instances of the literature and new large-scale instances; its provided results are compared to those reached by the Cplex solver and the best methods available in the literature. The method seems competitive, where it is able to achieve new (lower) bounds and matches the rest of the bounds. [ABSTRACT FROM AUTHOR]

In order to improve the performance of a clustering on a data set, a number of primary partitions are generated and stored in an ensemble and their aggregated consensus partition is used as their clustering. It is widely accepted that the consensus partition outperforms the primary partitions. In this paper, an ensemble clustering method called multi-level consensus clustering (MLCC) is proposed. To construct the MLCC, a cluster–cluster similarity matrix which is achieved by an innovative similarity metric is first generated. The mentioned cluster–cluster similarity matrix is based on a multi-level similarity metric. In fact, it can be computed in a new defined multi-level space. Then, a point–point similarity matrix which is boosted using the mentioned cluster–cluster similarity matrix is generated. The new consensus function applies an average linkage hierarchical clusterer algorithm on the mentioned point–point similarity matrix to make consensus partition. MLCC is better than traditional clustering ensembles and simple versions of clustering ensembles on traditional cluster–cluster similarity matrix. Its computational cost is not very bad too. Accuracy and robustness of the proposed method are compared with those of the modern clustering algorithms through the experimental tests. Also, time analysis is presented in the experimental results. [ABSTRACT FROM AUTHOR]

The widely employed mutation operator D E / c u r r e n t - t o - p b e s t / 1 in the differential evolution algorithm (DE) is further developed to a new version D E / c u r r e n t - t o - p b e s t / 1 - X in this paper. To test its performance, it has been embedded in the novel successful history-based adaptive DE (L-SHADE) and compared with other recently proposed mutation operators. In D E / c u r r e n t - t o - p b e s t / 1 - X , the updated parameter memories in each generation are not adopted when the initial value can still maintain an acceptable successful rate of finding better offspring. Also, the generated worse offsprings with acceptable fitness values are partially archived to generate differential vectors. The experimental results show that D E / c u r r e n t - t o - p b e s t / 1 - X has a comparable performance than D E / c u r r e n t - t o - p b e s t / 1 , D E / c u r r e n t - t o - o r d _ p b e s t / 1 and D E / c u r r e n t - t o - o r d _ b e s t / 1 . [ABSTRACT FROM AUTHOR]

As a relatively new model, the artificial bee colony algorithm (ABC) has shown impressive success in solving optimization problems. Nevertheless, its efficiency is still not satisfactory for some complex optimization problems. This paper has modified ABC and its other recent variants to improve its performance by modifying the scout phase. This modification enhances its exploitation ability by intensifying the regions in the search space, which probably includes reasonable solutions. The experiments were performed on CEC2014, and CEC2015 benchmark suites, real-life problems. And the proposed modification was applied to basic ABC, Gbest-Guided ABC, Depth First Search ABC, and Teaching–Learning Based ABC, and they were compared with their modified counterparts. The results have shown that our modification can successfully increase the performance of the original versions. Moreover, the proposed modified algorithm was compared with the state-of-the-art optimization algorithms, and it produced competitive results. [ABSTRACT FROM AUTHOR]

Hierarchical linear models are widely used in many research disciplines and estimation issues for such models are generally well addressed. Design issues are relatively much less discussed for hierarchical linear models but there is an increasing interest as these models grow in popularity. This paper discusses the G-optimality for predicting individual parameters in such models and establishes an equivalence theorem for confirming the G-optimality of an approximate design. Because the criterion is non-differentiable and requires solving multiple nested optimization problems, it is much harder to find and study G-optimal designs analytically. We propose a nature-inspired meta-heuristic algorithm called competitive swarm optimizer (CSO) to generate G-optimal designs for linear mixed models with different means and covariance structures. We further demonstrate that CSO is flexible and generally effective for finding the widely used locally D-optimal designs for nonlinear models with multiple interacting factors and some of the random effects are correlated. Our numerical results for a few examples suggest that G and D-optimal designs may be equivalent and we establish that D and G-optimal designs for hierarchical linear models are equivalent when the models have only a random intercept only. The challenging mathematical question of whether their equivalence applies more generally to other hierarchical models remains elusive. [ABSTRACT FROM AUTHOR]

An intrusion detection system is a security system that aims to detect sabotage and intrusions on networks to inform experts of the attack and abuse of the network. Different classification methods have been used in the intrusion detection systems such as fuzzy, genetic algorithms, decision trees, artificial neural networks, and support vector machines. Moreover, ensemble classifiers have shown more robust and effective performance for various tasks in the field. In this paper, we adopt ensemble models in order to improve the performance of intrusion detection and, at the same time, decrease the false alarm rate. We use kNN for multi-class classification, as well as SVM to approach the classification problem in normal-based detection. In order to combine multiple outputs, we use the Dempster–Shafer method in which there is the possibility of explicit retrieval of uncertainty. Moreover, we utilize deep learning for extracting features to train the samples, selected by the sample selection algorithm based on ensemble margin. We compare our results with state-of-the-art methods on benchmarking datasets such as UNSW-NB15, CICIDS2017, and NSL-KDD. Our proposed method indicates the superiority in terms of prominent metrics Accuracy, Precision, Recall, and F-measure. [ABSTRACT FROM AUTHOR]

In this paper, the load forecasting model is established to increase the precision of meteorological impacts, temperature, short-term power load forecasting, working and holiday factors by considering the power load. Further, IGA-LS-SVM is proposed which is a short-term power load forecasting technique based on AI algorithm. And to increase the forecast accuracy and generalization capability of LS-SVM, we applied the adopted mutation probability and new coding technology to the parameter optimization of LS-SVM. The temperature, load, weather state, working and holiday days be taken as prediction model as input, and load value was predicted output. We selected the sample data from meteorological information and historical load of a city in Yunnan province. By results, the prediction verifies the good prediction effect when associated with existing BP algorithm and the proposed IGA- LS-SVM algorithm yields a value 0.8274 more significant than all others, which is appropriate for short-term power load prediction. [ABSTRACT FROM AUTHOR]

The diagnosis of heart disease is found to be a serious concern, so the diagnosis has to be done remotely and regularly to take the prior action. In the present years, the diagnosis of heart disease has become a key research area for researchers and many models have been proposed in recent years. The diagnosis of heart disease can be done using optimization algorithms, and it provides results with good efficiency. The main objective of this paper is to propose a hybrid fuzzy-based decision tree algorithm for the process of prediction of heart disease at an early stage through the continuous and remote patient monitoring system. The results obtained from the proposed algorithm are compared with the various number of classifier algorithms like decision tree J48, naïve Bayes, GA with FCM, KNN with NB, ANN, SVM with fuzzy in which the proposed HFDT algorithm provides better accuracy of 98.30%. From the above-obtained results, the proposed hybrid fuzzy-based decision tree algorithm efficiently predicts heart disease compared to the other classifier algorithms in the literature. The proposed work is implemented in the MATLAB environment using the heart disease dataset. [ABSTRACT FROM AUTHOR]

In this paper, we present a different process for the optimal solution to mixed constraints transportation problem with imprecise coefficients without changing to its crisp equivalent form which is very distinct from other existing methods. Here, all the variables are considered to be triangular fuzzy numbers. Utilizing a parametric form of triangular fuzzy numbers such as left fuzziness index, right fuzziness index, modal value and by using proposed algorithm, we obtained the initial basic fuzzy feasible solution to the problem without changing to its crisp equivalent form. To obtain the solution, we use fuzzy ranking dependent on left and right spreads at some S-level of fuzzy numbers and fuzzy arithmetic dependent on both location index function and fuzziness index function. We further discuss the more for less solution by obtaining shadow prices to the problem. The more for less situation occurs when we raise the supplies, and demand quantities may cause to reduce the optimal transportation cost. The more for less paradox is very useful to a manager in dynamic, for example expanding an item house loading level or plant age breaking point and publicizing attempts to build request at explicit markets. A numerical example is solved to show the adequacy of the proposed algorithm. [ABSTRACT FROM AUTHOR]

One challenging problem in numerical linear algebra is computing eigenvalues from the interior of the spectrum of large matrices. The harmonic Arnoldi method is one of the methods that can be used to find interior eigenpairs of a large non-symmetric matrix. However, it has been shown that this method may converge erratically and even may fail. In this paper, we present a novel and efficient method for computing interior eigenpairs of large non-symmetric matrices. The proposed eigensolver is a hybrid of the harmonic Arnoldi algorithm and the Jaya optimization algorithm, which is called Jaya-HA. Numerical experiments have tested the accuracy and performance of the Jaya-HA, and computational results show that this algorithm converges faster and provides superior performance. [ABSTRACT FROM AUTHOR]

Depression has become a common issue among IT industry professionals today. Lifestyle changes and new work culture increase the risk of depression among employees. Various companies and organizations offer mental health plans and try to pacify the work environment. However, the problem is already out of control. This research paper proposes an effective deep learning model for stress prediction among working employees with the help of lion optimization-based optimal artificial neural network (OANN) model. Here, the features are selected using optimal ANN technique and the diseases are predicted using lion optimization method. ANN technique eliminates inappropriate and unnecessary attributes in a significant manner, once the information on calculated characteristics and weight is disseminated to lion optimization classifier. The test results inferred that the artificial neural network is highly efficient than the current OANN algorithm method, based on lion optimization. The study evaluated the data and found that the performance of employees working under normal conditions was higher when compared to the performance of employees who work under stress. Furthermore, attitude-coping efforts may be a cognitive behavioral mechanism, which explains how workload is related to courage and work performance of employees with high stress level. [ABSTRACT FROM AUTHOR]

Dempster–Shafer evidence theory plays an important role in multi-sensor information fusion and is widely used in the real world. However, fusing the highly conflicting evidences may emerge counter-intuitive results. Recently, researchers found that weighting evidences based on its corresponding credibility and information volume are effective in dealing with the above problem. So it is still an open issue about how to obtain reasonable weights. In this paper, a new divergence measure method is proposed to measure divergence degree of basic probability assignment based on harmonic mean of Deng relative entropy. In determining information volume, Zhou et al.'s entropy is also introduced with considering the cardinality of the discernment frame. Then the weight for each evidence will be generated by the proposed divergence measure method and the modified information volume. Some numerical examples are illustrated to show the outstanding performance of the proposed divergence measure method, and the optimal weighted evidence combination algorithm also gives the relatively highest belief in multi-sensor target recognition. [ABSTRACT FROM AUTHOR]

This paper describes a proposed competitive multi-metaheuristic optimization model for the optimal design of membership function parameters of a fuzzy system that controls the navigation of an autonomous mobile robot following a desired trajectory. The main contribution is the new competitive multi-metaheuristic optimization model, which is formed by an architecture consisting of the firefly algorithm, wind-driven optimization, drone squadron optimization, and stochastic fractal search. The proposed method has enable obtaining good results in the optimization of fuzzy controllers, which outperform other metaheuristics in the literature. In the competition, each of the methods is tested until finding the best one in generating an effective parameter vector for the optimization of fuzzy controller membership functions. The main contribution of this article is the use of four metaheuristics working in a competitive way, to find the best vector of data generated with the optimal values to successfully adjust the membership functions of the fuzzy controller. The resulting winning method proves in this way that it is the best among the chosen algorithms to solve this kind of control optimization problem. [ABSTRACT FROM AUTHOR]

This paper develops a new algorithm by applying the Bayesian method to software using artificial immune systems. An artificial immune system is an adaptive computing system that uses models, principles, mechanisms, and functions used to solve problems in theoretical immunology. Its application to various fields of science is studied. The role that artificial immune systems play in software is invaluable. Methods for detecting malware are explored. Some works in the field of artificial immune system are analyzed and issues to be addressed are identified. The Bayesian method accurately calculates the probability of occurrence of any event under certain conditions. Therefore, the Bayesian method is applied to software using artificial immune systems. By applying this method, fast software performance can be achieved. For this, a new algorithm is developed and experiments are conducted. The developed algorithm is one of the new ones. The results of the experiments provide good performance. [ABSTRACT FROM AUTHOR]

With the development of the economy, developing high-technology industries and upgrading traditional industries have become a global focus. The relationship between the development of high-technology and traditional industries has also affected urban expansion. In this paper, a fractional derivative gray Lotka−Volterra model with time delay (FDGLV) is established by introducing fractional derivative and delay factor into the GLV model. The model is solved by using the fractional Adams−Bashforth−Moulton predictor−corrector algorithm. The gray correlation analysis is used to determine the time delay value of the model, and the parameters are optimized by using the whale algorithm. Then, the data of high-technology industry, traditional industry, and urban expansion in Chengdu, Changsha, and Chongqing are collected to verify the effectiveness of the model. Finally, the model is used to analyze the coopetition between industrial upgrading and urban expansion in Wuhan, and predict the development status in the next 5 years. [ABSTRACT FROM AUTHOR]

Grey wolf optimizer (GWO) is an efficient meta-heuristic algorithm that is inspired by the particular hunting behavior and leadership hierarchy of grey wolves in nature. In this paper, an efficient opposition-based grey wolf optimizer algorithm is proposed for solving the fuzzy clustering problem over artificial and real-life data. This work also tries to use the benefit of fuzzy properties which presents capability to handle overlapping clusters. However, centroid information and geometric structure information of clusters are the two important issues in fuzzy data clustering to improve the clustering performance. According to, in this paper, we derive two-objective functions, such as compactness and overlap-partition (OP) measures to handle above drawbacks. The centroid information issue is solved by compactness measure, and the OP measure is used to handle the geometric structure of clustering problem. Additionally, in the proposed clustering approach, the concept of opposition-based generation jumping and opposition-based population initialization is used with the standard GWO to enhance its computational speed and convergence profile. The efficiency of the proposed algorithm is shown for five artificial datasets and five real-life datasets of varying complexities. Experimental results show that the proposed method outperforms some existing methods with good clustering qualities. [ABSTRACT FROM AUTHOR]

This paper investigates the vertex coloring problem in an uncertain graph in which all vertices are deterministic, while all edges are not deterministic and exist with some degree of belief in uncertain measures. The concept of the maximal uncertain independent vertex set of an uncertain graph is first introduced. We then present a degree of belief rule to obtain the family of maximal uncertain independent vertex sets. Based on the maximal uncertain independent vertex set, some properties of the separation degree of an uncertain graph are discussed. Following that, the concept of an uncertain chromatic set is introduced. Then, a maximum separation degree algorithm is derived to obtain the uncertain chromatic set. Finally, numerical examples are presented to demonstrate the application of the vertex coloring problem in uncertain graphs and the effectiveness of the maximum separation degree algorithm. [ABSTRACT FROM AUTHOR]

Inventory routing problem (IRP) is one of the most important logistics problems; in this type of problems, decision maker usually has the option to use several types of vehicles to form a fleet with appropriate size and composition in order to minimize both inventory and transportation costs. Meanwhile, the increasing fuel consumption and its economic and environmental impacts mean that this issue must also be incorporated into the routing problems. This paper proposes a new bi-objective model for green inventory routing problem with the heterogeneous fleet. The objectives of the proposed model are (I) to reduce the emissions and (II) to minimize the fleet size, vehicle type, routing, and inventory costs. Given the NP-hard nature of the assessed problem, a bi-objective meta-heuristic algorithm based on the quantum evolutionary algorithm is proposed to achieve these objectives. To evaluate the performance of the proposed algorithm, its results are compared with the results of the exact method and Non-dominated Sorting Genetic Algorithm II (NSGAII). The results of these comparisons indicate the better performance of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Identifying the influential spreaders is an important issue in understanding and controlling the spreading processes in social networks. The key to the influential spreader identification problem is how to evaluate the spreading ability of the nodes. Centralities such as degree, semi-local centrality, betweenness, closeness, k-shell are usually used as evaluation metric. However, we observe that these centralities are sensitive not only to the spreading probability, but also to the network structure. We are not sure which centrality is efficient when we face a new network. In this paper, we propose a robust method named Adjustable multi-Hops Spreading (AHS). In AHS, we refine the influence of a node into direct influence and indirect influence, and then integrate them with a adjustable parameter. The experimental results in both real social networks and artificial networks show that AHS outperforms other centralities in effectiveness, robustness and the distinguish ability. [ABSTRACT FROM AUTHOR]