As a complicated optimization problem,parallel batch processing machines scheduling problem(PBPMSP)exists in many real-life manufacturing industries such as textiles and semiconductors.Machine eligibility means that a...As a complicated optimization problem,parallel batch processing machines scheduling problem(PBPMSP)exists in many real-life manufacturing industries such as textiles and semiconductors.Machine eligibility means that at least one machine is not eligible for at least one job.PBPMSP and scheduling problems with machine eligibility are frequently considered;however,PBPMSP with machine eligibility is seldom explored.This study investigates PBPMSP with machine eligibility in fabric dyeing and presents a novel shuffled frog-leaping algorithm with competition(CSFLA)to minimize makespan.In CSFLA,the initial population is produced in a heuristic and random way,and the competitive search of memeplexes comprises two phases.Competition between any two memeplexes is done in the first phase,then iteration times are adjusted based on competition,and search strategies are adjusted adaptively based on the evolution quality of memeplexes in the second phase.An adaptive population shuffling is given.Computational experiments are conducted on 100 instances.The computational results showed that the new strategies of CSFLA are effective and that CSFLA has promising advantages in solving the considered PBPMSP.展开更多
Fabric dyeing is a critical production process in the clothing industry and heavily relies on batch processing machines(BPM).In this study,the parallel BPM scheduling problem with machine eligibility in fabric dyeing ...Fabric dyeing is a critical production process in the clothing industry and heavily relies on batch processing machines(BPM).In this study,the parallel BPM scheduling problem with machine eligibility in fabric dyeing is considered,and an adaptive cooperated shuffled frog-leaping algorithm(ACSFLA)is proposed to minimize makespan and total tardiness simultaneously.ACSFLA determines the search times for each memeplex based on its quality,with more searches in high-quality memeplexes.An adaptive cooperated and diversified search mechanism is applied,dynamically adjusting search strategies for each memeplex based on their dominance relationships and quality.During the cooperated search,ACSFLA uses a segmented and dynamic targeted search approach,while in non-cooperated scenarios,the search focuses on local search around superior solutions to improve efficiency.Furthermore,ACSFLA employs adaptive population division and partial population shuffling strategies.Through these strategies,memeplexes with low evolutionary potential are selected for reconstruction in the next generation,while thosewithhighevolutionarypotential are retained to continue their evolution.Toevaluate the performance of ACSFLA,comparative experiments were conducted using ACSFLA,SFLA,ASFLA,MOABC,and NSGA-CC in 90 instances.The computational results reveal that ACSFLA outperforms the other algorithms in 78 of the 90 test cases,highlighting its advantages in solving the parallel BPM scheduling problem with machine eligibility.展开更多
At present, near-surface shear wave velocities are mainly calculated through Rayleigh wave dispersion-curve inversions in engineering surface investigations, but the required calculations pose a highly nonlinear globa...At present, near-surface shear wave velocities are mainly calculated through Rayleigh wave dispersion-curve inversions in engineering surface investigations, but the required calculations pose a highly nonlinear global optimization problem. In order to alleviate the risk of falling into a local optimal solution, this paper introduces a new global optimization method, the shuffle frog-leaping algorithm （SFLA）, into the Rayleigh wave dispersion-curve inversion process. SFLA is a swarm-intelligence-based algorithm that simulates a group of frogs searching for food. It uses a few parameters, achieves rapid convergence, and is capability of effective global searching. In order to test the reliability and calculation performance of SFLA, noise-free and noisy synthetic datasets were inverted. We conducted a comparative analysis with other established algorithms using the noise-free dataset, and then tested the ability of SFLA to cope with data noise. Finally, we inverted a real-world example to examine the applicability of SFLA. Results from both synthetic and field data demonstrated the effectiveness of SFLA in the interpretation of Rayleigh wave dispersion curves. We found that SFLA is superior to the established methods in terms of both reliability and computational efficiency, so it offers great potential to improve our ability to solve geophysical inversion problems.展开更多
In recent years,the volume of information in digital form has increased tremendously owing to the increased popularity of the World Wide Web.As a result,the use of techniques for extracting useful information from lar...In recent years,the volume of information in digital form has increased tremendously owing to the increased popularity of the World Wide Web.As a result,the use of techniques for extracting useful information from large collections of data,and particularly documents,has become more necessary and challenging.Text clustering is such a technique;it consists in dividing a set of text documents into clusters(groups),so that documents within the same cluster are closely related,whereas documents in different clusters are as different as possible.Clustering depends on measuring the content(i.e.,words)of a document in terms of relevance.Nevertheless,as documents usually contain a large number of words,some of them may be irrelevant to the topic under consideration or redundant.This can confuse and complicate the clustering process and make it less accurate.Accordingly,feature selection methods have been employed to reduce data dimensionality by selecting the most relevant features.In this study,we developed a text document clustering optimization model using a novel genetic frog-leaping algorithm that efficiently clusters text documents based on selected features.The proposed approach is based on two metaheuristic algorithms:a genetic algorithm(GA)and a shuffled frog-leaping algorithm(SFLA).The GA performs feature selection,and the SFLA performs clustering.To evaluate its effectiveness,the proposed approach was tested on a well-known text document dataset:the“20Newsgroup”dataset from the University of California Irvine Machine Learning Repository.Overall,after multiple experiments were compared and analyzed,it was demonstrated that using the proposed algorithm on the 20Newsgroup dataset greatly facilitated text document clustering,compared with classical K-means clustering.Nevertheless,this improvement requires longer computational time.展开更多
Uneven power distribution,transient voltage,and frequency deviations are observed in the photovoltaic storage hybrid inverter during the switching between grid-connected and island modes.In response to these issues,th...Uneven power distribution,transient voltage,and frequency deviations are observed in the photovoltaic storage hybrid inverter during the switching between grid-connected and island modes.In response to these issues,this paper proposes a grid-connected/island switching control strategy for photovoltaic storage hybrid inverters based on the modified chimpanzee optimization algorithm.The proposed strategy incorporates coupling compensation and power differentiation elements based on the traditional droop control.Then,it combines the angular frequency and voltage amplitude adjustments provided by the phase-locked loop-free pre-synchronization control strategy.Precise pre-synchronization is achieved by regulating the virtual current to zero and aligning the photovoltaic storage hybrid inverter with the grid voltage.Additionally,two novel operators,learning and emotional behaviors are introduced to enhance the optimization precision of the chimpanzee algorithm.These operators ensure high-precision and high-reliability optimization of the droop control parameters for photovoltaic storage hybrid inverters.A Simulink model was constructed for simulation analysis,which validated the optimized control strategy’s ability to evenly distribute power under load transients.This strategy effectively mitigated transient voltage and current surges during mode transitions.Consequently,seamless and efficient switching between gridconnected and island modes was achieved for the photovoltaic storage hybrid inverter.The enhanced energy utilization efficiency,in turn,offers robust technical support for grid stability.展开更多
Thetraditional first-order reliability method(FORM)often encounters challengeswith non-convergence of results or excessive calculation when analyzing complex engineering problems.To improve the global convergence spee...Thetraditional first-order reliability method(FORM)often encounters challengeswith non-convergence of results or excessive calculation when analyzing complex engineering problems.To improve the global convergence speed of structural reliability analysis,an improved coati optimization algorithm(COA)is proposed in this paper.In this study,the social learning strategy is used to improve the coati optimization algorithm(SL-COA),which improves the convergence speed and robustness of the newheuristic optimization algorithm.Then,the SL-COAis comparedwith the latest heuristic optimization algorithms such as the original COA,whale optimization algorithm(WOA),and osprey optimization algorithm(OOA)in the CEC2005 and CEC2017 test function sets and two engineering optimization design examples.The optimization results show that the proposed SL-COA algorithm has a high competitiveness.Secondly,this study introduces the SL-COA algorithm into the MPP(Most Probable Point)search process based on FORM and constructs a new reliability analysis method.Finally,the proposed reliability analysis method is verified by four mathematical examples and two engineering examples.The results show that the proposed SL-COA-assisted FORM exhibits fast convergence and avoids premature convergence to local optima as demonstrated by its successful application to problems such as composite cylinder design and support bracket analysis.展开更多
Wind farm layout optimization is a critical challenge in renewable energy development,especially in regions with complex terrain.Micro-siting of wind turbines has a significant impact on the overall efficiency and eco...Wind farm layout optimization is a critical challenge in renewable energy development,especially in regions with complex terrain.Micro-siting of wind turbines has a significant impact on the overall efficiency and economic viability of wind farm,where the wake effect,wind speed,types of wind turbines,etc.,have an impact on the output power of the wind farm.To solve the optimization problem of wind farm layout under complex terrain conditions,this paper proposes wind turbine layout optimization using different types of wind turbines,the aim is to reduce the influence of the wake effect and maximize economic benefits.The linear wake model is used for wake flow calculation over complex terrain.Minimizing the unit energy cost is taken as the objective function,considering that the objective function is affected by cost and output power,which influence each other.The cost function includes construction cost,installation cost,maintenance cost,etc.Therefore,a bi-level constrained optimization model is established,in which the upper-level objective function is to minimize the unit energy cost,and the lower-level objective function is to maximize the output power.Then,a hybrid evolutionary algorithm is designed according to the characteristics of the decision variables.The improved genetic algorithm and differential evolution are used to optimize the upper-level and lower-level objective functions,respectively,these evolutionary operations search for the optimal solution as much as possible.Finally,taking the roughness of different terrain,wind farms of different scales and different types of wind turbines as research scenarios,the optimal deployment is solved by using the algorithm in this paper,and four algorithms are compared to verify the effectiveness of the proposed algorithm.展开更多
In this research work,the localized generation from renewable resources and the distribution of energy to agricultural loads,which is a local microgrid concept,have been considered,and its feasibility has been assesse...In this research work,the localized generation from renewable resources and the distribution of energy to agricultural loads,which is a local microgrid concept,have been considered,and its feasibility has been assessed.Two dispatch algorithms,named Cycle Charging and Load Following,are implemented to find the optimal solution(i.e.,net cost,operation cost,carbon emission.energy cost,component sizing,etc.)of the hybrid system.The microgrid is also modeled in the DIgSILENT Power Factory platform,and the respective power system responses are then evaluated.The development of dispatch algorithms specifically tailored for agricultural applications has enabled to dynamically manage energy flows,responding to fluctuating demands and resource availability in real-time.Through careful consideration of factors such as seasonal variations and irrigation requirements,these algorithms have enhanced the resilience and adaptability of the microgrid to dynamic operational conditions.However,it is revealed that both approaches have produced the same techno-economic results showing no significant difference.This illustrates the fact that the considered microgrid can be implemented with either strategy without significant fluctuation in performance.The study has shown that the harmful gas emission has also been limited to only 17,928 kg/year of CO_(2),and 77.7 kg/year of Sulfur Dioxide.For the proposed microgrid and load profile of 165.29 kWh/day,the net present cost is USD 718,279,and the cost of energy is USD 0.0463 with a renewable fraction of 97.6%.The optimal sizes for PV,Bio,Grid,Electrolyzer,and Converter are 1494,500,999,999,500,and 495 kW,respectively.For a hydrogen tank(HTank),the optimal size is found to be 350 kg.This research work provides critical insights into the techno-economic feasibility and environmental impact of integrating biomass-PV-hydrogen storage-Grid hybrid renewable microgrids into agricultural settings.展开更多
This paper introduces a hybrid multi-objective optimization algorithm,designated HMODESFO,which amalgamates the exploratory prowess of Differential Evolution(DE)with the rapid convergence attributes of the Sailfish Op...This paper introduces a hybrid multi-objective optimization algorithm,designated HMODESFO,which amalgamates the exploratory prowess of Differential Evolution(DE)with the rapid convergence attributes of the Sailfish Optimization(SFO)algorithm.The primary objective is to address multi-objective optimization challenges within mechanical engineering,with a specific emphasis on planetary gearbox optimization.The algorithm is equipped with the ability to dynamically select the optimal mutation operator,contingent upon an adaptive normalized population spacing parameter.The efficacy of HMODESFO has been substantiated through rigorous validation against estab-lished industry benchmarks,including a suite of Zitzler-Deb-Thiele(ZDT)and Zeb-Thiele-Laumanns-Zitzler(DTLZ)problems,where it exhibited superior performance.The outcomes underscore the algorithm’s markedly enhanced optimization capabilities relative to existing methods,particularly in tackling highly intricate multi-objective planetary gearbox optimization problems.Additionally,the performance of HMODESFO is evaluated against selected well-known mechanical engineering test problems,further accentuating its adeptness in resolving complex optimization challenges within this domain.展开更多
The shop scheduling problem with limited buffers has broad applications in real-world production scenarios,so this research direction is of great practical significance.However,there is currently little research on th...The shop scheduling problem with limited buffers has broad applications in real-world production scenarios,so this research direction is of great practical significance.However,there is currently little research on the hybrid flow shop scheduling problem with limited buffers(LBHFSP).This paper deeply investigates the LBHFSP to optimize the goal of the total completion time.To better solve the LBHFSP,a multi-level subpopulation-based particle swarm optimization algorithm(MLPSO)is proposed,which is founded on the attributes of the LBHFSP and the shortcomings of the basic PSO(particle swarm optimization)algorithm.In MLPSO,firstly,considering the impact of the limited buffers on the process of subsequent operations,a specific circular decoding strategy is developed to accommodate the characteristics of limited buffers.Secondly,an initialization strategy based on blocking time is designed to enhance the quality and diversity of the initial population.Afterward,a multi-level subpopulation collaborative search is developed to prevent being trapped in a local optimum and improve the global exploration capability.Additionally,a local search strategy based on the first blocked job is designed to enhance the MLPSO algorithm’s exploitation capability.Lastly,numerous experiments are carried out to test the performance of the proposed MLPSO by comparing it with classical intelligent optimization and popular algorithms in recent years.The results confirm that the proposed MLPSO has an outstanding performance when compared to other algorithms when solving LBHFSP.展开更多
The surface injection and production system(SIPS)is a critical component for effective injection and production processes in underground natural gas storage.As a vital channel,the rational design of the surface inject...The surface injection and production system(SIPS)is a critical component for effective injection and production processes in underground natural gas storage.As a vital channel,the rational design of the surface injection and production(SIP)pipeline significantly impacts efficiency.This paper focuses on the SIP pipeline and aims to minimize the investment costs of surface projects.An optimization model under harmonized injection and production conditions was constructed to transform the optimization problem of the SIP pipeline design parameters into a detailed analysis of the injection condition model and the production condition model.This paper proposes a hybrid genetic algorithm generalized reduced gradient(HGA-GRG)method,and compares it with the traditional genetic algorithm(GA)in a practical case study.The HGA-GRG demonstrated significant advantages in optimization outcomes,reducing the initial cost by 345.371×10^(4) CNY compared to the GA,validating the effectiveness of the model.By adjusting algorithm parameters,the optimal iterative results of the HGA-GRG were obtained,providing new research insights for the optimal design of a SIPS.展开更多
Agile earth observation satellites(AEOSs)represent a new generation of satellites with three degrees of freedom(pitch,roll,and yaw);they possess a long visible time window(VTW)for ground targets and support imaging at...Agile earth observation satellites(AEOSs)represent a new generation of satellites with three degrees of freedom(pitch,roll,and yaw);they possess a long visible time window(VTW)for ground targets and support imaging at any moment within the VTW.However,different observation times demonstrate different cloud cover distributions,which exhibit different effects on the AEOS observation.Previous studies ignored pitch angles,discretized VTWs,or fixed cloud cover for every VTW,which led to the loss of intermediate observation states,thus these studies are not suitable for AEOS scheduling considering cloud cover distribution.In this study,a relationship formula between the cloud cover and observation time is proposed to calculate the cloud cover for every observation time,and a relationship formula between the observation time and pitch angle is designed to calculate the pitch angle for every observation time in the VTW.A refined model including the pitch angle,roll angle,and cloud cover distribution is established,which can make the scheme closer to the actual application of AEOSs.A hybrid genetic simulated annealing(HGSA)algorithm for AEOS scheduling is proposed,which integrates the advantages of genetic and simulated annealing algorithms and can effectively avoid falling into a local optimal solution.The experiments are conducted to compare the proposed algorithm with the traditional algorithms,the results verify that the proposed model and algorithm are efficient and effective for AEOS scheduling considering cloud cover distribution.展开更多
Multi-label feature selection(MFS)is a crucial dimensionality reduction technique aimed at identifying informative features associated with multiple labels.However,traditional centralized methods face significant chal...Multi-label feature selection(MFS)is a crucial dimensionality reduction technique aimed at identifying informative features associated with multiple labels.However,traditional centralized methods face significant challenges in privacy-sensitive and distributed settings,often neglecting label dependencies and suffering from low computational efficiency.To address these issues,we introduce a novel framework,Fed-MFSDHBCPSO—federated MFS via dual-layer hybrid breeding cooperative particle swarm optimization algorithm with manifold and sparsity regularization(DHBCPSO-MSR).Leveraging the federated learning paradigm,Fed-MFSDHBCPSO allows clients to perform local feature selection(FS)using DHBCPSO-MSR.Locally selected feature subsets are encrypted with differential privacy(DP)and transmitted to a central server,where they are securely aggregated and refined through secure multi-party computation(SMPC)until global convergence is achieved.Within each client,DHBCPSO-MSR employs a dual-layer FS strategy.The inner layer constructs sample and label similarity graphs,generates Laplacian matrices to capture the manifold structure between samples and labels,and applies L2,1-norm regularization to sparsify the feature subset,yielding an optimized feature weight matrix.The outer layer uses a hybrid breeding cooperative particle swarm optimization algorithm to further refine the feature weight matrix and identify the optimal feature subset.The updated weight matrix is then fed back to the inner layer for further optimization.Comprehensive experiments on multiple real-world multi-label datasets demonstrate that Fed-MFSDHBCPSO consistently outperforms both centralized and federated baseline methods across several key evaluation metrics.展开更多
In order to address environmental pollution and resource depletion caused by traditional power generation,this paper proposes an adaptive iterative dynamic-balance optimization algorithm that integrates the Improved D...In order to address environmental pollution and resource depletion caused by traditional power generation,this paper proposes an adaptive iterative dynamic-balance optimization algorithm that integrates the Improved Dung Beetle Optimizer(IDBO)with VariationalMode Decomposition(VMD).The IDBO-VMD method is designed to enhance the accuracy and efficiency of wind-speed time-series decomposition and to effectively smooth photovoltaic power fluctuations.This study innovatively improves the traditional variational mode decomposition(VMD)algorithm,and significantly improves the accuracy and adaptive ability of signal decomposition by IDBO selfoptimization of key parameters K and a.On this basis,Fourier transform technology is used to define the boundary point between high frequency and low frequency signals,and a targeted energy distribution strategy is proposed:high frequency fluctuations are allocated to supercapacitors to quickly respond to transient power fluctuations;Lowfrequency components are distributed to lead-carbon batteries,optimizing long-term energy storage and scheduling efficiency.This strategy effectively improves the response speed and stability of the energy storage system.The experimental results demonstrate that the IDBO-VMD algorithm markedly outperforms traditional methods in both decomposition accuracy and computational efficiency.Specifically,it effectively reduces the charge–discharge frequency of the battery,prolongs battery life,and optimizes the operating ranges of the state-of-charge(SOC)for both leadcarbon batteries and supercapacitors.In addition,the energy management strategy based on the algorithm not only improves the overall energy utilization efficiency of the system,but also shows excellent performance in the dynamic management and intelligent scheduling of renewable energy generation.展开更多
The intelligent optimization of a multi-objective evolutionary algorithm is combined with a gradient algorithm. The hybrid multi-objective gradient algorithm is framed by the real number. Test functions are used to an...The intelligent optimization of a multi-objective evolutionary algorithm is combined with a gradient algorithm. The hybrid multi-objective gradient algorithm is framed by the real number. Test functions are used to analyze the efficiency of the algorithm. In the simulation case of the water phantom, the algorithm is applied to an inverse planning process of intensity modulated radiation treatment （IMRT）. The objective functions of planning target volume （PTV） and normal tissue （NT） are based on the average dose distribution. The obtained intensity profile shows that the hybrid multi-objective gradient algorithm saves the computational time and has good accuracy, thus meeting the requirements of practical applications.展开更多
To improve performances of multi-objective optimization algorithms, such as convergence and diversity, a hybridization- encouraged mechanism is proposed and realized in elitist nondominated sorting genetic algorithm ...To improve performances of multi-objective optimization algorithms, such as convergence and diversity, a hybridization- encouraged mechanism is proposed and realized in elitist nondominated sorting genetic algorithm （NSGA-Ⅱ）. This mechanism uses the normalized distance to evaluate the difference among genes in a population. Three possible modes of crossover operators--＂Max Distance＂, ＂Min-Max Distance＂, and ＂Neighboring-Max＂--are suggested and analyzed. The mode of ＂Neighboring-Max＂, which not only takes advantage of hybridization but also improves the distribution of the population near Pareto optimal front, is chosen and used in NSGA-Ⅱ on the basis of hybridization-encouraged mechanism （short for HEM-based NSGA-Ⅱ）. To prove the HEM-based algorithm, several problems are studied by using standard NSGA-Ⅱ and the presented method. Different evaluation criteria are also used to judge these algorithms in terms of distribution of solutions, convergence, diversity, and quality of solutions. The numerical results indicate that the application of hybridization-encouraged mechanism could effectively improve the performances of genetic algorithm. Finally, as an example in engineering practices, the presented method is used to design a longitudinal flight control system, which demonstrates the obtainability of a reasonable and correct Pareto front.展开更多
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 hybr...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.展开更多
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...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.展开更多
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...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,展开更多
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 inclu...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.展开更多
基金supported by the National Natural Science Foundation of China(Grant Number 61573264).
文摘As a complicated optimization problem,parallel batch processing machines scheduling problem(PBPMSP)exists in many real-life manufacturing industries such as textiles and semiconductors.Machine eligibility means that at least one machine is not eligible for at least one job.PBPMSP and scheduling problems with machine eligibility are frequently considered;however,PBPMSP with machine eligibility is seldom explored.This study investigates PBPMSP with machine eligibility in fabric dyeing and presents a novel shuffled frog-leaping algorithm with competition(CSFLA)to minimize makespan.In CSFLA,the initial population is produced in a heuristic and random way,and the competitive search of memeplexes comprises two phases.Competition between any two memeplexes is done in the first phase,then iteration times are adjusted based on competition,and search strategies are adjusted adaptively based on the evolution quality of memeplexes in the second phase.An adaptive population shuffling is given.Computational experiments are conducted on 100 instances.The computational results showed that the new strategies of CSFLA are effective and that CSFLA has promising advantages in solving the considered PBPMSP.
文摘Fabric dyeing is a critical production process in the clothing industry and heavily relies on batch processing machines(BPM).In this study,the parallel BPM scheduling problem with machine eligibility in fabric dyeing is considered,and an adaptive cooperated shuffled frog-leaping algorithm(ACSFLA)is proposed to minimize makespan and total tardiness simultaneously.ACSFLA determines the search times for each memeplex based on its quality,with more searches in high-quality memeplexes.An adaptive cooperated and diversified search mechanism is applied,dynamically adjusting search strategies for each memeplex based on their dominance relationships and quality.During the cooperated search,ACSFLA uses a segmented and dynamic targeted search approach,while in non-cooperated scenarios,the search focuses on local search around superior solutions to improve efficiency.Furthermore,ACSFLA employs adaptive population division and partial population shuffling strategies.Through these strategies,memeplexes with low evolutionary potential are selected for reconstruction in the next generation,while thosewithhighevolutionarypotential are retained to continue their evolution.Toevaluate the performance of ACSFLA,comparative experiments were conducted using ACSFLA,SFLA,ASFLA,MOABC,and NSGA-CC in 90 instances.The computational results reveal that ACSFLA outperforms the other algorithms in 78 of the 90 test cases,highlighting its advantages in solving the parallel BPM scheduling problem with machine eligibility.
基金supported by the National Natural Science Foundation of China(No.41374123)
文摘At present, near-surface shear wave velocities are mainly calculated through Rayleigh wave dispersion-curve inversions in engineering surface investigations, but the required calculations pose a highly nonlinear global optimization problem. In order to alleviate the risk of falling into a local optimal solution, this paper introduces a new global optimization method, the shuffle frog-leaping algorithm （SFLA）, into the Rayleigh wave dispersion-curve inversion process. SFLA is a swarm-intelligence-based algorithm that simulates a group of frogs searching for food. It uses a few parameters, achieves rapid convergence, and is capability of effective global searching. In order to test the reliability and calculation performance of SFLA, noise-free and noisy synthetic datasets were inverted. We conducted a comparative analysis with other established algorithms using the noise-free dataset, and then tested the ability of SFLA to cope with data noise. Finally, we inverted a real-world example to examine the applicability of SFLA. Results from both synthetic and field data demonstrated the effectiveness of SFLA in the interpretation of Rayleigh wave dispersion curves. We found that SFLA is superior to the established methods in terms of both reliability and computational efficiency, so it offers great potential to improve our ability to solve geophysical inversion problems.
基金This research was supported by a grant from the Research Center of the Center for Female Scientific and Medical Colleges Deanship of Scientific Research,King Saud University.
文摘In recent years,the volume of information in digital form has increased tremendously owing to the increased popularity of the World Wide Web.As a result,the use of techniques for extracting useful information from large collections of data,and particularly documents,has become more necessary and challenging.Text clustering is such a technique;it consists in dividing a set of text documents into clusters(groups),so that documents within the same cluster are closely related,whereas documents in different clusters are as different as possible.Clustering depends on measuring the content(i.e.,words)of a document in terms of relevance.Nevertheless,as documents usually contain a large number of words,some of them may be irrelevant to the topic under consideration or redundant.This can confuse and complicate the clustering process and make it less accurate.Accordingly,feature selection methods have been employed to reduce data dimensionality by selecting the most relevant features.In this study,we developed a text document clustering optimization model using a novel genetic frog-leaping algorithm that efficiently clusters text documents based on selected features.The proposed approach is based on two metaheuristic algorithms:a genetic algorithm(GA)and a shuffled frog-leaping algorithm(SFLA).The GA performs feature selection,and the SFLA performs clustering.To evaluate its effectiveness,the proposed approach was tested on a well-known text document dataset:the“20Newsgroup”dataset from the University of California Irvine Machine Learning Repository.Overall,after multiple experiments were compared and analyzed,it was demonstrated that using the proposed algorithm on the 20Newsgroup dataset greatly facilitated text document clustering,compared with classical K-means clustering.Nevertheless,this improvement requires longer computational time.
基金received funding from the Postgraduate Research&Practice Innovation Program of Jiangsu Province(SJCX23_1633)2023 University Student Innovation and Entrepreneurship Training Program(202311463009Z)+1 种基金Changzhou Science and Technology Support Project(CE20235045)Open Project of Jiangsu Key Laboratory of Power Transmission&Distribution Equipment Technology(2021JSSPD12).
文摘Uneven power distribution,transient voltage,and frequency deviations are observed in the photovoltaic storage hybrid inverter during the switching between grid-connected and island modes.In response to these issues,this paper proposes a grid-connected/island switching control strategy for photovoltaic storage hybrid inverters based on the modified chimpanzee optimization algorithm.The proposed strategy incorporates coupling compensation and power differentiation elements based on the traditional droop control.Then,it combines the angular frequency and voltage amplitude adjustments provided by the phase-locked loop-free pre-synchronization control strategy.Precise pre-synchronization is achieved by regulating the virtual current to zero and aligning the photovoltaic storage hybrid inverter with the grid voltage.Additionally,two novel operators,learning and emotional behaviors are introduced to enhance the optimization precision of the chimpanzee algorithm.These operators ensure high-precision and high-reliability optimization of the droop control parameters for photovoltaic storage hybrid inverters.A Simulink model was constructed for simulation analysis,which validated the optimized control strategy’s ability to evenly distribute power under load transients.This strategy effectively mitigated transient voltage and current surges during mode transitions.Consequently,seamless and efficient switching between gridconnected and island modes was achieved for the photovoltaic storage hybrid inverter.The enhanced energy utilization efficiency,in turn,offers robust technical support for grid stability.
基金funded by the National Key Research and Development Program(Grant No.2022YFB3706904).
文摘Thetraditional first-order reliability method(FORM)often encounters challengeswith non-convergence of results or excessive calculation when analyzing complex engineering problems.To improve the global convergence speed of structural reliability analysis,an improved coati optimization algorithm(COA)is proposed in this paper.In this study,the social learning strategy is used to improve the coati optimization algorithm(SL-COA),which improves the convergence speed and robustness of the newheuristic optimization algorithm.Then,the SL-COAis comparedwith the latest heuristic optimization algorithms such as the original COA,whale optimization algorithm(WOA),and osprey optimization algorithm(OOA)in the CEC2005 and CEC2017 test function sets and two engineering optimization design examples.The optimization results show that the proposed SL-COA algorithm has a high competitiveness.Secondly,this study introduces the SL-COA algorithm into the MPP(Most Probable Point)search process based on FORM and constructs a new reliability analysis method.Finally,the proposed reliability analysis method is verified by four mathematical examples and two engineering examples.The results show that the proposed SL-COA-assisted FORM exhibits fast convergence and avoids premature convergence to local optima as demonstrated by its successful application to problems such as composite cylinder design and support bracket analysis.
基金supported by the National Natural Science Foundation of China[Grant No.12461035]Qinghai University Students Innovative Training Program Project[2024-QX-57].
文摘Wind farm layout optimization is a critical challenge in renewable energy development,especially in regions with complex terrain.Micro-siting of wind turbines has a significant impact on the overall efficiency and economic viability of wind farm,where the wake effect,wind speed,types of wind turbines,etc.,have an impact on the output power of the wind farm.To solve the optimization problem of wind farm layout under complex terrain conditions,this paper proposes wind turbine layout optimization using different types of wind turbines,the aim is to reduce the influence of the wake effect and maximize economic benefits.The linear wake model is used for wake flow calculation over complex terrain.Minimizing the unit energy cost is taken as the objective function,considering that the objective function is affected by cost and output power,which influence each other.The cost function includes construction cost,installation cost,maintenance cost,etc.Therefore,a bi-level constrained optimization model is established,in which the upper-level objective function is to minimize the unit energy cost,and the lower-level objective function is to maximize the output power.Then,a hybrid evolutionary algorithm is designed according to the characteristics of the decision variables.The improved genetic algorithm and differential evolution are used to optimize the upper-level and lower-level objective functions,respectively,these evolutionary operations search for the optimal solution as much as possible.Finally,taking the roughness of different terrain,wind farms of different scales and different types of wind turbines as research scenarios,the optimal deployment is solved by using the algorithm in this paper,and four algorithms are compared to verify the effectiveness of the proposed algorithm.
基金financed by the Ministry of Science and Technology(MOST)Bangladesh under Special Research grant for the FY 2023-24(SRG 232410)Further,the authors extend their appreciation to the Deanship of Scientific Research at Northern Border University,Arar,Saudi Arabi for funding this research work through the project number“NBU-FFR-2025-3623-05”。
文摘In this research work,the localized generation from renewable resources and the distribution of energy to agricultural loads,which is a local microgrid concept,have been considered,and its feasibility has been assessed.Two dispatch algorithms,named Cycle Charging and Load Following,are implemented to find the optimal solution(i.e.,net cost,operation cost,carbon emission.energy cost,component sizing,etc.)of the hybrid system.The microgrid is also modeled in the DIgSILENT Power Factory platform,and the respective power system responses are then evaluated.The development of dispatch algorithms specifically tailored for agricultural applications has enabled to dynamically manage energy flows,responding to fluctuating demands and resource availability in real-time.Through careful consideration of factors such as seasonal variations and irrigation requirements,these algorithms have enhanced the resilience and adaptability of the microgrid to dynamic operational conditions.However,it is revealed that both approaches have produced the same techno-economic results showing no significant difference.This illustrates the fact that the considered microgrid can be implemented with either strategy without significant fluctuation in performance.The study has shown that the harmful gas emission has also been limited to only 17,928 kg/year of CO_(2),and 77.7 kg/year of Sulfur Dioxide.For the proposed microgrid and load profile of 165.29 kWh/day,the net present cost is USD 718,279,and the cost of energy is USD 0.0463 with a renewable fraction of 97.6%.The optimal sizes for PV,Bio,Grid,Electrolyzer,and Converter are 1494,500,999,999,500,and 495 kW,respectively.For a hydrogen tank(HTank),the optimal size is found to be 350 kg.This research work provides critical insights into the techno-economic feasibility and environmental impact of integrating biomass-PV-hydrogen storage-Grid hybrid renewable microgrids into agricultural settings.
基金supported by the Serbian Ministry of Education and Science under Grant No.TR35006 and COST Action:CA23155—A Pan-European Network of Ocean Tribology(OTC)The research of B.Rosic and M.Rosic was supported by the Serbian Ministry of Education and Science under Grant TR35029.
文摘This paper introduces a hybrid multi-objective optimization algorithm,designated HMODESFO,which amalgamates the exploratory prowess of Differential Evolution(DE)with the rapid convergence attributes of the Sailfish Optimization(SFO)algorithm.The primary objective is to address multi-objective optimization challenges within mechanical engineering,with a specific emphasis on planetary gearbox optimization.The algorithm is equipped with the ability to dynamically select the optimal mutation operator,contingent upon an adaptive normalized population spacing parameter.The efficacy of HMODESFO has been substantiated through rigorous validation against estab-lished industry benchmarks,including a suite of Zitzler-Deb-Thiele(ZDT)and Zeb-Thiele-Laumanns-Zitzler(DTLZ)problems,where it exhibited superior performance.The outcomes underscore the algorithm’s markedly enhanced optimization capabilities relative to existing methods,particularly in tackling highly intricate multi-objective planetary gearbox optimization problems.Additionally,the performance of HMODESFO is evaluated against selected well-known mechanical engineering test problems,further accentuating its adeptness in resolving complex optimization challenges within this domain.
基金supported in part by the National Natural Science Foundation of China under Grant No.52175490.
文摘The shop scheduling problem with limited buffers has broad applications in real-world production scenarios,so this research direction is of great practical significance.However,there is currently little research on the hybrid flow shop scheduling problem with limited buffers(LBHFSP).This paper deeply investigates the LBHFSP to optimize the goal of the total completion time.To better solve the LBHFSP,a multi-level subpopulation-based particle swarm optimization algorithm(MLPSO)is proposed,which is founded on the attributes of the LBHFSP and the shortcomings of the basic PSO(particle swarm optimization)algorithm.In MLPSO,firstly,considering the impact of the limited buffers on the process of subsequent operations,a specific circular decoding strategy is developed to accommodate the characteristics of limited buffers.Secondly,an initialization strategy based on blocking time is designed to enhance the quality and diversity of the initial population.Afterward,a multi-level subpopulation collaborative search is developed to prevent being trapped in a local optimum and improve the global exploration capability.Additionally,a local search strategy based on the first blocked job is designed to enhance the MLPSO algorithm’s exploitation capability.Lastly,numerous experiments are carried out to test the performance of the proposed MLPSO by comparing it with classical intelligent optimization and popular algorithms in recent years.The results confirm that the proposed MLPSO has an outstanding performance when compared to other algorithms when solving LBHFSP.
基金the National Natural Science Foundation of China,grant numbers 51704253 and 52474084.
文摘The surface injection and production system(SIPS)is a critical component for effective injection and production processes in underground natural gas storage.As a vital channel,the rational design of the surface injection and production(SIP)pipeline significantly impacts efficiency.This paper focuses on the SIP pipeline and aims to minimize the investment costs of surface projects.An optimization model under harmonized injection and production conditions was constructed to transform the optimization problem of the SIP pipeline design parameters into a detailed analysis of the injection condition model and the production condition model.This paper proposes a hybrid genetic algorithm generalized reduced gradient(HGA-GRG)method,and compares it with the traditional genetic algorithm(GA)in a practical case study.The HGA-GRG demonstrated significant advantages in optimization outcomes,reducing the initial cost by 345.371×10^(4) CNY compared to the GA,validating the effectiveness of the model.By adjusting algorithm parameters,the optimal iterative results of the HGA-GRG were obtained,providing new research insights for the optimal design of a SIPS.
基金supported by the National Natural Science Foundation of China(72071064,72271074,72001004)the Anhui Provincial Natural Science Foundation(2408085QG221).
文摘Agile earth observation satellites(AEOSs)represent a new generation of satellites with three degrees of freedom(pitch,roll,and yaw);they possess a long visible time window(VTW)for ground targets and support imaging at any moment within the VTW.However,different observation times demonstrate different cloud cover distributions,which exhibit different effects on the AEOS observation.Previous studies ignored pitch angles,discretized VTWs,or fixed cloud cover for every VTW,which led to the loss of intermediate observation states,thus these studies are not suitable for AEOS scheduling considering cloud cover distribution.In this study,a relationship formula between the cloud cover and observation time is proposed to calculate the cloud cover for every observation time,and a relationship formula between the observation time and pitch angle is designed to calculate the pitch angle for every observation time in the VTW.A refined model including the pitch angle,roll angle,and cloud cover distribution is established,which can make the scheme closer to the actual application of AEOSs.A hybrid genetic simulated annealing(HGSA)algorithm for AEOS scheduling is proposed,which integrates the advantages of genetic and simulated annealing algorithms and can effectively avoid falling into a local optimal solution.The experiments are conducted to compare the proposed algorithm with the traditional algorithms,the results verify that the proposed model and algorithm are efficient and effective for AEOS scheduling considering cloud cover distribution.
文摘Multi-label feature selection(MFS)is a crucial dimensionality reduction technique aimed at identifying informative features associated with multiple labels.However,traditional centralized methods face significant challenges in privacy-sensitive and distributed settings,often neglecting label dependencies and suffering from low computational efficiency.To address these issues,we introduce a novel framework,Fed-MFSDHBCPSO—federated MFS via dual-layer hybrid breeding cooperative particle swarm optimization algorithm with manifold and sparsity regularization(DHBCPSO-MSR).Leveraging the federated learning paradigm,Fed-MFSDHBCPSO allows clients to perform local feature selection(FS)using DHBCPSO-MSR.Locally selected feature subsets are encrypted with differential privacy(DP)and transmitted to a central server,where they are securely aggregated and refined through secure multi-party computation(SMPC)until global convergence is achieved.Within each client,DHBCPSO-MSR employs a dual-layer FS strategy.The inner layer constructs sample and label similarity graphs,generates Laplacian matrices to capture the manifold structure between samples and labels,and applies L2,1-norm regularization to sparsify the feature subset,yielding an optimized feature weight matrix.The outer layer uses a hybrid breeding cooperative particle swarm optimization algorithm to further refine the feature weight matrix and identify the optimal feature subset.The updated weight matrix is then fed back to the inner layer for further optimization.Comprehensive experiments on multiple real-world multi-label datasets demonstrate that Fed-MFSDHBCPSO consistently outperforms both centralized and federated baseline methods across several key evaluation metrics.
基金funded by the Institute of Smart Energy,Huaiyin Institute of Technology,under Grant No.HIT-ISE-2024-07.
文摘In order to address environmental pollution and resource depletion caused by traditional power generation,this paper proposes an adaptive iterative dynamic-balance optimization algorithm that integrates the Improved Dung Beetle Optimizer(IDBO)with VariationalMode Decomposition(VMD).The IDBO-VMD method is designed to enhance the accuracy and efficiency of wind-speed time-series decomposition and to effectively smooth photovoltaic power fluctuations.This study innovatively improves the traditional variational mode decomposition(VMD)algorithm,and significantly improves the accuracy and adaptive ability of signal decomposition by IDBO selfoptimization of key parameters K and a.On this basis,Fourier transform technology is used to define the boundary point between high frequency and low frequency signals,and a targeted energy distribution strategy is proposed:high frequency fluctuations are allocated to supercapacitors to quickly respond to transient power fluctuations;Lowfrequency components are distributed to lead-carbon batteries,optimizing long-term energy storage and scheduling efficiency.This strategy effectively improves the response speed and stability of the energy storage system.The experimental results demonstrate that the IDBO-VMD algorithm markedly outperforms traditional methods in both decomposition accuracy and computational efficiency.Specifically,it effectively reduces the charge–discharge frequency of the battery,prolongs battery life,and optimizes the operating ranges of the state-of-charge(SOC)for both leadcarbon batteries and supercapacitors.In addition,the energy management strategy based on the algorithm not only improves the overall energy utilization efficiency of the system,but also shows excellent performance in the dynamic management and intelligent scheduling of renewable energy generation.
基金Supported by the National Basic Research Program of China ("973" Program)the National Natural Science Foundation of China (60872112, 10805012)+1 种基金the Natural Science Foundation of Zhejiang Province(Z207588)the College Science Research Project of Anhui Province (KJ2008B268)~~
文摘The intelligent optimization of a multi-objective evolutionary algorithm is combined with a gradient algorithm. The hybrid multi-objective gradient algorithm is framed by the real number. Test functions are used to analyze the efficiency of the algorithm. In the simulation case of the water phantom, the algorithm is applied to an inverse planning process of intensity modulated radiation treatment （IMRT）. The objective functions of planning target volume （PTV） and normal tissue （NT） are based on the average dose distribution. The obtained intensity profile shows that the hybrid multi-objective gradient algorithm saves the computational time and has good accuracy, thus meeting the requirements of practical applications.
基金National Basic Research Program of China(5132004)
文摘To improve performances of multi-objective optimization algorithms, such as convergence and diversity, a hybridization- encouraged mechanism is proposed and realized in elitist nondominated sorting genetic algorithm （NSGA-Ⅱ）. This mechanism uses the normalized distance to evaluate the difference among genes in a population. Three possible modes of crossover operators--＂Max Distance＂, ＂Min-Max Distance＂, and ＂Neighboring-Max＂--are suggested and analyzed. The mode of ＂Neighboring-Max＂, which not only takes advantage of hybridization but also improves the distribution of the population near Pareto optimal front, is chosen and used in NSGA-Ⅱ on the basis of hybridization-encouraged mechanism （short for HEM-based NSGA-Ⅱ）. To prove the HEM-based algorithm, several problems are studied by using standard NSGA-Ⅱ and the presented method. Different evaluation criteria are also used to judge these algorithms in terms of distribution of solutions, convergence, diversity, and quality of solutions. The numerical results indicate that the application of hybridization-encouraged mechanism could effectively improve the performances of genetic algorithm. Finally, as an example in engineering practices, the presented method is used to design a longitudinal flight control system, which demonstrates the obtainability of a reasonable and correct Pareto front.
基金The project supported by the National Natural Science Foundation of China (10472025)
文摘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.
基金Project supported by the National Natural Science Foundation of China(Grant No.61571348)the Equipment Pre-Research Foundation of China(Grant No.61405180202)
文摘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.
文摘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,
基金The NSF(11071053)of ChinaNatural Science Basic Research Plan(2014JM2-1003)in Shaanxi Province of ChinaScientific Research Project(YD2016-12)of Yan’an University
文摘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.
