Search results

Metaheuristic algorithms based on biology, evolutionary theory and physical principles, have been widely developed for complex global optimization. This paper aims to present a new hybrid optimization algorithm that combines the characteristics of biogeography-based optimization (BBO), invasive weed optimization (IWO) and genetic algorithms (GAs).

The significant difference between the new algorithm and original optimizers is a periodic selection scheme for offspring. The selection criterion is a function of cyclic discharge and the fitness of populations. It differs from traditional optimization methods where the elite always gains advantages. With this method, fitter populations may still be rejected, while poorer ones might be likely retained. The selection scheme is applied to help escape from local optima and maintain solution diversity.

The efficiency of the proposed method is tested on 13 high-dimensional, nonlinear benchmark functions and a homogenous slope stability problem. The results of the benchmark function show that the new method performs well in terms of accuracy and solution diversity. The algorithm converges with a magnitude of 10-4, compared to 102 in BBO and 10-2 in IWO. In the slope stability problem, the safety factor acquired by the analogy of slope erosion (ASE) is closer to the recommended value.

This paper introduces a periodic selection strategy and constructs a hybrid optimizer, which enhances the global exploration capacity of metaheuristic algorithms.

The paper proposed a fast procedure for solving the reliability-based robust design optimization (RBRDO) by modifying the RBRDO formulation and transforming it into a series of RBRDO subproblems. Then for each subproblem, the objective function, constraint function and reliability index are approximated using Taylor series expansion, and their approximate forms depend on the deterministic design vector rather than the random vector and the uncertain estimation in the inner loop of RBRDO can be avoided. In this way, it can greatly reduce the evaluation number of performance function. Lastly, the trust region method is used to manage the above sequential RBRDO subproblems for convergence.

As is known, RBRDO is nested optimization, where the outer loop updates the design vector and the inner loop estimate the uncertainties. When solving the RBRDO, a large evaluation number of performance functions are needed. Aiming at this issue, the paper proposed a fast integrated procedure for solving the RBRDO by reducing the evaluation number for the performance functions. First, it transforms the original RBRDO problem into a series of RBRDO subproblems. In each subproblem, the objective function, constraint function and reliability index caused are approximated using simple explicit functions that solely depend on the deterministic design vector rather than the random vector. In this way, the need for extensive sampling simulation in the inner loop is greatly reduced. As a result, the evaluation number for performance functions is significantly reduced, leading to a substantial reduction in computation cost. The trust region method is then employed to handle the sequential RBRDO subproblems, ensuring convergence to the optimal solutions. Finally, the engineering test and the application are presented to illustrate the effectiveness and efficiency of the proposed methods.

The paper proposes a fast procedure of solving the RBRDO can greatly reduce the evaluation number of performance function within the RBRDO and the computation cost can be saved greatly, which makes it suitable for engineering applications.

The standard deviation of the original objective function of the RBRDO is replaced by the mean and the reliability index of the original objective function, which are further approximated by using Taylor series expansion and their approximate forms depend on the deterministic design vector rather than the random vector. Moreover, the constraint functions are also approximated by using Taylor series expansion. In this way, the uncertainty estimation of the performance functions (i.e. the mean of the objective function, the constraint functions) and the reliability index of the objective function are avoided within the inner loop of the RBRDO.

Recently, electric vehicles have been widely used in the cold chain logistics sector to reduce the effects of excessive energy consumption and to support environmental friendliness. Considering the limited battery capacity of electric vehicles, it is vital to optimize battery charging during the distribution process.

This study establishes an electric vehicle routing model for cold chain logistics with charging stations, which will integrate multiple distribution centers to achieve sustainable logistics. The suggested optimization model aimed at minimizing the overall cost of cold chain logistics, which incorporates fixed, damage, refrigeration, penalty, queuing, energy and carbon emission costs. In addition, the proposed model takes into accounts factors such as time-varying speed, time-varying electricity price, energy consumption and queuing at the charging station. In the proposed model, a hybrid crow search algorithm (CSA), which combines opposition-based learning (OBL) and taboo search (TS), is developed for optimization purposes. To evaluate the model, algorithms and model experiments are conducted based on a real case in Chongqing, China.

The result of algorithm experiments illustrate that hybrid CSA is effective in terms of both solution quality and speed compared to genetic algorithm (GA) and particle swarm optimization (PSO). In addition, the model experiments highlight the benefits of joint distribution over individual distribution in reducing costs and carbon emissions.

The optimization model of cold chain logistics routes based on electric vehicles provides a reference for managers to develop distribution plans, which contributes to the development of sustainable logistics.

In prior studies, many scholars have conducted related research on the subject of cold chain logistics vehicle routing problems and electric vehicle routing problems separately, but few have merged the above two subjects. In response, this study innovatively designs an electric vehicle routing model for cold chain logistics with consideration of time-varying speeds, time-varying electricity prices, energy consumption and queues at charging stations to make it consistent with the real world.

The Denial of Service (DoS) attack is a category of intrusion that devours various services and resources of the organization by the dispersal of unusable traffic, so that reliable users are not capable of getting benefit from the services. In general, the DoS attackers preserve their independence by collaborating several victim machines and following authentic network traffic, which makes it more complex to detect the attack. Thus, these issues and demerits faced by existing DoS attack recognition schemes in cloud are specified as a major challenge to inventing a new attack recognition method.

This paper aims to detect DoS attack detection scheme, termed as sine cosine anti coronavirus optimization (SCACVO)-driven deep maxout network (DMN). The recorded log file is considered in this method for the attack detection process. Significant features are chosen based on Pearson correlation in the feature selection phase. The over sampling scheme is applied in the data augmentation phase, and then the attack detection is done using DMN. The DMN is trained by the SCACVO algorithm, which is formed by combining sine cosine optimization and anti-corona virus optimization techniques.

The SCACVO-based DMN offers maximum testing accuracy, true positive rate and true negative rate of 0.9412, 0.9541 and 0.9178, respectively.

The DoS attack detection using the proposed model is accurate and improves the effectiveness of the detection.

Denial-of-service (DoS) attacks develop unauthorized entry to various network services and user information by building traffic that creates multiple requests simultaneously making the system unavailable to users. Protection of internet services requires effective DoS attack detection to keep an eye on traffic passing across protected networks, freeing the protected internet servers from surveillance threats and ensuring they can focus on offering high-quality services with the fewest response times possible.

This paper aims to develop a hybrid optimization-based deep learning model to precisely detect DoS attacks.

The designed Aquila deer hunting optimization-enabled deep belief network technique achieved improved performance with an accuracy of 92.8%, a true positive rate of 92.8% and a true negative rate of 93.6.

The introduced detection approach effectively detects DoS attacks available on the internet.

Bitcoin has indeed been universally acknowledged as an investment asset in recent decades, after the boom-and-bust of cryptocurrency values. Because of its extreme volatility, it requires accurate forecasts to build economic decisions. Although prior research has utilized machine learning to improve Bitcoin price prediction accuracy, few have looked into the plausibility of using multiple modeling approaches on datasets containing varying data types and volumetric attributes. Thus, this paper aims to propose a bitcoin price prediction model.

In this research work, a bitcoin price prediction model is introduced by following three major phases: Data collection, feature extraction and price prediction. Initially, the collected Bitcoin time-series data will be preprocessed and the original features will be extracted. To make this work good-fit with a high level of accuracy, we have been extracting the second order technical indicator based features like average true range (ATR), modified-exponential moving average (M-EMA), relative strength index and rate of change and proposed decomposed inter-day difference. Subsequently, these extracted features along with the original features will be subjected to prediction phase, where the prediction of bitcoin price value is attained precisely from the constructed two-level ensemble classifier. The two-level ensemble classifier will be the amalgamation of two fabulous classifiers: optimized convolutional neural network (CNN) and bidirectional long/short-term memory (BiLSTM). To cope up with the volatility characteristics of bitcoin prices, it is planned to fine-tune the weight parameter of CNN by a new hybrid optimization model. The proposed hybrid optimization model referred as black widow updated rain optimization (BWURO) model will be conceptual blended of rain optimization algorithm and black widow optimization algorithm.

The proposed work is compared over the existing models in terms of convergence, MAE, MAPE, MARE, MSE, MSPE, MRSE, Root Mean Square Error (RMSE), RMSPE and RMSRE, respectively. These evaluations have been conducted for both algorithmic performance as well as classifier performance. At LP = 50, the MAE of the proposed work is 0.023372, which is 59.8%, 72.2%, 62.14% and 64.08% better than BWURO + Bi-LSTM, CNN + BWURO, NN + BWURO and SVM + BWURO, respectively.

In this research work, a new modified EMA feature is extracted, which makes the bitcoin price prediction more efficient. In this research work, a two-level ensemble classifier is constructed in the price prediction phase by blending the Bi-LSTM and optimized CNN, respectively. To deal with the volatility of bitcoin values, a novel hybrid optimization model is used to fine-tune the weight parameter of CNN.

Although disassembly balancing lines has been studied for over two decades, there is a gap in the robotic disassembly. Moreover, combination of problem with heterogeneous employee assignment is also lacking. The hazard related with the tasks performed on disassembly lines on workers can be reduced by the use of robots or collaborative robots (cobots) instead of workers. This situation causes an increase in costs. The purpose of the study is to propose a novel version of the problem and to solve this bi-objective (minimizing cost and minimizing hazard simultaneously) problem.

The epsilon constraint method was used to solve the bi-objective model. Entropy-based Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) and Preference Ranking Organization methods for Enrichment Evaluation (PROMETHEE) methods were used to support the decision-maker. In addition, a new criterion called automation rate was proposed. The effects of factors were investigated with full factor experiment design.

The effects of all factors were found statistically significant on the solution time. The combined effect of the number of tasks and number of workers was also found to be statistically significant.

In this study, for the first time in the literature, a disassembly line balancing and employee assignment model was proposed in the presence of heterogeneous workers, robots and cobots to simultaneously minimize the hazard to the worker and cost.

Gas metal arc-based directed energy deposition (GMA-DED) process experiences residual stress (RS) developed due to heat accumulation during successive layer deposition as a significant challenge. To address that, monitoring of transient temperature distribution concerning time is a critical input. Finite element analysis (FEA) is considered a decisive engineering tool in quantifying temperature and RS in all manufacturing processes. However, computational time and prediction accuracy has always been a matter of concern for FEA-based prediction of responses in the GMA-DED process. Therefore, this study aims to investigate the effect of finite element mesh variations on the developed RS in the GMA-DED process.

The variation in the element shape functions, i.e. linear- and quadratic-interpolation elements, has been used to model a single-track 10-layered thin-walled component in Ansys parametric design language. Two cases have been proposed in this study: Case 1 has been meshed with the linear-interpolation elements and Case 2 has been meshed with the combination of linear- and quadratic-interpolation elements. Furthermore, the modelled responses are authenticated with the experimental results measured through the data acquisition system for temperature and RS.

A good agreement of temperature and RS profile has been observed between predicted and experimental values. Considering similar parameters, Case 1 produced an average error of 4.13%, whereas Case 2 produced an average error of 23.45% in temperature prediction. Besides, comparing the longitudinal stress in the transverse direction for Cases 1 and 2 produced an error of 8.282% and 12.796%, respectively.

To avoid the costly and time-taking experimental approach, the experts have suggested the utilization of numerical methods in the design optimization of engineering problems. The FEA approach, however, is a subtle tool, still, it faces high computational cost and low accuracy based on the choice of selected element technology. This research can serve as a basis for the choice of element technology which can predict better responses in the thermo-mechanical modelling of the GMA-DED process.

This paper aims to propose a robust method for non-rigid point set registration, using the Gaussian mixture model and accommodating non-rigid transformations. The posterior probabilities of the mixture model are determined through the proposed integrated feature divergence.

The method involves an alternating two-step framework, comprising correspondence estimation and subsequent transformation updating. For correspondence estimation, integrated feature divergences including both global and local features, are coupled with deterministic annealing to address the non-convexity problem of registration. For transformation updating, the expectation-maximization iteration scheme is introduced to iteratively refine correspondence and transformation estimation until convergence.

The experiments confirm that the proposed registration approach exhibits remarkable robustness on deformation, noise, outliers and occlusion for both 2D and 3D point clouds. Furthermore, the proposed method outperforms existing analogous algorithms in terms of time complexity. Application of stabilizing and securing intermodal containers loaded on ships is performed. The results demonstrate that the proposed registration framework exhibits excellent adaptability for real-scan point clouds, and achieves comparatively superior alignments in a shorter time.

The integrated feature divergence, involving both global and local information of points, is proven to be an effective indicator for measuring the reliability of point correspondences. This inclusion prevents premature convergence, resulting in more robust registration results for our proposed method. Simultaneously, the total operating time is reduced due to a lower number of iterations.

The electromechanical brake system is leading the latest development trend in railway braking technology. The tolerance stack-up generated during the assembly and production process catalyzes the slight geometric dimensioning and tolerancing between the motor stator and rotor inside the electromechanical cylinder. The tolerance leads to imprecise brake control, so it is necessary to diagnose the fault of the motor in the fully assembled electromechanical brake system. This paper aims to present improved variational mode decomposition (VMD) algorithm, which endeavors to elucidate and push the boundaries of mechanical synchronicity problems within the realm of the electromechanical brake system.

The VMD algorithm plays a pivotal role in the preliminary phase, employing mode decomposition techniques to decompose the motor speed signals. Afterward, the error energy algorithm precision is utilized to extract abnormal features, leveraging the practical intrinsic mode functions, eliminating extraneous noise and enhancing the signal’s fidelity. This refined signal then becomes the basis for fault analysis. In the analytical step, the cepstrum is employed to calculate the formant and envelope of the reconstructed signal. By scrutinizing the formant and envelope, the fault point within the electromechanical brake system is precisely identified, contributing to a sophisticated and accurate fault diagnosis.

This paper innovatively uses the VMD algorithm for the modal decomposition of electromechanical brake (EMB) motor speed signals and combines it with the error energy algorithm to achieve abnormal feature extraction. The signal is reconstructed according to the effective intrinsic mode functions (IMFS) component of removing noise, and the formant and envelope are calculated by cepstrum to locate the fault point. Experiments show that the empirical mode decomposition (EMD) algorithm can effectively decompose the original speed signal. After feature extraction, signal enhancement and fault identification, the motor mechanical fault point can be accurately located. This fault diagnosis method is an effective fault diagnosis algorithm suitable for EMB systems.

By using this improved VMD algorithm, the electromechanical brake system can precisely identify the rotational anomaly of the motor. This method can offer an online diagnosis analysis function during operation and contribute to an automated factory inspection strategy while parts are assembled. Compared with the conventional motor diagnosis method, this improved VMD algorithm can eliminate the need for additional acceleration sensors and save hardware costs. Moreover, the accumulation of online detection functions helps improve the reliability of train electromechanical braking systems.