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 sys...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.展开更多
Throughout this paper, we introduce a new hybrid iterative algorithm for finding a common element of the set of common fixed points of a finite family of uniformly asymptotically nonexpansive semigroups and the set of...Throughout this paper, we introduce a new hybrid iterative algorithm for finding a common element of the set of common fixed points of a finite family of uniformly asymptotically nonexpansive semigroups and the set of solutions of an equilibrium problem in the framework of Hilbert spaces. We then prove the strong convergence theorem with respect to the proposed iterative algorithm. Our results in this paper extend and improve some recent known results.展开更多
In this study,We propose a compensated distributed adaptive learning algorithm for heterogeneous multi-agent systems with repetitive motion,where the leader's dynamics are unknown,and the controlled system's p...In this study,We propose a compensated distributed adaptive learning algorithm for heterogeneous multi-agent systems with repetitive motion,where the leader's dynamics are unknown,and the controlled system's parameters are uncertain.The multiagent systems are considered a kind of hybrid order nonlinear systems,which relaxes the strict requirement that all agents are of the same order in some existing work.For theoretical analyses,we design a composite energy function with virtual gain parameters to reduce the restriction that the controller gain depends on global information.Considering the stability of the controller,we introduce a smooth continuous function to improve the piecewise controller to avoid possible chattering.Theoretical analyses prove the convergence of the presented algorithm,and simulation experiments verify the effectiveness of the algorithm.展开更多
Purpose-In this paper,a newly proposed hybridization algorithm namely constriction coefficient-based particle swarm optimization and gravitational search algorithm(CPSOGSA)has been employed for training MLP to overcom...Purpose-In this paper,a newly proposed hybridization algorithm namely constriction coefficient-based particle swarm optimization and gravitational search algorithm(CPSOGSA)has been employed for training MLP to overcome sensitivity to initialization,premature convergence,and stagnation in local optima problems of MLP.Design/methodology/approach-In this study,the exploration of the search space is carried out by gravitational search algorithm(GSA)and optimization of candidate solutions,i.e.exploitation is performed by particle swarm optimization(PSO).For training the multi-layer perceptron(MLP),CPSOGSA uses sigmoid fitness function for finding the proper combination of connection weights and neural biases to minimize the error.Secondly,a matrix encoding strategy is utilized for providing one to one correspondence between weights and biases of MLP and agents of CPSOGSA.Findings-The experimental findings convey that CPSOGSA is a better MLP trainer as compared to other stochastic algorithms because it provides superior results in terms of resolving stagnation in local optima and convergence speed problems.Besides,it gives the best results for breast cancer,heart,sine function and sigmoid function datasets as compared to other participating algorithms.Moreover,CPSOGSA also provides very competitive results for other datasets.Originality/value-The CPSOGSA performed effectively in overcoming stagnation in local optima problem and increasing the overall convergence speed of MLP.Basically,CPSOGSA is a hybrid optimization algorithm which has powerful characteristics of global exploration capability and high local exploitation power.In the research literature,a little work is available where CPSO and GSA have been utilized for training MLP.The only related research paper was given by Mirjalili et al.,in 2012.They have used standard PSO and GSA for training simple FNNs.However,the work employed only three datasets and used the MSE performance metric for evaluating the efficiency of the algorithms.In this paper,eight different standard datasets and five performance metrics have been utilized for investigating the efficiency of CPSOGSA in training MLPs.In addition,a non-parametric pair-wise statistical test namely the Wilcoxon rank-sum test has been carried out at a 5%significance level to statistically validate the simulation results.Besides,eight state-of-the-art metaheuristic algorithms were employed for comparative analysis of the experimental results to further raise the authenticity of the experimental setup.展开更多
As structure buckling problems easily arise when supercavitating projectiles operate with high underwater velocity, it is necessary to perform structure buckling reliability analysis. Now it is widely known that proba...As structure buckling problems easily arise when supercavitating projectiles operate with high underwater velocity, it is necessary to perform structure buckling reliability analysis. Now it is widely known that probabilistic and non-probabilistic uncertain information exists in engineering analysis. Based on reliability comprehensive index of multi-ellipsoid convex set, probabilistic uncertain information is added and transferred into non-probabilistic interval variable. The hybrid reliability is calculated by a combined method of modified limit step length iteration algorithm(MLSLIA) and Monte-Carlo method. The results of engineering examples show that the convergence of MLSLIA is better than that of limit step length iteration algorithm(LSLIA). Structure buckling hybrid reliability increases with the increase of ratio of base diameter to cavitator diameter, and decreases with the increase of initial launch velocity. Also the changes of uncertain degree of projectile velocity and cavitator drag coefficient affect structure buckling hybrid reliability index obviously. Therefore, uncertain degree of projectile velocity and cavitator drag coefficient should be controlled in project for high structure buckling reliability.展开更多
The distributed hybrid flow shop scheduling problem(DHFSP),which integrates distributed manufacturing models with parallel machines,has gained significant attention.However,in actual scheduling,some adjacent machines ...The distributed hybrid flow shop scheduling problem(DHFSP),which integrates distributed manufacturing models with parallel machines,has gained significant attention.However,in actual scheduling,some adjacent machines do not have buffers between them,resulting in blocking.This paper focuses on addressing the DHFSP with blocking constraints(DBHFSP)based on the actual production conditions.To solve DBHFSP,we construct a mixed integer linear programming(MILP)model for DBHFSP and validate its correctness using the Gurobi solver.Then,an advanced iterated greedy(AIG)algorithm is designed to minimize the makespan,in which we modify the Nawaz,Enscore,and Ham(NEH)heuristic to solve blocking constraints.To balance the global and local search capabilities of AIG,two effective inter-factory neighborhood search strategies and a swap-based local search strategy are designed.Additionally,each factory is mutually independent,and the movement within one factory does not affect the others.In view of this,we specifically designed a memory-based decoding method for insertion operations to reduce the computation time of the objective.Finally,two shaking strategies are incorporated into the algorithm to mitigate premature convergence.Five advanced algorithms are used to conduct comparative experiments with AIG on 80 test instances,and experimental results illustrate that the makespan and the relative percentage increase(RPI)obtained by AIG are 1.0%and 86.1%,respectively,better than the comparative algorithms.展开更多
The hybrid flow shop group scheduling problem(HFGSP)with the delivery time windows has been widely studied owing to its better flexibility and suitability for the current just-in-time production mode.However,there are...The hybrid flow shop group scheduling problem(HFGSP)with the delivery time windows has been widely studied owing to its better flexibility and suitability for the current just-in-time production mode.However,there are several unresolved challenges in problem modeling and algorithmic design tailored for HFGSP.In our study,we place emphasis on the constraint of timeliness.Therefore,this paper first constructs a mixed integer linear programming model of HFGSP with sequence-dependent setup time and delivery time windows to minimize the total weighted earliness and tardiness(TWET).Then a penalty groups-assisted iterated greedy integrating idle time insertion(PG IG ITI)is proposed to solve the above problem.In the PG IG ITI,a double decoding strategy is proposed based on the earliest available machine rule and the idle time insertion rule to calculate the TWET value.Subsequently,to reduce the amount of computation,a skip-based destruction and reconstruction strategy is designed,and a penalty groups-assisted local search is proposed to further improve the quality of the solution by disturbing the penalized groups,i.e.,early and tardy groups.Finally,through comprehensive statistical experiments on 270 test instances,the results prove that the proposed algorithm is effective compared to four state-of-the-art algorithms.展开更多
基金supported by the National Natural Science Foundation of China(61273070,61203092)the Enterprise-college-institute Cooperative Project of Jiangsu Province(BY2015019-21)+1 种基金111 Project(B12018)the Fun-damental Research Funds for the Central Universities(JUSRP51733B)
文摘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.
文摘Throughout this paper, we introduce a new hybrid iterative algorithm for finding a common element of the set of common fixed points of a finite family of uniformly asymptotically nonexpansive semigroups and the set of solutions of an equilibrium problem in the framework of Hilbert spaces. We then prove the strong convergence theorem with respect to the proposed iterative algorithm. Our results in this paper extend and improve some recent known results.
基金the National Natural Science Foundation of China(Grant Nos.62203342,62073254,92271101,62106186,and 62103136)the Fundamental Research Funds for the Central Universities(Grant Nos.XJS220704,QTZX23003,and ZYTS23046)+1 种基金the Project Funded by China Postdoctoral Science Foundation(Grant No.2022M712489)the Natural Science Basic Research Program of Shaanxi(Grant No.2023-JC-YB-585)。
文摘In this study,We propose a compensated distributed adaptive learning algorithm for heterogeneous multi-agent systems with repetitive motion,where the leader's dynamics are unknown,and the controlled system's parameters are uncertain.The multiagent systems are considered a kind of hybrid order nonlinear systems,which relaxes the strict requirement that all agents are of the same order in some existing work.For theoretical analyses,we design a composite energy function with virtual gain parameters to reduce the restriction that the controller gain depends on global information.Considering the stability of the controller,we introduce a smooth continuous function to improve the piecewise controller to avoid possible chattering.Theoretical analyses prove the convergence of the presented algorithm,and simulation experiments verify the effectiveness of the algorithm.
文摘Purpose-In this paper,a newly proposed hybridization algorithm namely constriction coefficient-based particle swarm optimization and gravitational search algorithm(CPSOGSA)has been employed for training MLP to overcome sensitivity to initialization,premature convergence,and stagnation in local optima problems of MLP.Design/methodology/approach-In this study,the exploration of the search space is carried out by gravitational search algorithm(GSA)and optimization of candidate solutions,i.e.exploitation is performed by particle swarm optimization(PSO).For training the multi-layer perceptron(MLP),CPSOGSA uses sigmoid fitness function for finding the proper combination of connection weights and neural biases to minimize the error.Secondly,a matrix encoding strategy is utilized for providing one to one correspondence between weights and biases of MLP and agents of CPSOGSA.Findings-The experimental findings convey that CPSOGSA is a better MLP trainer as compared to other stochastic algorithms because it provides superior results in terms of resolving stagnation in local optima and convergence speed problems.Besides,it gives the best results for breast cancer,heart,sine function and sigmoid function datasets as compared to other participating algorithms.Moreover,CPSOGSA also provides very competitive results for other datasets.Originality/value-The CPSOGSA performed effectively in overcoming stagnation in local optima problem and increasing the overall convergence speed of MLP.Basically,CPSOGSA is a hybrid optimization algorithm which has powerful characteristics of global exploration capability and high local exploitation power.In the research literature,a little work is available where CPSO and GSA have been utilized for training MLP.The only related research paper was given by Mirjalili et al.,in 2012.They have used standard PSO and GSA for training simple FNNs.However,the work employed only three datasets and used the MSE performance metric for evaluating the efficiency of the algorithms.In this paper,eight different standard datasets and five performance metrics have been utilized for investigating the efficiency of CPSOGSA in training MLPs.In addition,a non-parametric pair-wise statistical test namely the Wilcoxon rank-sum test has been carried out at a 5%significance level to statistically validate the simulation results.Besides,eight state-of-the-art metaheuristic algorithms were employed for comparative analysis of the experimental results to further raise the authenticity of the experimental setup.
基金the National Natural Science Foundation of China(No.51305421)the National Defense Technology Basis Research Project(No.JSZL2014130B005)the Development of Science and Technology Project of Jilin Province(No.20140520137JH)
文摘As structure buckling problems easily arise when supercavitating projectiles operate with high underwater velocity, it is necessary to perform structure buckling reliability analysis. Now it is widely known that probabilistic and non-probabilistic uncertain information exists in engineering analysis. Based on reliability comprehensive index of multi-ellipsoid convex set, probabilistic uncertain information is added and transferred into non-probabilistic interval variable. The hybrid reliability is calculated by a combined method of modified limit step length iteration algorithm(MLSLIA) and Monte-Carlo method. The results of engineering examples show that the convergence of MLSLIA is better than that of limit step length iteration algorithm(LSLIA). Structure buckling hybrid reliability increases with the increase of ratio of base diameter to cavitator diameter, and decreases with the increase of initial launch velocity. Also the changes of uncertain degree of projectile velocity and cavitator drag coefficient affect structure buckling hybrid reliability index obviously. Therefore, uncertain degree of projectile velocity and cavitator drag coefficient should be controlled in project for high structure buckling reliability.
基金This work was jointly supported by the National Natural Science Foundation of Shandong Province(No.ZR2023MF022)National Natural Science Foundation of China(Nos.61973203,62173216,and 62173356)Guangyue Youth Scholar Innovation Talent Program Support from Liaocheng University(No.LCUGYTD2022-03).
文摘The distributed hybrid flow shop scheduling problem(DHFSP),which integrates distributed manufacturing models with parallel machines,has gained significant attention.However,in actual scheduling,some adjacent machines do not have buffers between them,resulting in blocking.This paper focuses on addressing the DHFSP with blocking constraints(DBHFSP)based on the actual production conditions.To solve DBHFSP,we construct a mixed integer linear programming(MILP)model for DBHFSP and validate its correctness using the Gurobi solver.Then,an advanced iterated greedy(AIG)algorithm is designed to minimize the makespan,in which we modify the Nawaz,Enscore,and Ham(NEH)heuristic to solve blocking constraints.To balance the global and local search capabilities of AIG,two effective inter-factory neighborhood search strategies and a swap-based local search strategy are designed.Additionally,each factory is mutually independent,and the movement within one factory does not affect the others.In view of this,we specifically designed a memory-based decoding method for insertion operations to reduce the computation time of the objective.Finally,two shaking strategies are incorporated into the algorithm to mitigate premature convergence.Five advanced algorithms are used to conduct comparative experiments with AIG on 80 test instances,and experimental results illustrate that the makespan and the relative percentage increase(RPI)obtained by AIG are 1.0%and 86.1%,respectively,better than the comparative algorithms.
基金This work was supported by the Natural Science Foundation of Shandong province(No.ZR2023MF022)National Natural Science Foundation of China(Nos.61973203,61803192,62106073,and 61966012)Guangyue Young Scholar Innovation Team of Liaocheng University(No.LCUGYTD2022-03).
文摘The hybrid flow shop group scheduling problem(HFGSP)with the delivery time windows has been widely studied owing to its better flexibility and suitability for the current just-in-time production mode.However,there are several unresolved challenges in problem modeling and algorithmic design tailored for HFGSP.In our study,we place emphasis on the constraint of timeliness.Therefore,this paper first constructs a mixed integer linear programming model of HFGSP with sequence-dependent setup time and delivery time windows to minimize the total weighted earliness and tardiness(TWET).Then a penalty groups-assisted iterated greedy integrating idle time insertion(PG IG ITI)is proposed to solve the above problem.In the PG IG ITI,a double decoding strategy is proposed based on the earliest available machine rule and the idle time insertion rule to calculate the TWET value.Subsequently,to reduce the amount of computation,a skip-based destruction and reconstruction strategy is designed,and a penalty groups-assisted local search is proposed to further improve the quality of the solution by disturbing the penalized groups,i.e.,early and tardy groups.Finally,through comprehensive statistical experiments on 270 test instances,the results prove that the proposed algorithm is effective compared to four state-of-the-art algorithms.
