Search results

Fraud transaction detection has become a significant factor in the communication technologies and electronic commerce systems, as it affects the usage of electronic payment. Even though, various fraud detection methods are developed, enhancing the performance of electronic payment by detecting the fraudsters results in a great challenge in the bank transaction.

This paper aims to design the fraud detection mechanism using the proposed Harris water optimization-based deep recurrent neural network (HWO-based deep RNN). The proposed fraud detection strategy includes three different phases, namely, pre-processing, feature selection and fraud detection. Initially, the input transactional data is subjected to the pre-processing phase, where the data is pre-processed using the Box-Cox transformation to remove the redundant and noise values from data. The pre-processed data is passed to the feature selection phase, where the essential and the suitable features are selected using the wrapper model. The selected feature makes the classifier to perform better detection performance. Finally, the selected features are fed to the detection phase, where the deep recurrent neural network classifier is used to achieve the fraud detection process such that the training process of the classifier is done by the proposed Harris water optimization algorithm, which is the integration of water wave optimization and Harris hawks optimization.

Moreover, the proposed HWO-based deep RNN obtained better performance in terms of the metrics, such as accuracy, sensitivity and specificity with the values of 0.9192, 0.7642 and 0.9943.

An effective fraud detection method named HWO-based deep RNN is designed to detect the frauds in the bank transaction. The optimal features selected using the wrapper model enable the classifier to find fraudulent activities more efficiently. However, the accurate detection result is evaluated through the optimization model based on the fitness measure such that the function with the minimal error value is declared as the best solution, as it yields better detection results.

Metaheuristic algorithms have been commonly used as an optimisation tool in various fields. However, optimisation of real-world problems has become increasingly challenging with to increase in system complexity. This situation has become a pull factor to introduce an efficient metaheuristic. This study aims to propose a novel sport-inspired algorithm based on a football playing style called tiki-taka.

The tiki-taka football style is characterised by short passing, player positioning and maintaining possession. This style aims to dominate the ball possession and defeat opponents using its tactical superiority. The proposed tiki-taka algorithm (TTA) simulates the short passing and player positioning behaviour for optimisation. The algorithm was tested using 19 benchmark functions and five engineering design problems. The performance of the proposed algorithm was compared with 11 other metaheuristics from sport-based, highly cited and recent algorithms.

The results showed that the TTA is extremely competitive, ranking first and second on 84% of benchmark problems. The proposed algorithm performs best in two engineering design problems and ranks second in the three remaining problems.

The originality of the proposed algorithm is the short passing strategy that exploits a nearby player to move to a better position.

The purpose of this study is to develop a new parallel metaheuristic algorithm for solving unconstrained continuous optimization problems.

The proposed method brings several metaheuristic algorithms together to form a coalition under Weighted Superposition Attraction-Repulsion Algorithm (WSAR) in a parallel computing environment. The proposed approach runs different single solution based metaheuristic algorithms in parallel and employs WSAR (which is a recently developed and proposed swarm intelligence based optimizer) as controller.

The proposed approach is tested against the latest well-known unconstrained continuous optimization problems (CEC2020). The obtained results are compared with some other optimization algorithms. The results of the comparison prove the efficiency of the proposed method.

This study aims to combine different metaheuristic algorithms in order to provide a satisfactory performance on solving the optimization problems by benefiting their diverse characteristics. In addition, the run time is shortened by parallel execution. The proposed approach can be applied to any type of optimization problems by its problem-independent structure.

The purpose of this paper is to propose a novel improved teaching and learning-based algorithm (TLBO) to enhance its convergence ability and solution accuracy, making it more suitable for solving large-scale optimization issues.

Utilizing multiple cooperation mechanisms in teaching and learning processes, an improved TBLO named CTLBO (collectivism teaching-learning-based optimization) is developed. This algorithm introduces a new preparation phase before the teaching and learning phases and applies multiple teacher–learner cooperation strategies in teaching and learning processes. Applying modularization idea, based on the configuration structure of operators of CTLBO, six variants of CTLBO are constructed. For identifying the best configuration, 30 general benchmark functions are tested. Then, three experiments using CEC2020 (2020 IEEE Conference on Evolutionary Computation)-constrained optimization problems are conducted to compare CTLBO with other algorithms. At last, a large-scale industrial engineering problem is taken as the application case.

Experiment with 30 general unconstrained benchmark functions indicates that CTLBO-c is the best configuration of all variants of CTLBO. Three experiments using CEC2020-constrained optimization problems show that CTLBO is one powerful algorithm for solving large-scale constrained optimization problems. The application case of industrial engineering problem shows that CTLBO and its variant CTLBO-c can effectively solve the large-scale real problem, while the accuracies of TLBO and other meta-heuristic algorithm are far lower than CLTBO and CTLBO-c, revealing that CTLBO and its variants can far outperform other algorithms. CTLBO is an excellent algorithm for solving large-scale complex optimization issues.

The innovation of this paper lies in the improvement strategies in changing the original TLBO with two-phase teaching–learning mechanism to a new algorithm CTLBO with three-phase multiple cooperation teaching–learning mechanism, self-learning mechanism in teaching and group teaching mechanism. CTLBO has important application value in solving large-scale optimization problems.

This paper follows a systematic literature review (SLR) method covering the published studies until March 2021. The authors have extracted the related studies from different online databases utilizing quality-assessment-criteria. In order to review high-quality studies, 32 papers have been chosen through the paper selection process. The selected papers have been categorized into three main groups, decision-making methods (17 papers), meta-heuristic methods (8 papers) and fuzzy-based methods (7 papers). The existing methods in each group have been examined based on important qualitative parameters, namely, time, cost, scalability, efficiency, availability and reliability.

Cloud computing is known as one of the superior technologies to perform large-scale and complex computing. With the growing tendency of network service users to utilize cloud computing, web service providers are encouraged to provide services with various functional and non-functional features and supply them in a service pool. In this regard, choosing the most appropriate services to fulfill users' requirements becomes a challenging problem. Since the problem of service selection in a cloud environment is known as a nondeterministic polynomial time (NP)-hard problem, many efforts have been made in recent years. Therefore, this paper aims to study and assess the existing service selection approaches in cloud computing.

The obtained results indicate that in decision-making methods, the assignment of proper weights to the criteria has a high impact on service ranking accuracy. Also, since service selection in cloud computing is known as an NP-hard problem, utilizing meta-heuristic algorithms to solve this problem offers interesting advantages compared to other approaches in discovering better solutions with less computational effort and moving quickly toward very good solutions. On the other hand, since fuzzy-based service selection approaches offer search results visually and cover quality of service (QoS) requirements of users, this kind of method is able to facilitate enhanced user experience.

Although the current paper aimed to provide a comprehensive study, there were some limitations. Since the authors have applied some filters to select the studies, some effective works may have been ignored. Generally, this paper has focused on journal papers and some effective works published in conferences. Moreover, the works published in non-English formats have been excluded. To discover relevant studies, the authors have chosen Google Scholar as a popular electronic database. Although Google Scholar can offer the most valid approaches, some suitable papers may not be observed during the process of article selection.

The outcome of the current paper will be useful and valuable for scholars, and it can be a roadmap to help future researchers enrich and improve their innovations. By assessing the recent efforts in service selection in cloud computing and offering an up-to-date comparison of the discussed works, this paper can be a solid foundation for understanding the different aspects of service selection.

Although service selection approaches have essential impacts on cloud computing, there is still a lack of a detailed and comprehensive study about reviewing and assessing existing mechanisms in this field. Therefore, the current paper adopts a systematic method to cover this gap. The obtained results in this paper can help the researchers interested in the field of service selection. Generally, the authors have aimed to specify existing challenges, characterize the efficient efforts and suggest some directions for upcoming studies.

Estimation of solar cell parameters, mathematical modeling and the actual performance analysis of photovoltaic (PV) cells at various ecological conditions are very important in the design and analysis of maximum power point trackers and power converters. This study aims to propose the analysis and modeling of a simplified three-diode model based on the manufacturer’s performance data.

A novel technique is presented to evaluate the PV cell constraints and simplify the existing equation using analytical and iterative methods. To examine the current equation, this study focuses on three crucial operational points: open circuit, short circuit and maximum operating points. The number of parameters needed to estimate these built-in models is decreased from nine to five by an effective iteration method, considerably reducing computational requirements.

The proposed model, in contrast to the previous complex nine-parameter three-diode model, simplifies the modeling and analysis process by requiring only five parameters. To ensure the reliability and accuracy of this proposed model, its results were carefully compared with datasheet values under standard test conditions (STC). This model was implemented using MATLAB/Simulink and validated using a polycrystalline solar cell under STC conditions.

The proposed three-diode model clearly outperforms the earlier existing two-diode model in terms of accuracy and performance, especially in lower irradiance settings, according to the results and comparison analysis.

With the rise in wine consumption, accurate wine price forecasts have significantly impacted restaurant and hotel purchasing decisions and inventory management. This study aims to develop a precise and effective wine price point and interval forecasting model.

The proposed forecast model uses an improved hybrid kernel extreme learning machine with an attention mechanism and a multi-objective swarm intelligent optimization algorithm to produce more accurate price estimates. To the best of the authors’ knowledge, this is the first attempt at applying artificial intelligence techniques to improve wine price prediction. Additionally, an effective method for predicting price intervals was constructed by leveraging the characteristics of the error distribution. This approach facilitates quantifying the uncertainty of wine price fluctuations, thus rendering decision-making by relevant practitioners more reliable and controllable.

The empirical findings indicated that the proposed forecast model provides accurate wine price predictions and reliable uncertainty analysis results. Compared with the benchmark models, the proposed model exhibited superiority in both one-step- and multi-step-ahead forecasts. Meanwhile, the model provides new evidence from artificial intelligence to explain wine prices and understand their driving factors.

This study is a pioneering attempt to evaluate the applicability and effectiveness of advanced artificial intelligence techniques in wine price forecasts. The proposed forecast model not only provides useful options for wine price forecasting but also introduces an innovative addition to existing forecasting research methods and literature.

To generate electricity, solar photovoltaic (PV) systems are among the best, most eco-friendly and most cost-effective solutions available. Extraction of maximum possible electricity from the solar PV system is complicated by a number of factors brought on by the ever-changing weather conditions under which it must operate. Many conventional and evolutionary algorithm-based maximum power point tracking (MPPT) techniques have the limitation of not being able to extract maximum power under partial shade and rapidly varying irradiance. Hence, the purpose of this paper is to propose a novel hybrid slime mould assisted with perturb and observe (P&O) global MPPT technique (HSMO) for the hybrid bridge link-honey comb (BL-HC) configured PV system to enhance the better maximum power during dynamic and steady state operations within less time.

In this method, a hybridization of two algorithms is proposed to track the true with faster convergence under PSCs. Initially, the slime mould optimization (SMO) algorithm is initiated for exploration of optimum duty cycles and later P&O algorithm is initiated for exploitation of global duty cycle for the DC–DC converter to operate at GMPP and for fast convergence.

The effectiveness of the proposed HSMO MPPT is compared with adaptive coefficient particle swarm optimization (ACPSO), flower pollination algorithm and SMO MPPT techniques in terms of tracked GMPP, convergence time/tracking speed and efficacy under six complex partial shading conditions. From the results, it is noticed that the proposed algorithm tracks the true GMPP under most of the shading conditions with less tracking time when compared to other MPPT techniques.

This paper proposes a novel hybrid slime mould assisted with perturb and observe (P&O) global MPPT technique (HSMO) for the hybrid BL-HC configured PV system enhance the better maximum power under partial shading conditions (PSCs). This method operated in two stages as SMO for exploration and P&O for exploitation for faster convergence and to track true GMPP under PSCs. The proposed approach largely improves the performance of the MPP tracking of the PV systems. Initially, the proposed MPPT technique is simulated in MATLAB/Simulink environment. Furthermore, an experimental setup has been designed and implemented. Simulation results obtained are validated through experimental results which prove the viability of the proposed technique for an efficient green energy solution.

This paper aims to propose a new ultrasonic diagnosis method for stainless steel weld defects based on multi-domain feature fusion to solve two problems in the ultrasonic diagnosis of austenitic stainless steel weld defects. These are insufficient feature extraction and subjective dependence of diagnosis model parameters.

To express the richness of the one-dimensional (1D) signal information, the 1D ultrasonic testing signal was derived to the two-dimensional (2D) time-frequency domain. Multi-scale depthwise separable convolution was also designed to optimize the MobileNetV3 network to obtain deep convolution feature information under different receptive fields. At the same time, the time/frequent-domain feature extraction of the defect signals was carried out based on statistical analysis. The defect sensitive features were screened out through visual analysis, and the defect feature set was constructed by cascading fusion with deep convolution feature information. To improve the adaptability and generalization of the diagnostic model, the authors designed and carried out research on the hyperparameter self-optimization of the diagnostic model based on the sparrow search strategy and constructed the optimal hyperparameter combination of the model. Finally, the performance of the ultrasonic diagnosis of stainless steel weld defects was improved comprehensively through the multi-domain feature characterization model of the defect data and diagnosis optimization model.

The experimental results show that the diagnostic accuracy of the lightweight diagnosis model constructed in this paper can reach 96.55% for the five types of stainless steel weld defects, including cracks, porosity, inclusion, lack of fusion and incomplete penetration. These can meet the needs of practical engineering applications.

This method provides a theoretical basis and technical reference for developing and applying intelligent, efficient and accurate ultrasonic defect diagnosis technology.

The paper aims to provide an efficient dispatching schedule for ready-mix concrete (RMC) trucks and create a balance between batch plants and construction sites.

The paper focused on developing a new metaheuristic swarm intelligence algorithm using Java code. The paper used statistical criterion: mean, standard deviation, running time to verify the effectiveness of the proposed optimization method and compared its derivatives with other algorithms, such as genetic algorithm (GA), Tabu search (TS), bee colony optimization (BCO), ant lion optimizer (ALO), grey wolf optimizer (GWO), dragonfly algorithm (DA) and particle swarm optimization (PSO).

The paper proved that integrating GWO and DA yields better results than independent algorithms and some selected algorithms in the literature. It also suggests that multi-independent batch plants could effectively cooperate in a system to deliver RMC to various construction sites.

The paper provides a compelling new hybrid swarm intelligence algorithm and a model allowing multi-independent batch plants to work in a system to deliver RMC. It fulfills an identified need to study how batch plant managers can expand their dispatching network, increase their competitiveness and improve their supply chain operations.