Hybrid Optimization Algorithm for Handwritten Document Enhancement

The Gannet Optimization Algorithm (GOA) and the Whale Optimization Algorithm (WOA) demonstrate strong performance;however, there remains room for improvement in convergence and practical applications. This study introduces a hybrid optimization algorithm, named the adaptive inertia weight whale optimization algorithm and gannet optimization algorithm (AIWGOA), which addresses challenges in enhancing handwritten documents. The hybrid strategy integrates the strengths of both algorithms, significantly enhancing their capabilities, whereas the adaptive parameter strategy mitigates the need for manual parameter setting. By amalgamating the hybrid strategy and parameter-adaptive approach, the Gannet Optimization Algorithm was refined to yield the AIWGOA. Through a performance analysis of the CEC2013 benchmark, the AIWGOA demonstrates notable advantages across various metrics. Subsequently, an evaluation index was employed to assess the enhanced handwritten documents and images, affirming the superior practical application of the AIWGOA compared with other algorithms.

Tourism Route Recommendation Based on A Multi-Objective Evolutionary Algorithm Using Two-Stage Decomposition and Pareto Layering

Tourism route planning is widely applied in the smart tourism field.The Pareto-optimal front obtained by the traditional multi-objective evolutionary algorithm exhibits long tails,sharp peaks and disconnected regions problems,which leads to uneven distribution and weak diversity of optimization solutions of tourism routes.Inspired by these limitations,we propose a multi-objective evolutionary algorithm for tourism route recommendation(MOTRR)with two-stage and Pareto layering based on decomposition.The method decomposes the multiobjective problem into several subproblems,and improves the distribution of solutions through a two-stage method.The crowding degree mechanism between extreme and intermediate populations is used in the two-stage method.The neighborhood is determined according to the weight of the subproblem for crossover mutation.Finally,Pareto layering is used to improve the updating efficiency and population diversity of the solution.The two-stage method is combined with the Pareto layering structure,which not only maintains the distribution and diversity of the algorithm,but also avoids the same solutions.Compared with several classical benchmark algorithms,the experimental results demonstrate competitive advantages on five test functions,hypervolume(HV)and inverted generational distance(IGD)metrics.Using the experimental results of real scenic spot datasets from two famous tourism social networking sites with vast amounts of users and large-scale online comments in Beijing,our proposed algorithm shows better distribution.It proves that the tourism routes recommended by our proposed algorithm have better distribution and diversity,so that the recommended routes can better meet the personalized needs of tourists.

Multi-source coordinated stochastic restoration for SOP in distribution networks with a two-stage algorithm

After suffering from a grid blackout, distributed energy resources(DERs), such as local renewable energy and controllable distributed generators and energy storage can be used to restore loads enhancing the system’s resilience. In this study, a multi-source coordinated load restoration strategy was investigated for a distribution network with soft open points(SOPs). Here, the flexible regulation ability of the SOPs is fully utilized to improve the load restoration level while mitigating voltage deviations. Owing to the uncertainty, a scenario-based stochastic optimization approach was employed,and the load restoration problem was formulated as a mixed-integer nonlinear programming model. A computationally efficient solution algorithm was developed for the model using convex relaxation and linearization methods. The algorithm is organized into a two-stage structure, in which the energy storage system is dispatched in the first stage by solving a relaxed convex problem. In the second stage, an integer programming problem is calculated to acquire the outputs of both SOPs and power resources. A numerical test was conducted on both IEEE 33-bus and IEEE 123-bus systems to validate the effectiveness of the proposed strategy.

Reconstruction of Gene Regulatory Networks Based on Two-Stage Bayesian Network Structure Learning Algorithm

In the post-genomic biology era,the reconstruction of gene regulatory networks from microarray gene expression data is very important to understand the underlying biological system,and it has been a challenging task in bioinformatics.The Bayesian network model has been used in reconstructing the gene regulatory network for its advantages,but how to determine the network structure and parameters is still important to be explored.This paper proposes a two-stage structure learning algorithm which integrates immune evolution algorithm to build a Bayesian network.The new algorithm is evaluated with the use of both simulated and yeast cell cycle data.The experimental results indicate that the proposed algorithm can find many of the known real regulatory relationships from literature and predict the others unknown with high validity and accuracy.

Hyperparameter Optimization for Capsule Network Based Modified Hybrid Rice Optimization Algorithm

Hyperparameters play a vital impact in the performance of most machine learning algorithms.It is a challenge for traditional methods to con-figure hyperparameters of the capsule network to obtain high-performance manually.Some swarm intelligence or evolutionary computation algorithms have been effectively employed to seek optimal hyperparameters as a com-binatorial optimization problem.However,these algorithms are prone to get trapped in the local optimal solution as random search strategies are adopted.The inspiration for the hybrid rice optimization(HRO)algorithm is from the breeding technology of three-line hybrid rice in China,which has the advantages of easy implementation,less parameters and fast convergence.In the paper,genetic search is combined with the hybrid rice optimization algorithm(GHRO)and employed to obtain the optimal hyperparameter of the capsule network automatically,that is,a probability search technique and a hybridization strategy belong with the primary HRO.Thirteen benchmark functions are used to evaluate the performance of GHRO.Furthermore,the MNIST,Chest X-Ray(pneumonia),and Chest X-Ray(COVID-19&pneumonia)datasets are also utilized to evaluate the capsule network learnt by GHRO.The experimental results show that GHRO is an effective method for optimizing the hyperparameters of the capsule network,which is able to boost the performance of the capsule network on image classification.

Optimization of Multi-Execution Modes and Multi-Resource-Constrained Offshore Equipment Project Scheduling Based on a Hybrid Genetic Algorithm

Offshore engineering construction projects are large and complex,having the characteristics of multiple execution modes andmultiple resource constraints.Their complex internal scheduling processes can be regarded as resourceconstrained project scheduling problems(RCPSPs).To solve RCPSP problems in offshore engineering construction more rapidly,a hybrid genetic algorithmwas established.To solve the defects of genetic algorithms,which easily fall into the local optimal solution,a local search operation was added to a genetic algorithm to defend the offspring after crossover/mutation.Then,an elitist strategy and adaptive operators were adopted to protect the generated optimal solutions,reduce the computation time and avoid premature convergence.A calibrated function method was used to cater to the roulette rules,and appropriate rules for encoding,decoding and crossover/mutation were designed.Finally,a simple network was designed and validated using the case study of a real offshore project.The performance of the genetic algorithmand a simulated annealing algorithmwas compared to validate the feasibility and effectiveness of the approach.

Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage

This paper considers a scheduling problem in two-stage hybrid flow shop, where the first stage consists of two machines formed an open shop and the other stage has only one machine. The objective is to minimize the makespan, i.e., the maximum completion time of all jobs. We first show the problem is NP-hard in the strong sense, then we present two heuristics to solve the problem. Computational experiments show that the combined algorithm of the two heuristics performs well on randomly generated problem instances.

Enhanced Detection of Cerebral Atherosclerosis Using Hybrid Algorithm of Image Segmentation

In medical science for envisaging human body’s phenomenal structure a major part has been driven by image processing techniques.Major objective of this work is to detect of cerebral atherosclerosis for image segmentation applica-tion.Detection of some abnormal structures in human body has become a difficult task to complete with some simple images.For expounding and distinguishing neural architecture of human brain in an effective manner,MRI(Magnetic Reso-nance Imaging)is one of the most suitable and significant technique.Here we work on detection of Cerebral Atherosclerosis from MRI images of patients.Cer-ebral Atherosclerosis is a cerebral vascular disease causes narrowing of the arteries due to buildup of fatty plaque inside the blood vessels of the brain.It leads to Ischemic stroke if not diagnosed early.Stroke affects majorly old age people and percentage of affected women is more compared to men.Results:Preproces-sing is done by using alpha trimmed meanfilter which is used to remove noise and also it enhances the image.Segmentation of cerebral atherosclerosis is done by using K-means clustering,Contextual clustering,and proposed Hybrid algo-rithm.Various parameters like Correlation,Pixel density,energy is determined and from the analysis of parameters it is determined that proposed Hybrid algo-rithm is efficient.

Detecting and Preventing of Attacks in Cloud Computing Using Hybrid Algorithm

Cloud computing is the technology that is currently used to provide users with infrastructure,platform,and software services effectively.Under this system,Platform as a Service(PaaS)offers a medium headed for a web development platform that uniformly distributes the requests and resources.Hackers using Denial of service(DoS)and Distributed Denial of Service(DDoS)attacks abruptly interrupt these requests.Even though several existing methods like signature-based,statistical anomaly-based,and stateful protocol analysis are available,they are not sufficient enough to get rid of Denial of service(DoS)and Distributed Denial of Service(DDoS)attacks and hence there is a great need for a definite algorithm.Concerning this issue,we propose an improved hybrid algorithm which is a combination of Multivariate correlation analysis,Spearman coefficient,and mitigation technique.It can easily differentiate common traffic and attack traffic.Not only that,it greatly helps the network to distribute the resources only for authenticated requests.The effects of comparing with the normalized information have shown an extra encouraging detection accuracy of 99%for the numerous DoS attack as well as DDoS attacks.

A Review of Hybrid Cyber Threats Modelling and Detection Using Artificial Intelligence in IIoT

The Industrial Internet of Things(IIoT)has brought numerous benefits,such as improved efficiency,smart analytics,and increased automation.However,it also exposes connected devices,users,applications,and data generated to cyber security threats that need to be addressed.This work investigates hybrid cyber threats(HCTs),which are now working on an entirely new level with the increasingly adopted IIoT.This work focuses on emerging methods to model,detect,and defend against hybrid cyber attacks using machine learning(ML)techniques.Specifically,a novel ML-based HCT modelling and analysis framework was proposed,in which L1 regularisation and Random Forest were used to cluster features and analyse the importance and impact of each feature in both individual threats and HCTs.A grey relation analysis-based model was employed to construct the correlation between IIoT components and different threats.

复杂建设环境下基于Hybrid A^(*)算法的铁路平面线形绿色优化设计

随着“双碳经济下绿色铁路”理念的兴起,将“绿色生态”融入到铁路平面线路优化已成为近年来的研究热点。本文以铁路建设成本与生态破坏成本的协同优化为目标,引入并改进了一种自动驾驶导航算法(Hybrid A^(*)算法),以适应复杂的铁路设计问题,同时考虑最小曲线半径、最大曲线半径、最短曲线长度、最短夹直线长度、缓和曲线长度等铁路线形约束。研究结果表明:(1)改进后算法以离散网格方式整合外部环境因素,实现渐进式全局探索,获取接近全局最优的铁路线路设计结果;(2)该方法在复杂外部环境约束下,无需预设水平交点位置和数量,可自动生成符合线路-环境耦合约束的优化平面线路方案。

基于改进Hybrid A^(*)算法的阿克曼移动机器人路径规划

针对移动机器人路径规划的效率和所规划路径的安全性问题,基于阿克曼六轮转向模型,提出了一种基于改进Hybrid A^(*)算法的路径规划方法。通过改进Hybrid A^(*)算法中的启发式函数,引入距离惩罚函数,减少了节点搜索数量;通过构建安全走廊,引导移动机器人尽可能远离障碍物;在代价函数中加入了节点向前、换向和向后扩展的惩罚项,确保所规划路径的可执行性与安全性。通过仿真表明,基于改进Hybrid A^(*)算法的路径规划方法适用于阿克曼六轮移动机器人,提高了路径规划的效率,规划的路径更具安全保障。

Series-parallel Hybrid Vehicle Control Strategy Design and Optimization Using Real-valued Genetic Algorithm

Despite the series-parallel hybrid electric vehicle inherits the performance advantages from both series and parallel hybrid electric vehicle, few researches about the series-parallel hybrid electric vehicle have been revealed because of its complex co nstruction and control strategy. In this paper, a series-parallel hybrid electric bus as well as its control strategy is revealed, and a control parameter optimization approach using the real-valued genetic algorithm is proposed. The optimization objective is to minimize the fuel consumption while sustain the battery state of charge, a tangent penalty function of state of charge（SOC） is embodied in the objective function to recast this multi-objective nonlinear optimization problem as a single linear optimization problem. For this strategy, the vehicle operating mode is switched based on the vehicle speed, and an ＂optimal line＂ typed strategy is designed for the parallel control. The optimization parameters include the speed threshold for mode switching, the highest state of charge allowed, the lowest state of charge allowed and the scale factor of the engine optimal torque to the engine maximum torque at a rotational speed. They are optimized through numerical experiments based on real-value genes, arithmetic crossover and mutation operators. The hybrid bus has been evaluated at the Chinese Transit Bus City Driving Cycle via road test, in which a control area network-based monitor system was used to trace the driving schedule. The test result shows that this approach is feasible for the control parameter optimization. This approach can be applied to not only the novel construction presented in this paper, but also other types of hybrid electric vehicles.

Identification of vibration loads on hydro generator by using hybrid genetic algorithm

Vibration dynamic characteristics have been a major issue in the modeling and mechanical analysis of large hydro generators. An algorithm is developed for identifying vibration dynamic characteristics by means of hybrid genetic algorithm. From the measured dynamic responses of a hydro generator, an appropriate estimation algorithm is needed to identify the loading parameters, including the main frequencies and amplitudes of vibrating forces. In order to identify parameters in an efficient and robust manner, an optimization method is proposed that combines genetic algorithm with simulated annealing and elitist strategy. The hybrid genetic algorithm is then used to tackle an ill-posed problem of parameter identification, in which the effectiveness of the proposed optimization method is confirmed by its comparison with actual observation data.

Parameter selection of support vector regression based on hybrid optimization algorithm and its application

Choosing optimal parameters for support vector regression （SVR） is an important step in SVR. design, which strongly affects the pefformance of SVR. In this paper, based on the analysis of influence of SVR parameters on generalization error, a new approach with two steps is proposed for selecting SVR parameters, First the kernel function and SVM parameters are optimized roughly through genetic algorithm, then the kernel parameter is finely adjusted by local linear search, This approach has been successfully applied to the prediction model of the sulfur content in hot metal. The experiment results show that the proposed approach can yield better generalization performance of SVR than other methods,

A New Hybrid Algorithm and Its Numerical Realization for a Quasi-nonexpansive Mapping

The purpose of this article is to propose a new hybrid projection method for a quasi-nonexpansive mapping. The strong convergence of the algorithm is proved in real Hilbert spaces. A numerical experiment is also included to explain the effectiveness of the proposed methods. The results of this paper are interesting extensions of those known results.

New hybrid FDTD algorithm for electromagnetic problem analysis

Since the time step of the traditional finite-difference time-domain(FDTD) method is limited by the small grid size, it is inefficient when dealing with the electromagnetic problems of multi-scale structures.Therefore, the explicit and unconditionally stable FDTD(US-FDTD) approach has been developed to break through the limitation of Courant–Friedrich–Levy(CFL) condition.However, the eigenvalues and eigenvectors of the system matrix must be calculated before the time iteration in the explicit US-FDTD.Moreover, the eigenvalue decomposition is also time consuming, especially for complex electromagnetic problems in practical application.In addition, compared with the traditional FDTD method, the explicit US-FDTD method is more difficult to introduce the absorbing boundary and plane wave.To solve the drawbacks of the traditional FDTD and the explicit US-FDTD, a new hybrid FDTD algorithm is proposed in this paper.This combines the explicit US-FDTD with the traditional FDTD, which not only overcomes the limitation of CFL condition but also reduces the system matrix dimension, and introduces the plane wave and the perfectly matched layer(PML) absorption boundary conveniently.With the hybrid algorithm, the calculation of the eigenvalues is only required in the fine mesh region and adjacent coarse mesh region.Therefore, the calculation efficiency is greatly enhanced.Furthermore, the plane wave and the absorption boundary introduction of the traditional FDTD method can be directly utilized.Numerical results demonstrate the effectiveness, accuracy, stability, and convenience of this hybrid algorithm.

Optimization of the seismic processing phase-shift plus finite-difference migration operator based on a hybrid genetic and simulated annealing algorithm

Although the phase-shift seismic processing method has characteristics of high accuracy, good stability, high efficiency, and high-dip imaging, it is not able to adapt to strong lateral velocity variation. To overcome this defect, a finite-difference method in the frequency-space domain is introduced in the migration process, because it can adapt to strong lateral velocity variation and the coefficient is optimized by a hybrid genetic and simulated annealing algorithm. The two measures improve the precision of the approximation dispersion equation. Thus, the imaging effect is improved for areas of high-dip structure and strong lateral velocity variation. The migration imaging of a 2-D SEG/EAGE salt dome model proves that a better imaging effect in these areas is achieved by optimized phase-shift migration operator plus a finite-difference method based on a hybrid genetic and simulated annealing algorithm. The method proposed in this paper is better than conventional methods in imaging of areas of high-dip angle and strong lateral velocity variation.

APPLICATION OF HYBRID GENETIC ALGORITHM IN AEROELASTIC MULTIDISCIPLINARY DESIGN OPTIMIZATION OF LARGE AIRCRAFT

The genetic/gradient-based hybrid algorithm is introduced and used in the design studies of aeroelastic optimization of large aircraft wings to attain skin distribution,stiffness distribution and design sensitivity.The program of genetic algorithm is developed by the authors while the gradient-based algorithm borrows from the modified method for feasible direction in MSC/NASTRAN software.In the hybrid algorithm,the genetic algorithm is used to perform global search to avoid to fall into local optima,and then the excellent individuals of every generation optimized by the genetic algorithm are further fine-tuned by the modified method for feasible direction to attain the local optima and hence to get global optima.Moreover,the application effects of hybrid genetic algorithm in aeroelastic multidisciplinary design optimization of large aircraft wing are discussed,which satisfy multiple constraints of strength,displacement,aileron efficiency,and flutter speed.The application results show that the genetic/gradient-based hybrid algorithm is available for aeroelastic optimization of large aircraft wings in initial design phase as well as detailed design phase,and the optimization results are very consistent.Therefore,the design modifications can be decreased using the genetic/gradient-based hybrid algorithm.

Iterative Learning Fault Diagnosis Algorithm for Non-uniform Sampling Hybrid System

For a class of non-uniform output sampling hybrid system with actuator faults and bounded disturbances,an iterative learning fault diagnosis algorithm is proposed.Firstly,in order to measure the impact of fault on system between every consecutive output sampling instants,the actual fault function is transformed to obtain an equivalent fault model by using the integral mean value theorem,then the non-uniform sampling hybrid system is converted to continuous systems with timevarying delay based on the output delay method.Afterwards,an observer-based fault diagnosis filter with virtual fault is designed to estimate the equivalent fault,and the iterative learning regulation algorithm is chosen to update the virtual fault repeatedly to make it approximate the actual equivalent fault after some iterative learning trials,so the algorithm can detect and estimate the system faults adaptively.Simulation results of an electro-mechanical control system model with different types of faults illustrate the feasibility and effectiveness of this algorithm.