The learning algorithms of causal discovery mainly include score-based methods and genetic algorithms(GA).The score-based algorithms are prone to searching space explosion.Classical GA is slow to converge,and prone to...The learning algorithms of causal discovery mainly include score-based methods and genetic algorithms(GA).The score-based algorithms are prone to searching space explosion.Classical GA is slow to converge,and prone to falling into local optima.To address these issues,an improved GA with domain knowledge(IGADK)is proposed.Firstly,domain knowledge is incorporated into the learning process of causality to construct a new fitness function.Secondly,a dynamical mutation operator is introduced in the algorithm to accelerate the convergence rate.Finally,an experiment is conducted on simulation data,which compares the classical GA with IGADK with domain knowledge of varying accuracy.The IGADK can greatly reduce the number of iterations,populations,and samples required for learning,which illustrates the efficiency and effectiveness of the proposed algorithm.展开更多
An improved genetic algorithm（IGA） based on a novel selection strategy to handle nonlinear programming problems is proposed.Each individual in selection process is represented as a three-dimensional feature vector w...An improved genetic algorithm（IGA） based on a novel selection strategy to handle nonlinear programming problems is proposed.Each individual in selection process is represented as a three-dimensional feature vector which is composed of objective function value,the degree of constraints violations and the number of constraints violations.It is easy to distinguish excellent individuals from general individuals by using an individuals＇ feature vector.Additionally,a local search（LS） process is incorporated into selection operation so as to find feasible solutions located in the neighboring areas of some infeasible solutions.The combination of IGA and LS should offer the advantage of both the quality of solutions and diversity of solutions.Experimental results over a set of benchmark problems demonstrate that IGA has better performance than other algorithms.展开更多
The classical job shop scheduling problem(JSP) is the most popular machine scheduling model in practice and is known as NP-hard.The formulation of the JSP is based on the assumption that for each part type or job ther...The classical job shop scheduling problem(JSP) is the most popular machine scheduling model in practice and is known as NP-hard.The formulation of the JSP is based on the assumption that for each part type or job there is only one process plan that prescribes the sequence of operations and the machine on which each operation has to be performed.However,JSP with alternative machines for various operations is an extension of the classical JSP,which allows an operation to be processed by any machine from a given set of machines.Since this problem requires an additional decision of machine allocation during scheduling,it is much more complex than JSP.We present a domain independent genetic algorithm(GA) approach for the job shop scheduling problem with alternative machines.The GA is implemented in a spreadsheet environment.The performance of the proposed GA is analyzed by comparing with various problem instances taken from the literatures.The result shows that the proposed GA is competitive with the existing approaches.A simplified approach that would be beneficial to both practitioners and researchers is presented for solving scheduling problems with alternative machines.展开更多
This paper proposes a mem-computing model of memristive network-based genetic algorithm(MNGA)by building up the relationship between the memristive network(MN)and the genetic algorithm(GA),and a new edge detection alg...This paper proposes a mem-computing model of memristive network-based genetic algorithm(MNGA)by building up the relationship between the memristive network(MN)and the genetic algorithm(GA),and a new edge detection algorithm where image pixels are defined as individuals of population.First,the computing model of MNGA is designed to perform mem-computing,which brings new possibility of the hardware implementation of GA.Secondly,MNGA-based edge detection integrating image filter and GA operator deployed by MN is proposed.Finally,simulation results demonstrate that the figure of merit(FoM)of our model is better than the latest memristor-based swarm intelligence.In summary,a new way is found to build proper matching of memristor to GA and aid image edge detection.展开更多
This paper studies the effect of amplitude-phase errors on the antenna performance. Via builting on a worst-case error tolerance model, a simple and practical worst error tolerance analysis based on the chaos-genetic ...This paper studies the effect of amplitude-phase errors on the antenna performance. Via builting on a worst-case error tolerance model, a simple and practical worst error tolerance analysis based on the chaos-genetic algorithm （CGA） is proposed. The proposed method utilizes chaos to optimize initial population for the genetic algorithm （GA） and introduces chaotic disturbance into the genetic mutation, thereby improving the ability of the GA to search for the global optimum. Numerical simulations demonstrate that the accuracy and stability of the worst-case analysis of the proposed approach are superior to the GA. And the proposed algorithm can be used easily for the error tolerant design of antenna arrays.展开更多
A novel space-borne antenna adaptive anti-jamming method based on the genetic algorithm （GA）, which is combined with gradient-like reproduction operators is presented, to search for the best weight for pattern synth...A novel space-borne antenna adaptive anti-jamming method based on the genetic algorithm （GA）, which is combined with gradient-like reproduction operators is presented, to search for the best weight for pattern synthesis in radio frequency （RF）. Combined, the GA＇s the capability of the whole searching is, but not limited by selection of the initial parameter, with the gradient algorithm＇s advantage of fast searching. The proposed method requires a smaller sized initial population and lower computational complexity. Therefore, it is flexible to implement this method in the real-time systems. By using the proposed algorithm, the designer can efficiently control both main-lobe shaping and side-lobe level. Simulation results based on the spot survey data show that the algorithm proposed is efficient and feasible.展开更多
The electromagnetic detection satellite （EDS） is a type of earth observation satellites （EOSs）. The Information collected by EDSs plays an important role in some fields, such as industry, science and military. The...The electromagnetic detection satellite （EDS） is a type of earth observation satellites （EOSs）. The Information collected by EDSs plays an important role in some fields, such as industry, science and military. The scheduling of EDSs is a complex combinatorial optimization problem. Current research mainly focuses on the scheduling of imaging satellites and SAR satellites, but little work has been done on the scheduling of EDSs for its specific characteristics. A multi-satellite scheduling model is established, in which the specific constrains of EDSs are considered, then a scheduling algorithm based on the genetic algorithm （GA） is proposed. To deal with the specific constrains of EDSs, a penalty function method is introduced. However, it is hard to determine the appropriate penalty coefficient in the penalty function. Therefore, an adaptive adjustment mechanism of the penalty coefficient is designed to solve the problem, as well as improve the scheduling results. Experimental results are used to demonstrate the correctness and practicability of the proposed scheduling algorithm.展开更多
Evolutionary algorithms(EAs)have been used in high utility itemset mining(HUIM)to address the problem of discover-ing high utility itemsets(HUIs)in the exponential search space.EAs have good running and mining perform...Evolutionary algorithms(EAs)have been used in high utility itemset mining(HUIM)to address the problem of discover-ing high utility itemsets(HUIs)in the exponential search space.EAs have good running and mining performance,but they still require huge computational resource and may miss many HUIs.Due to the good combination of EA and graphics processing unit(GPU),we propose a parallel genetic algorithm(GA)based on the platform of GPU for mining HUIM(PHUI-GA).The evolution steps with improvements are performed in central processing unit(CPU)and the CPU intensive steps are sent to GPU to eva-luate with multi-threaded processors.Experiments show that the mining performance of PHUI-GA outperforms the existing EAs.When mining 90%HUIs,the PHUI-GA is up to 188 times better than the existing EAs and up to 36 times better than the CPU parallel approach.展开更多
基金supported by the National Social Science Fund of China(2022-SKJJ-B-084).
文摘The learning algorithms of causal discovery mainly include score-based methods and genetic algorithms(GA).The score-based algorithms are prone to searching space explosion.Classical GA is slow to converge,and prone to falling into local optima.To address these issues,an improved GA with domain knowledge(IGADK)is proposed.Firstly,domain knowledge is incorporated into the learning process of causality to construct a new fitness function.Secondly,a dynamical mutation operator is introduced in the algorithm to accelerate the convergence rate.Finally,an experiment is conducted on simulation data,which compares the classical GA with IGADK with domain knowledge of varying accuracy.The IGADK can greatly reduce the number of iterations,populations,and samples required for learning,which illustrates the efficiency and effectiveness of the proposed algorithm.
基金supported by the National Natural Science Foundation of China (60632050)National Basic Research Program of Jiangsu Province University (08KJB520003)
文摘An improved genetic algorithm（IGA） based on a novel selection strategy to handle nonlinear programming problems is proposed.Each individual in selection process is represented as a three-dimensional feature vector which is composed of objective function value,the degree of constraints violations and the number of constraints violations.It is easy to distinguish excellent individuals from general individuals by using an individuals＇ feature vector.Additionally,a local search（LS） process is incorporated into selection operation so as to find feasible solutions located in the neighboring areas of some infeasible solutions.The combination of IGA and LS should offer the advantage of both the quality of solutions and diversity of solutions.Experimental results over a set of benchmark problems demonstrate that IGA has better performance than other algorithms.
文摘The classical job shop scheduling problem(JSP) is the most popular machine scheduling model in practice and is known as NP-hard.The formulation of the JSP is based on the assumption that for each part type or job there is only one process plan that prescribes the sequence of operations and the machine on which each operation has to be performed.However,JSP with alternative machines for various operations is an extension of the classical JSP,which allows an operation to be processed by any machine from a given set of machines.Since this problem requires an additional decision of machine allocation during scheduling,it is much more complex than JSP.We present a domain independent genetic algorithm(GA) approach for the job shop scheduling problem with alternative machines.The GA is implemented in a spreadsheet environment.The performance of the proposed GA is analyzed by comparing with various problem instances taken from the literatures.The result shows that the proposed GA is competitive with the existing approaches.A simplified approach that would be beneficial to both practitioners and researchers is presented for solving scheduling problems with alternative machines.
基金This work was supported by the National Natural Science Foundation of China(61550110248)the Sichuan Science and Technology Department project(2019YFG0190)the University of Electronic Science and Technology of China project(H04W170186).
文摘This paper proposes a mem-computing model of memristive network-based genetic algorithm(MNGA)by building up the relationship between the memristive network(MN)and the genetic algorithm(GA),and a new edge detection algorithm where image pixels are defined as individuals of population.First,the computing model of MNGA is designed to perform mem-computing,which brings new possibility of the hardware implementation of GA.Secondly,MNGA-based edge detection integrating image filter and GA operator deployed by MN is proposed.Finally,simulation results demonstrate that the figure of merit(FoM)of our model is better than the latest memristor-based swarm intelligence.In summary,a new way is found to build proper matching of memristor to GA and aid image edge detection.
基金supported by the National Natural Science Foundation of China (60901055)
文摘This paper studies the effect of amplitude-phase errors on the antenna performance. Via builting on a worst-case error tolerance model, a simple and practical worst error tolerance analysis based on the chaos-genetic algorithm （CGA） is proposed. The proposed method utilizes chaos to optimize initial population for the genetic algorithm （GA） and introduces chaotic disturbance into the genetic mutation, thereby improving the ability of the GA to search for the global optimum. Numerical simulations demonstrate that the accuracy and stability of the worst-case analysis of the proposed approach are superior to the GA. And the proposed algorithm can be used easily for the error tolerant design of antenna arrays.
基金the National Natural Science Foundation of China (60502045).
文摘A novel space-borne antenna adaptive anti-jamming method based on the genetic algorithm （GA）, which is combined with gradient-like reproduction operators is presented, to search for the best weight for pattern synthesis in radio frequency （RF）. Combined, the GA＇s the capability of the whole searching is, but not limited by selection of the initial parameter, with the gradient algorithm＇s advantage of fast searching. The proposed method requires a smaller sized initial population and lower computational complexity. Therefore, it is flexible to implement this method in the real-time systems. By using the proposed algorithm, the designer can efficiently control both main-lobe shaping and side-lobe level. Simulation results based on the spot survey data show that the algorithm proposed is efficient and feasible.
基金supported by the National Natural Science Foundation of China(6110118461174159)
文摘The electromagnetic detection satellite （EDS） is a type of earth observation satellites （EOSs）. The Information collected by EDSs plays an important role in some fields, such as industry, science and military. The scheduling of EDSs is a complex combinatorial optimization problem. Current research mainly focuses on the scheduling of imaging satellites and SAR satellites, but little work has been done on the scheduling of EDSs for its specific characteristics. A multi-satellite scheduling model is established, in which the specific constrains of EDSs are considered, then a scheduling algorithm based on the genetic algorithm （GA） is proposed. To deal with the specific constrains of EDSs, a penalty function method is introduced. However, it is hard to determine the appropriate penalty coefficient in the penalty function. Therefore, an adaptive adjustment mechanism of the penalty coefficient is designed to solve the problem, as well as improve the scheduling results. Experimental results are used to demonstrate the correctness and practicability of the proposed scheduling algorithm.
基金This work was supported by the National Natural Science Foundation of China(62073155,62002137,62106088,62206113)the High-End Foreign Expert Recruitment Plan(G2023144007L)the Fundamental Research Funds for the Central Universities(JUSRP221028).
文摘Evolutionary algorithms(EAs)have been used in high utility itemset mining(HUIM)to address the problem of discover-ing high utility itemsets(HUIs)in the exponential search space.EAs have good running and mining performance,but they still require huge computational resource and may miss many HUIs.Due to the good combination of EA and graphics processing unit(GPU),we propose a parallel genetic algorithm(GA)based on the platform of GPU for mining HUIM(PHUI-GA).The evolution steps with improvements are performed in central processing unit(CPU)and the CPU intensive steps are sent to GPU to eva-luate with multi-threaded processors.Experiments show that the mining performance of PHUI-GA outperforms the existing EAs.When mining 90%HUIs,the PHUI-GA is up to 188 times better than the existing EAs and up to 36 times better than the CPU parallel approach.
