An adaptive regeneration framework based on search space adjustment for differential evolution

Ankylosing spondylitis prediction using fuzzy K-nearest neighbor classifier assisted by modified JAYA optimizer

The diagnosis of ankylosing spondylitis (AS) can be complex, necessitating a comprehensive assessment of medical history, clinical symptoms, and radiological evidence. This multidimensional approach can exacerbate the clinical burden and increase the likelihood of diagnostic inaccuracies, which may result in delayed or overlooked cases. Consequently, supplementary diagnostic techniques for AS have become a focal point in clinical research. This study introduces an enhanced optimization algorithm, SCJAYA, which incorporates salp swarm foraging behavior with cooperative predation strategies into the JAYA algorithm framework, noted for its robust optimization capabilities that emulate the evolutionary dynamics of biological organisms. The integration of salp swarm behavior is aimed at accelerating the convergence speed and enhancing the quality of solutions of the classical JAYA algorithm while the cooperative predation strategy is incorporated to mitigate the risk of convergence on local optima. SCJAYA has been evaluated across 30 benchmark functions from the CEC2014 suite against 9 conventional meta-heuristic algorithms as well as 9 state-of-the-art meta-heuristic counterparts. The comparative analyses indicate that SCJAYA surpasses these algorithms in terms of convergence speed and solution precision. Furthermore, we proposed the bSCJAYA-FKNN classifier: an advanced model applying the binary version of SCJAYA for feature selection, with the aim of improving the accuracy in diagnosing and prognosticating AS. The efficacy of the bSCJAYA-FKNN model was substantiated through validation on 11 UCI public datasets in addition to an AS-specific dataset. The model exhibited superior performance metrics-achieving an accuracy rate, specificity, Matthews correlation coefficient (MCC), F-measure, and computational time of 99.23 %, 99.52 %, 0.9906, 99.41 %, and 7.2800 s, respectively. These results not only underscore its profound capability in classification but also its substantial promise for the efficient diagnosis and prognosis of AS.

Enhancing deep vein thrombosis prediction in patients with coronavirus disease 2019 using improved machine learning model

BACKGROUND

Deep vein thrombosis (DVT) is a significant complication in coronavirus disease 2019 patients, arising from coagulation issues in the deep venous system. Among 424 scheduled patients, 202 developed DVT (47.64%). DVT increases hospitalization risk, and complications, and impacts prognosis. Accurate prognostication and timely intervention are crucial to prevent DVT progression and improve patient outcomes.

METHODS

This study introduces an effective DVT prediction model, named bSES-AC-RUN-FKNN, which integrates fuzzy k-nearest neighbor (FKNN) with enhanced Runge-Kutta optimizer (RUN). Recognizing the insufficient effectiveness of RUN in local search capability and its convergence accuracy, spherical evolutionary search (SES) and differential evolution-inspired knowledge adaptive crossover (AC) are incorporated, termed SES-AC-RUN, to enhance its optimization capability.

RESULTS

Based on the benchmark set by CEC 2017 and comparative analyses with several peers, it is evident that SES-AC-RUN significantly enhances search performance compared to traditional RUN, even standing comparably against leading championship algorithms. The proposed bSES-AC-RUN-FKNN model was applied to predict a dataset comprising 424 cases of DVT patients, totaling 7208 records. Remarkably, the model demonstrates outstanding accuracy, reaching 91.02%, alongside commendable sensitivity at 91.07%.

CONCLUSIONS

The bSES-AC-RUN-FKNN emerges as a robust and efficient predictive tool, significantly enhancing the accuracy of DVT prediction. This model can be used to manage the risk of thrombosis in the care of COVID-19 patients. Nursing staff can combine the model's predictions with clinical judgment to formulate comprehensive treatment approaches.

Hierarchical Harris hawks optimizer for feature selection

INTRODUCTION

The main feature selection methods include filter, wrapper-based, and embedded methods. Because of its characteristics, the wrapper method must include a swarm intelligence algorithm, and its performance in feature selection is closely related to the algorithm's quality. Therefore, it is essential to choose and design a suitable algorithm to improve the performance of the feature selection method based on the wrapper. Harris hawks optimization (HHO) is a superb optimization approach that has just been introduced. It has a high convergence rate and a powerful global search capability but it has an unsatisfactory optimization effect on high dimensional problems or complex problems. Therefore, we introduced a hierarchy to improve HHO's ability to deal with complex problems and feature selection.

OBJECTIVES

To make the algorithm obtain good accuracy with fewer features and run faster in feature selection, we improved HHO and named it EHHO. On 30 UCI datasets, the improved HHO (EHHO) can achieve very high classification accuracy with less running time and fewer features.

METHODS

We first conducted extensive experiments on 23 classical benchmark functions and compared EHHO with many state-of-the-art metaheuristic algorithms. Then we transform EHHO into binary EHHO (bEHHO) through the conversion function and verify the algorithm's ability in feature extraction on 30 UCI data sets.

RESULTS

Experiments on 23 benchmark functions show that EHHO has better convergence speed and minimum convergence than other peers. At the same time, compared with HHO, EHHO can significantly improve the weakness of HHO in dealing with complex functions. Moreover, on 30 datasets in the UCI repository, the performance of bEHHO is better than other comparative optimization algorithms.

CONCLUSION

Compared with the original bHHO, bEHHO can achieve excellent classification accuracy with fewer features and is also better than bHHO in running time.

Advanced slime mould algorithm incorporating differential evolution and Powell mechanism for engineering design

The slime mould algorithm (SMA) is a population-based swarm intelligence optimization algorithm that simulates the oscillatory foraging behavior of slime moulds. To overcome its drawbacks of slow convergence speed and premature convergence, this paper proposes an improved algorithm named PSMADE, which integrates the differential evolution algorithm (DE) and the Powell mechanism. PSMADE utilizes crossover and mutation operations of DE to enhance individual diversity and improve global search capability. Additionally, it incorporates the Powell mechanism with a taboo table to strengthen local search and facilitate convergence toward better solutions. The performance of PSMADE is evaluated by comparing it with 14 metaheuristic algorithms (MA) and 15 improved MAs on the CEC 2014 benchmarks, as well as solving four constrained real-world engineering problems. Experimental results demonstrate that PSMADE effectively compensates for the limitations of SMA and exhibits outstanding performance in solving various complex problems, showing potential as an effective problem-solving tool.

Face Image Segmentation Using Boosted Grey Wolf Optimizer

Image segmentation methods have received widespread attention in face image recognition, which can divide each pixel in the image into different regions and effectively distinguish the face region from the background for further recognition. Threshold segmentation, a common image segmentation method, suffers from the problem that the computational complexity shows exponential growth with the increase in the segmentation threshold level. Therefore, in order to improve the segmentation quality and obtain the segmentation thresholds more efficiently, a multi-threshold image segmentation framework based on a meta-heuristic optimization technique combined with Kapur's entropy is proposed in this study. A meta-heuristic optimization method based on an improved grey wolf optimizer variant is proposed to optimize the 2D Kapur's entropy of the greyscale and nonlocal mean 2D histograms generated by image computation. In order to verify the advancement of the method, experiments compared with the state-of-the-art method on IEEE CEC2020 and face image segmentation public dataset were conducted in this paper. The proposed method has achieved better results than other methods in various tests at 18 thresholds with an average feature similarity of 0.8792, an average structural similarity of 0.8532, and an average peak signal-to-noise ratio of 24.9 dB. It can be used as an effective tool for face segmentation.

An enhanced decision-making framework for predicting future trends of sharing economy

This work aims to provide a reliable and intelligent prediction model for future trends in sharing economy. Moreover, it presents valuable insights for decision-making and policy development by relevant governmental bodies. Furthermore, the study introduces a predictive system that incorporates an enhanced Harris Hawk Optimization (HHO) algorithm and a K-Nearest Neighbor (KNN) forecasting framework. The method utilizes an improved simulated annealing mechanism and a Gaussian bare bone structure to improve the original HHO, termed SGHHO. To achieve optimal prediction performance and identify essential features, a refined simulated annealing mechanism is employed to mitigate the susceptibility of the original HHO algorithm to local optima. The algorithm employs a mechanism that boosts its global search ability by generating fresh solution sets at a specific likelihood. This mechanism dynamically adjusts the equilibrium between the exploration and exploitation phases, incorporating the Gaussian bare bone strategy. The best classification model (SGHHO-KNN) is developed to mine the key features with the improvement of both strategies. To assess the exceptional efficacy of the SGHHO algorithm, this investigation conducted a series of comparative trials employing the function set of IEEE CEC 2014. The outcomes of these experiments unequivocally demonstrate that the SGHHO algorithm outperforms the original HHO algorithm on 96.7% of the functions, substantiating its remarkable superiority. The algorithm can achieve the optimal value of the function on 67% of the tested functions and significantly outperforms other competing algorithms. In addition, the key features selected by the SGHHO-KNN model in the prediction experiment, including " Form of sharing economy in your region " and " Attitudes to the sharing economy ", are important for predicting the future trends of the sharing economy in this study. The results of the prediction demonstrate that the proposed model achieves an accuracy rate of 99.70% and a specificity rate of 99.38%. Consequently, the SGHHO-KNN model holds great potential as a reliable tool for forecasting the forthcoming trajectory of the sharing economy.

Anti-sine-cosine atom search optimization (ASCASO): a novel approach for parameter estimation of PV models

Nowadays, solar power generation has gradually become a part of electric energy sharing. How to effectively enhance the energy conversion efficiency of solar cells and components has gradually emerged as a focal point of research. This paper presents a boosted atomic search optimization (ASO) with a new anti-sine-cosine mechanism (ASCASO) to realize the parameter estimation of photovoltaic (PV) models. The anti-sine-cosine mechanism is inspired by the update principle of sine cosine algorithm (SCA) and the mutation strategy of linear population size reduction adaptive differential evolution (LSHADE). The working principle of anti-sine-cosine mechanism is to utilize two mutation formulas containing arcsine and arccosine functions to further update the position of atoms. The introduction of anti-sine-cosine mechanism achieves the populations' random handover and promotes the neighbors' information communication. For better evaluation, the proposed ASCASO is devoted to estimate parameters of three PV models of R.T.C France, one Photowat-PWP201 PV module model, and two commercial polycrystalline PV panels including STM6-40/36 and STM6-120/36 with monocrystalline cells. The proposed ASCASO is compared with nine reported comparative algorithms to assess the performance. The results of parameter estimation for different PV models of various methods demonstrate that ASCASO performs more accurately and reliably than other reported comparative methods. Thus, ASCASO can be considered a highly effective approach for accurately estimating the parameters of PV models.

Dispersed differential hunger games search for high dimensional gene data feature selection

The realms of modern medicine and biology have provided substantial data sets of genetic roots that exhibit a high dimensionality. Clinical practice and associated processes are primarily dependent on data-driven decision-making. However, the high dimensionality of the data in these domains increases the complexity and size of processing. It can be challenging to determine representative genes while reducing the data's dimensionality. A successful gene selection will serve to mitigate the computing costs and refine the accuracy of the classification by eliminating superfluous or duplicative features. To address this concern, this research suggests a wrapper gene selection approach based on the HGS, combined with a dispersed foraging strategy and a differential evolution strategy, to form a new algorithm named DDHGS. Introducing the DDHGS algorithm to the global optimization field and its binary derivative bDDHGS to the feature selection problem is anticipated to refine the existing search balance between explorative and exploitative cores. We assess and confirm the efficacy of our proposed method, DDHGS, by comparing it with DE and HGS combined with a single strategy, seven classic algorithms, and ten advanced algorithms on the IEEE CEC 2017 test suite. Furthermore, to further evaluate DDHGS' performance, we compare it with several CEC winners and DE-based techniques of great efficiency on 23 popular optimization functions and the IEEE CEC 2014 benchmark test suite. The experimentation asserted that the bDDHGS approach was able to surpass bHGS and a variety of existing methods when applied to fourteen feature selection datasets from the UCI repository. The metrics measured--classification accuracy, the number of selected features, fitness scores, and execution time--all showed marked improvements with the use of bDDHGS. Considering all results, it can be concluded that bDDHGS is an optimal optimizer and an effective feature selection tool in the wrapper mode.

An enhanced grey wolf optimizer boosted machine learning prediction model for patient-flow prediction

Large and medium-sized general hospitals have adopted artificial intelligence big data systems to optimize the management of medical resources to improve the quality of hospital outpatient services and decrease patient wait times in recent years as a result of the development of medical information technology and the rise of big medical data. However, owing to the impact of several elements, including the physical environment, patient, and physician behaviours, the real optimum treatment effect does not meet expectations. In order to promote orderly patient access, this work provides a patient-flow prediction model that takes into account shifting dynamics and objective rules of patient-flow to handle this issue and forecast patients' medical requirements. First, we propose a high-performance optimization method (SRXGWO) and integrate the Sobol sequence, Cauchy random replacement strategy, and directional mutation mechanism into the grey wolf optimization (GWO) algorithm. The patient-flow prediction model (SRXGWO-SVR) is then proposed using SRXGWO to optimize the parameters of support vector regression (SVR). Twelve high-performance algorithms are examined in the benchmark function experiments' ablation and peer algorithm comparison tests, which are intended to validate SRXGWO's optimization performance. In order to forecast independently in the patient-flow prediction trials, the data set is split into training and test sets. The findings demonstrated that SRXGWO-SVR outperformed the other seven peer models in terms of prediction accuracy and error. As a result, SRXGWO-SVR is anticipated to be a reliable and efficient patient-flow forecast system that may help hospitals manage medical resources as effectively as possible.

Prediction of fractional flow reserve with enhanced ant lion optimized support vector machine

The evaluation of coronary morphology provides important guidance for the treatment of coronary heart disease (CHD). A chaotic Gaussian mutation antlion optimizer algorithm (CGALO) is proposed in the paper, and it is combined with SVM to construct a classification prediction model for Fractional flow reserve (FFR). To overcome the limitations of the original antlion optimizer (ALO) algorithm, the chaotic Gaussian mutation strategy is introduced, which leads to an improvement in its convergence speed and accuracy. To evaluate the proposed algorithm's performance, comparative experiments were conducted on 23 benchmark functions alongside 12 other cutting-edge optimization algorithms. The experimental outcomes demonstrate that the proposed algorithm achieves superior convergence accuracy and speed compared to the alternative comparison algorithms. Additionally, it is combined with SVM and FS to construct a hierarchical FFR classification model, which is utilized to make effective predictions for 84 patients at the affiliated hospital of medical school, Ningbo university. The experimental results demonstrate that the proposed model achieves an average accuracy of 92%. Moreover, it concludes that smoking history, number of lesion vessels, lesion location, diffuse lesions and ST segment changes, and other factors are the most critical indicators for FFR. Therefore, the model that has been established is a new FFR intelligent classification prediction technology that can effectively assist doctors in making corresponding decisions and evaluation plans.

Gaussian bare-bone slime mould algorithm: performance optimization and case studies on truss structures

The slime mould algorithm (SMA) is a new meta-heuristic algorithm recently proposed. The algorithm is inspired by the foraging behavior of polycephalus slime moulds. It simulates the behavior and morphological changes of slime moulds during foraging through adaptive weights. Although the original SMA's performance is better than most swarm intelligence algorithms, it still has shortcomings, such as quickly falling into local optimal values and insufficient exploitation. This paper proposes a Gaussian barebone mutation enhanced SMA (GBSMA) to alleviate the original SMA's shortcomings. First of all, the Gaussian function in the Gaussian barebone accelerates the convergence while also expanding the search space, which improves the algorithm exploration and exploitation capabilities. Secondly, the differential evolution (DE) update strategy in the Gaussian barebone, using rand as the guiding vector. It also enhances the algorithm's global search performance to a certain extent. Also, the greedy selection is introduced on this basis, which prevents individuals from performing invalid position updates. In the IEEE CEC2017 test function, the proposed GBSMA is compared with a variety of meta-heuristic algorithms to verify the performance of GBSMA. Besides, GBSMA is applied to solve truss structure optimization problems. Experimental results show that the convergence speed and solution accuracy of the proposed GBSMA are significantly better than the original SMA and other similar products.

Supplementary Information

The online version contains supplementary material available at 10.1007/s10462-022-10370-7.

An Analysis of the Operation Factors of Three PSO-GA-ED Meta-Heuristic Search Methods for Solving a Single-Objective Optimization Problem

In this study, we evaluate several nongradient (evolutionary) search strategies for minimizing mathematical function expressions. We developed and tested the genetic algorithms, particle swarm optimization, and differential evolution in order to assess their general efficacy in optimization of mathematical equations. A comparison is then made between the results and the efficiency, which is determined by the number of iterations, the observed accuracy, and the overall run time. Additionally, the optimization employs 12 functions from Easom, Holder table, Michalewicz, Ackley, Rastrigin, Rosen, Rosen Brock, Shubert, Sphere, Schaffer, Himmelblau's, and Spring Force Vanderplaats. Furthermore, the crossover rate, mutation rate, and scaling factor are evaluated to determine the effectiveness of the following algorithms. According to the results of the comparison of optimization algorithms, the DE algorithm has the lowest time complexity of the others. Furthermore, GA demonstrated the greatest degree of temporal complexity. As a result, using the PSO method produces different results when repeating the same algorithm with low reliability in terms of locating the optimal location.

IoT-enabled product development method to support rapid manufacturing using a nature-inspired algorithm

Investigations illustrate that the Internet of Things (IoT) can save costs, increase efficiency, improve quality, and provide data-driven preventative maintenance services. Intelligent sensors, dependable connectivity, and complete integration are essential for gathering real-time information. IoT develops home appliances for improved customer satisfaction, personalization, and enhanced big data analytics as a crucial Industry 4.0 enabler. Because the product design process is an important part of controlling manufacturing, there are constant attempts to improve and minimize product design time. Utilizing a hybrid algorithm, this research provides a novel method to schedule design products in production management systems to optimize energy usage and design time (combined particle optimization algorithm and shuffled frog leaping algorithm). The issue with particle optimization algorithms is that they might become stuck in local optimization and take a long time to converge to global optimization. The strength of the combined frog leaping algorithm local searching has been exploited to solve these difficulties. The MATLAB programming tool is used to simulate the suggested technique. The simulation findings were examined from three perspectives: energy usage, manufacturing time, and product design time. According to the findings, the recommended strategy performed better in minimizing energy use and product design time. These findings also suggest that the proposed strategy has a higher degree of convergence when discovering optimal solutions.

Rural Workplace Sustainable Development of Smart Rural Governance Workplace Platform for Efficient Enterprise Performances

In the long developmental process, China's agriculture has transformed from organic agriculture to inorganic agriculture. New technologies have made the modernization of agriculture possible. However, most older people who are engaged in agriculture may not completely understand the modernization of agriculture. Based on the limitations of traditional image target detection methods, a deep learning-based pest target detection and recognition method is proposed from a blockchain perspective, to analyze and research agricultural data supervision and governance and explore the effectiveness of deep learning methods in crop pest detection and recognition. The comparative analysis demonstrates that the average precision (AP) of GA-CPN-LAR (global activation-characteristic pyramid network-local activation region) increases by 4.2% compared with other methods. Whether under the Inception or ResNet-50 backbone networks, the AP of GA-CPN-LAR is significantly better than other methods. Compared with the ResNet-50 backbone network, GA-CPN-LAR has higher accuracy and recall rates under Inception. Precision-recall curve measurement shows that the proposed method can significantly reduce the false detection rate and missed detection rate. The GA-CPN-LAR model proposed here has a higher AP value on the MPD dataset than the other target detection methods, which can be increased by 4.2%. Besides, the accuracy and recall of the GA-CPN-LAR method corresponding to two representative pests under the initial feature extractor are higher than the MPD dataset baseline. In addition, the research results of the MPD dataset and AgriPest dataset also show that the pest target detection method based on convolutional neural networks (CNNs) has a good presentation effect and can significantly reduce false detection and missed detection. Moreover, the pest regulation based on blockchain and deep learning comprehensively considers global and local feature extraction and pattern recognition, which positively impacts the conscientization of agricultural data processing and promotes the sustainable development of rural areas.

An External Selection Mechanism for Differential Evolution Algorithm

The procedures of differential evolution algorithm can be summarized as population initialization, mutation, crossover, and selection. However, successful solutions generated by each iteration have not been fully utilized to our best knowledge. In this study, an external selection mechanism (ESM) is presented to improve differential evolution (DE) algorithm performance. The proposed method stores successful solutions of each iteration into an archive. When the individual is in a state of stagnation, the parents for mutation operation are selected from the archive to restore the algorithm's search. Most significant of all, a crowding entropy diversity measurement in fitness landscape is proposed, cooperated with fitness rank, to preserve the diversity and superiority of the archive. The ESM can be integrated into existing algorithms to improve the algorithm's ability to escape the situation of stagnation. CEC2017 benchmark functions are used for verification of the proposed mechanism's performance. Experimental results show that the ESM is universal, which can improve the accuracy of DE and its variant algorithms simultaneously.

Hybrid Differential Evolution-Based Regression Tree Model for Predicting Downstream Dam Hazard Potential

There are a large number of dams throughout the United States, and a considerable portion of them are categorized as having high hazard potential. This state of affairs constitutes a challenge, especially when coupled with their rapid deterioration. As such, this research paper proposes an optimized data-driven model for the fast and efficient prediction of dam hazard potential. The proposed model is envisioned on two main components, namely model development and model assessment. In the first component, a hybridization of the differential evolution algorithm and regression tree to forecast downstream dam hazard potential is proposed. In this context, the differential evolution (DE) algorithm is deployed to: (1) automatically retrieve the optimal set of input features affecting dam hazard potential; and (2) amplify the search mechanism of regression tree (REGT) through optimizing its hyper parameters. As for the second component, the developed DE-REGT model is validated using four folds of comparative assessments to evaluate its prediction capabilities. In the first fold, the developed DE-REGT model is trialed against nine highly regarded machine learning and deep learning models. The second fold is designated to structure, an integrative ranking of the investigated data-driven models, counting on their scores in the performance evaluation metrics. The third fold is used to study the effectiveness of using differential evolution for the hyper parameter optimization of regression tree. The fourth fold aims at testing the usefulness of using differential evolution as a feature extractor algorithm. Performance comparative analysis demonstrated that the developed DE-REGT model outperformed the remainder of the data-driven models. It accomplished mean absolute percentage error, relative absolute error, mean absolute error, root squared error, root mean squared error and a Nash–Sutcliffe efficiency of 9.62%, 0.27, 0.17, 0.31, 0.41 and 0.74, respectively. Results also revealed that the developed model managed to perform better than other meta-heuristic-based regression tree models and classical feature extraction algorithms, exemplifying the appropriateness of using differential evolution for hyper parameter optimization and feature extraction. It can be argued that the developed model could assist policy makers in the prioritization of their maintenance management plans and reduce impairments caused by the failure or misoperation of dams.

Modifications for the Differential Evolution Algorithm

Differential Evolution (DE) is a method of optimization used in symmetrical optimization problems and also in problems that are not even continuous, and are noisy and change over time. DE optimizes a problem with a population of candidate solutions and creates new candidate solutions per generation in combination with existing rules according to discriminatory rules. The present work proposes two variations for this method. The first significantly improves the termination of the method by proposing an asymptotic termination rule, which is based on the differentiation of the average of the function values in the population of DE. The second modification proposes a new scheme for a critical parameter of the method, which improves the method’s ability to better explore the search space of the objective function. The proposed variations have been tested on a number of problems from the current literature, and from the experimental results, it appears that the proposed modifications render the method quite robust and faster even in large-scale problems.

Forecasting Daily Electricity Price by Hybrid Model of Fractional Wavelet Transform, Feature Selection, Support Vector Machine and Optimization Algorithm

This paper proposes a novel hybrid forecasting model with three main parts to accurately forecast daily electricity prices. In the first part, where data are divided into high- and low-frequency data using the fractional wavelet transform, the best data with the highest relevancy are selected, using a feature selection algorithm. The second part is based on a nonlinear support vector network and auto-regressive integrated moving average (ARIMA) method for better training the previous values of electricity prices. The third part optimally adjusts the proposed support vector machine parameters with an error-base objective function, using the improved grey wolf and particle swarm optimization. The proposed method is applied to forecast electricity markets, and the results obtained are analyzed with the help of the criteria based on the forecast errors. The results demonstrate the high accuracy in the MAPE index of forecasting the electricity price, which is about 91% as compared to other forecasting methods.

Multi-strategy Gaussian Harris hawks optimization for fatigue life of tapered roller bearings

Bearing is one of the most fundamental components of rotary machinery, and its fatigue life is a crucial factor in designing. The design optimization of tapered roller bearing (TRB) is a complex design problem because various arrays of designing parameters and functional requirements should be fulfilled. Since there are many design variables and nonlinear constraints, presenting an optimal design of TRBs poses some challenges for metaheuristic algorithms. The Harris hawks optimization (HHO) algorithm is a robust nature-inspired method with unique exploitation and exploration phases due to its time-varying structure. However, this metaheuristic algorithm may still converge to local optima for more challenging problems such as the design of TRBs. Therefore, this study aims to improve the accuracy and efficiency of the shortcomings of this algorithm. The performance of the proposed algorithm is first evaluated for the TRB optimization problem. The TRB optimization design has nine design variables and 26 constraints because of geometrical dimensions and strength conditions. The productivity of the proposed method is compared with diverse metaheuristic algorithms in the literature. The results demonstrate the significant development of dynamic load capacity in comparison to the standard value. Furthermore, the enhanced version of the HHO algorithm presented in this study is benchmarked with various well-known engineering problems. For supplementary materials regarding algorithms in this research, readers can refer to https://aliasgharheidari.com.

Understanding the role of big data analytics for coordination of electronic retail service supply chain

Purpose

Based on the typical service supply chain (SSC) structure, the authors construct the model of e-tailing SSC to explore the coordination relationship in the supply chain, and big data analysis provides realistic possibilities for the creation of coordination mechanisms.

Design/methodology/approach

At the present stage, the e-commerce companies have not yet established a mature SSC system and have not achieved good synergy with other members of the supply chain, the shortage of goods and the greater pressure of express logistics companies coexist. In the case of uncertain online shopping market demand, the authors employ newsboy model, applied in the operations research, to analyze the synergistic mechanism of SSC model.

Findings

By analyzing the e-tailing SSC coordination mechanism and adjusting relevant parameters, the authors find that the synergy mechanism can be implemented and optimized. Through numerical example analysis, the authors confirmed the feasibility of the above analysis.

Originality/value

Big data analysis provides a kind of reality for the establishment of online SSC coordination mechanism. The establishment of an online supply chain coordination mechanism can effectively promote the efficient allocation of supplies and better meet consumers' needs.

SemSeq4FD: Integrating global semantic relationship and local sequential order to enhance text representation for fake news detection

The wide spread of fake news has caused huge losses to both governments and the public. Many existing works on fake news detection utilized spreading information like propagators profiles and the propagation structure. However, such methods face the difficulty of data collection and cannot detect fake news at the early stage. An alternative approach is to detect fake news solely based on its content. Early content-based methods rely on manually designed linguistic features. Such shallow features are domain-dependent, and cannot easily be generalized to cross-domain data. Recently, many natural language processing tasks resort to deep learning methods to learn word, sentence, and document representations. In this paper, we propose a novel graph-based neural network model named SemSeq4FD for early fake news detection based on enhanced text representations. In SemSeq4FD, we model the global pair-wise semantic relations between sentences as a complete graph, and learn the global sentence representations via a graph convolutional network with self-attention mechanism. Considering the importance of local context in conveying the sentence meaning, we employ a 1D convolutional network to learn the local sentence representations. The two representations are combined to form the enhanced sentence representations. Then a LSTM-based network is used to model the sequence of enhanced sentence representations, yielding the final document representation for fake news detection. Experiments conducted on four real-world datasets in English and Chinese, including cross-source and cross-domain datasets, demonstrate that our model can outperform the state-of-the-art methods.