A nested genetic algorithm, including genetic parameter level and genetic implemented level for peak parameters, was proposed and applied for resolving overlapped spectral bands. By the genetic parameter level, parame...A nested genetic algorithm, including genetic parameter level and genetic implemented level for peak parameters, was proposed and applied for resolving overlapped spectral bands. By the genetic parameter level, parameters of generic algorithm were optimized; moreover, the number of overlapped peaks was determined simultaneously Then parameters of individual peaks were computed with the genetic implemented level.展开更多
A distributed blackboard decision-making framework for collaborative planning based on nested genetic algorithm (NGA) is proposed. By using blackboard-based communication paradigm and shared data structure, multiple...A distributed blackboard decision-making framework for collaborative planning based on nested genetic algorithm (NGA) is proposed. By using blackboard-based communication paradigm and shared data structure, multiple decision-makers (DMs) can collaboratively solve the tasks-platforms allocation scheduling problems dynamically through the coordinator. This methodo- logy combined with NGA maximizes tasks execution accuracy, also minimizes the weighted total workload of the DM which is measured in terms of intra-DM and inter-DM coordination. The intra-DM employs an optimization-based scheduling algorithm to match the tasks-platforms assignment request with its own platforms. The inter-DM coordinates the exchange of collaborative request information and platforms among DMs using the blackboard architecture. The numerical result shows that the proposed black- board DM framework based on NGA can obtain a near-optimal solution for the tasks-platforms collaborative planning problem. The assignment of platforms-tasks and the patterns of coordination can achieve a nice trade-off between intra-DM and inter-DM coordination workload.展开更多
In microarray-based cancer classification, gene selection is an important issue owing to the large number of variables and small number of samples as well as its non-linearity. It is difficult to get satisfying result...In microarray-based cancer classification, gene selection is an important issue owing to the large number of variables and small number of samples as well as its non-linearity. It is difficult to get satisfying results by using conventional linear sta- tistical methods. Recursive feature elimination based on support vector machine (SVM RFE) is an effective algorithm for gene selection and cancer classification, which are integrated into a consistent framework. In this paper, we propose a new method to select parameters of the aforementioned algorithm implemented with Gaussian kernel SVMs as better alternatives to the common practice of selecting the apparently best parameters by using a genetic algorithm to search for a couple of optimal parameter. Fast implementation issues for this method are also discussed for pragmatic reasons. The proposed method was tested on two repre- sentative hereditary breast cancer and acute leukaemia datasets. The experimental results indicate that the proposed method per- forms well in selecting genes and achieves high classification accuracies with these genes.展开更多
The process of including renewable energy sources in power networks is moving quickly,so the need for innovative configuration solutions for grid-side ESS has grown.Among the new methods presented in this paper is GA-...The process of including renewable energy sources in power networks is moving quickly,so the need for innovative configuration solutions for grid-side ESS has grown.Among the new methods presented in this paper is GA-OCESE,which stands for Genetic Algorithm-based Optimization Configuration for Energy Storage in Electric Networks.This is one of the methods suggested in this study,which aims to enhance the sizing,positioning,and operational characteristics of structured ESS under dynamic grid conditions.Particularly,the aim is to maximize efficiency.A multiobjective genetic algorithm,the GA-OCESE framework,considers all these factors simultaneously.Besides considering cost-efficiency,response time,and energy use,the system also considers all these elements simultaneously.This enables it to effectively react to load uncertainty and variations in inputs connected to renewable sources.Results of an experimental assessment conducted on a standardized grid simulation platform indicate that by increasing energy use efficiency by 17.6%and reducing peak-load effects by 22.3%,GA-OCESE outperforms previous heuristic-based methods.This was found by contrasting the outcomes of the assessment with those of the evaluation.The results of the assessment helped to reveal this.The proposed approach will provide utility operators and energy planners with a decision-making tool that is both scalable and adaptable.This technology is particularly well-suited for smart grids,microgrid systems,and power infrastructures that heavily rely on renewable energy.Every technical component has been carefully recorded to ensure accuracy,reproducibility,and relevance across all power systems engineering software uses.This was done to ensure the program’s relevance.展开更多
Using Genetic Algorithms (GAs) is a powerful tool to get solution to large scale design optimization problems. This paper used GA to solve complicated design optimization problems in two different applications. The ai...Using Genetic Algorithms (GAs) is a powerful tool to get solution to large scale design optimization problems. This paper used GA to solve complicated design optimization problems in two different applications. The aims are to implement the genetic algorithm to solve these two different (nested) problems, and to get the best or optimization solutions.展开更多
The nesting problem in the leather manufacturing is the problem of placing a set of irregularly shaped pieces (called stencils) on a set of irregularly shaped surfaces (called leathers sheets). This paper presents a n...The nesting problem in the leather manufacturing is the problem of placing a set of irregularly shaped pieces (called stencils) on a set of irregularly shaped surfaces (called leathers sheets). This paper presents a novel and promising processing approach. After the profile of leather sheets and stencils is obtained with digitizer, the discretization makes the processing independent of the specific geometrical information. The constraints of profile are regarded thoroughly. A heuristic bottom-left placement strategy is employed to sequentially locate stencils on sheets. The optimal placement sequence and rotation are deterimined by genetic algorithms (GA). A natural concise encoding method is developed to satisfy all the possible requirements of the leather nesting problem. The experimental results show that the proposed algorithm can not only be applied to the normal two-dimensional nesting problem, but also especially suitable for the placement of multiple two-dimensional irregular stencils on multiple two-dimensional irregular sheets.展开更多
According to the cutting stock problem of 2-dimensional shapes, a nesting system (NS) based on hybrid genetic algorithm (HGA) is established. The system optimizes the sequence and angles of polygons with hybrid Ge...According to the cutting stock problem of 2-dimensional shapes, a nesting system (NS) based on hybrid genetic algorithm (HGA) is established. The system optimizes the sequence and angles of polygons with hybrid Genetic Algorithm to accomplish the superior solution. It nests the irregular shape directly without covering irregular shapes with a rectangle. It also improves the decoding strategy of 2-dimensional shapes nesting based on the classical bottom-left strategy, makes the new strategy be universal to convex polygons, concave polygons and line-circular composted polygons.展开更多
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.展开更多
Genetic Algorithm (GA) is a biologically inspired technique and widely used to solve numerous combinational optimization problems. It works on a population of individuals, not just one single solution. As a result, it...Genetic Algorithm (GA) is a biologically inspired technique and widely used to solve numerous combinational optimization problems. It works on a population of individuals, not just one single solution. As a result, it avoids converging to the local optimum. However, it takes too much CPU time in the late process of GA. On the other hand, in the late process Simulated Annealing (SA) converges faster than GA but it is easily trapped to local optimum. In this letter, a useful method that unifies GA and SA is introduced, which utilizes the advantage of the global search ability of GA and fast convergence of SA. The experimental results show that the proposed algorithm outperforms GA in terms of CPU time without degradation of performance. It also achieves highly comparable placement cost compared to the state-of-the-art results obtained by Versatile Place and Route (VPR) Tool.展开更多
The common failure mechanism for brittle rocks is known to be axial splitting which happens parallel to the direction of maximum compression. One of the mechanisms proposed for modelling of axial splitting is the slid...The common failure mechanism for brittle rocks is known to be axial splitting which happens parallel to the direction of maximum compression. One of the mechanisms proposed for modelling of axial splitting is the sliding crack or so called, “wing crack” model. Fairhurst-Cook model explains this specific type of failure which starts by a pre-crack and finally breaks the rock by propagating 2-D cracks under uniaxial compression. In this paper, optimization of this model has been considered and the process has been done by a complete sensitivity analysis on the main parameters of the model and excluding the trends of their changes and also their limits and “peak points”. Later on this paper, three artificial intelligence algorithms including Particle Swarm Intelligence (PSO), Ant Colony Optimization (ACO) and genetic algorithm (GA) has been used and compared in order to achieve optimized sets of parameters resulting in near-maximum or near-minimum amounts of wedging forces creating a wing crack.展开更多
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.展开更多
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.展开更多
A grating eddy current displacement sensor(GECDS) can be used in a watertight electronic transducer to realize long range displacement or position measurement with high accuracy in difficult industry conditions.The pa...A grating eddy current displacement sensor(GECDS) can be used in a watertight electronic transducer to realize long range displacement or position measurement with high accuracy in difficult industry conditions.The parameters optimization of the sensor is essential for economic and efficient production.This paper proposes a method to combine an artificial neural network(ANN) and a genetic algorithm(GA) for the sensor parameters optimization.A neural network model is developed to map the complex relationship between design parameters and the nonlinearity error of the GECDS,and then a GA is used in the optimization process to determine the design parameter values,resulting in a desired minimal nonlinearity error of about 0.11%.The calculated nonlinearity error is 0.25%.These results show that the proposed method performs well for the parameters optimization of the GECDS.展开更多
As the idea of simulated annealing (SA) is introduced into the fitness function, an improved genetic algorithm (GA) is proposed to perform the optimal design of a pressure vessel which aims to attain the minimum weigh...As the idea of simulated annealing (SA) is introduced into the fitness function, an improved genetic algorithm (GA) is proposed to perform the optimal design of a pressure vessel which aims to attain the minimum weight under burst pressure con- straint. The actual burst pressure is calculated using the arc-length and restart analysis in finite element analysis (FEA). A penalty function in the fitness function is proposed to deal with the constrained problem. The effects of the population size and the number of generations in the GA on the weight and burst pressure of the vessel are explored. The optimization results using the proposed GA are also compared with those using the simple GA and the conventional Monte Carlo method.展开更多
Proper fixture design is crucial to obtain the better product quality according to the design specification during the workpiece fabrication. Locator layout planning is one of the most important tasks in the fixture d...Proper fixture design is crucial to obtain the better product quality according to the design specification during the workpiece fabrication. Locator layout planning is one of the most important tasks in the fixture design process. However, the design of a fixture relies heavily on the designerts expertise and experience up to now. Therefore, a new approach to loeator layout determination for workpieces with arbitrary complex surfaces is pro- posed for the first time. Firstly, based on the fuzzy judgment method, the proper locating reference and locator - numbers are determined with consideration of surface type, surface area and position tolerance. Secondly, the lo- cator positions are optimized by genetic algorithm(GA). Finally, a typical example shows that the approach is su- perior to the experiential method and can improve positioning accuracy effectively.展开更多
Frequency selective surface (FSS) is a two-dimensional periodic structure which has promiaent characteristics of bandpass or bandbloek when interacting with electromagnetic waves. In this paper, the thickness, the d...Frequency selective surface (FSS) is a two-dimensional periodic structure which has promiaent characteristics of bandpass or bandbloek when interacting with electromagnetic waves. In this paper, the thickness, the dielectric constant, the element graph and the arrangement periodicity of an FSS medium are investigated by Genetic Algorithm (GA) when an electromagnetic wave is incident on the FSS at a wide angle, and an optimized FSS structure and transmission characteristics are obtained. The results show that the optimized structure has better stability in relation to incident angle of electromagnetic wave and preserves the stability of centre frequency even at an incident angle as large as 80°, thereby laying the foundation for the application of FSS to curved surfaces at wide angles.展开更多
In this paper, a hybrid genetic algorithm (GA) is proposed for the traveling salesman problem (TSP) with pickup and delivery (TSPPD). In our algorithm, a novel pheromone-based crossover operator is advanced that...In this paper, a hybrid genetic algorithm (GA) is proposed for the traveling salesman problem (TSP) with pickup and delivery (TSPPD). In our algorithm, a novel pheromone-based crossover operator is advanced that utilizes both local and global information to construct offspring. In addition, a local search procedure is integrated into the GA to accelerate convergence. The proposed GA has been tested on benchmark instances, and the computational results show that it gives better convergence than existing heuristics.展开更多
Accurate stereo vision calibration is a preliminary step towards high-precision visual posi- tioning of robot. Combining with the characteristics of genetic algorithm (GA) and particle swarm optimization (PSO), a ...Accurate stereo vision calibration is a preliminary step towards high-precision visual posi- tioning of robot. Combining with the characteristics of genetic algorithm (GA) and particle swarm optimization (PSO), a three-stage calibration method based on hybrid intelligent optimization is pro- posed for nonlinear camera models in this paper. The motivation is to improve the accuracy of the calibration process. In this approach, the stereo vision calibration is considered as an optimization problem that can be solved by the GA and PSO. The initial linear values can be obtained in the frost stage. Then in the second stage, two cameras' parameters are optimized separately. Finally, the in- tegrated optimized calibration of two models is obtained in the third stage. Direct linear transforma- tion (DLT), GA and PSO are individually used in three stages. It is shown that the results of every stage can correctly find near-optimal solution and it can be used to initialize the next stage. Simula- tion analysis and actual experimental results indicate that this calibration method works more accu- rate and robust in noisy environment compared with traditional calibration methods. The proposed method can fulfill the requirements of robot sophisticated visual operation.展开更多
This paper establishes a mathematical model of multi-objective optimization with behavior constraints in solid space based on the problem of optimal design of hydraulic manifold blocks (HMB). Due to the limitation o...This paper establishes a mathematical model of multi-objective optimization with behavior constraints in solid space based on the problem of optimal design of hydraulic manifold blocks (HMB). Due to the limitation of its local search ability of genetic algorithm (GA) in solving a massive combinatorial optimization problem, simulated annealing (SA) is combined, the multi-parameter concatenated coding is adopted, and the memory function is added. Thus a hybrid genetic-simulated annealing with memory function is formed. Examples show that the modified algorithm can improve the local search ability in the solution space, and the solution quality.展开更多
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 nested genetic algorithm, including genetic parameter level and genetic implemented level for peak parameters, was proposed and applied for resolving overlapped spectral bands. By the genetic parameter level, parameters of generic algorithm were optimized; moreover, the number of overlapped peaks was determined simultaneously Then parameters of individual peaks were computed with the genetic implemented level.
基金supported by the National Aerospace Science Foundation of China(20138053038)the Graduate Starting Seed Fund of Northwestern Polytechnical University(Z2015111)
摘要A distributed blackboard decision-making framework for collaborative planning based on nested genetic algorithm (NGA) is proposed. By using blackboard-based communication paradigm and shared data structure, multiple decision-makers (DMs) can collaboratively solve the tasks-platforms allocation scheduling problems dynamically through the coordinator. This methodo- logy combined with NGA maximizes tasks execution accuracy, also minimizes the weighted total workload of the DM which is measured in terms of intra-DM and inter-DM coordination. The intra-DM employs an optimization-based scheduling algorithm to match the tasks-platforms assignment request with its own platforms. The inter-DM coordinates the exchange of collaborative request information and platforms among DMs using the blackboard architecture. The numerical result shows that the proposed black- board DM framework based on NGA can obtain a near-optimal solution for the tasks-platforms collaborative planning problem. The assignment of platforms-tasks and the patterns of coordination can achieve a nice trade-off between intra-DM and inter-DM coordination workload.
基金Project supported by the National Basic Research Program (973) of China (No. 2002CB312200) and the Center for Bioinformatics Pro-gram Grant of Harvard Center of Neurodegeneration and Repair,Harvard Medical School, Harvard University, Boston, USA
摘要In microarray-based cancer classification, gene selection is an important issue owing to the large number of variables and small number of samples as well as its non-linearity. It is difficult to get satisfying results by using conventional linear sta- tistical methods. Recursive feature elimination based on support vector machine (SVM RFE) is an effective algorithm for gene selection and cancer classification, which are integrated into a consistent framework. In this paper, we propose a new method to select parameters of the aforementioned algorithm implemented with Gaussian kernel SVMs as better alternatives to the common practice of selecting the apparently best parameters by using a genetic algorithm to search for a couple of optimal parameter. Fast implementation issues for this method are also discussed for pragmatic reasons. The proposed method was tested on two repre- sentative hereditary breast cancer and acute leukaemia datasets. The experimental results indicate that the proposed method per- forms well in selecting genes and achieves high classification accuracies with these genes.
摘要The process of including renewable energy sources in power networks is moving quickly,so the need for innovative configuration solutions for grid-side ESS has grown.Among the new methods presented in this paper is GA-OCESE,which stands for Genetic Algorithm-based Optimization Configuration for Energy Storage in Electric Networks.This is one of the methods suggested in this study,which aims to enhance the sizing,positioning,and operational characteristics of structured ESS under dynamic grid conditions.Particularly,the aim is to maximize efficiency.A multiobjective genetic algorithm,the GA-OCESE framework,considers all these factors simultaneously.Besides considering cost-efficiency,response time,and energy use,the system also considers all these elements simultaneously.This enables it to effectively react to load uncertainty and variations in inputs connected to renewable sources.Results of an experimental assessment conducted on a standardized grid simulation platform indicate that by increasing energy use efficiency by 17.6%and reducing peak-load effects by 22.3%,GA-OCESE outperforms previous heuristic-based methods.This was found by contrasting the outcomes of the assessment with those of the evaluation.The results of the assessment helped to reveal this.The proposed approach will provide utility operators and energy planners with a decision-making tool that is both scalable and adaptable.This technology is particularly well-suited for smart grids,microgrid systems,and power infrastructures that heavily rely on renewable energy.Every technical component has been carefully recorded to ensure accuracy,reproducibility,and relevance across all power systems engineering software uses.This was done to ensure the program’s relevance.
摘要Using Genetic Algorithms (GAs) is a powerful tool to get solution to large scale design optimization problems. This paper used GA to solve complicated design optimization problems in two different applications. The aims are to implement the genetic algorithm to solve these two different (nested) problems, and to get the best or optimization solutions.
摘要The nesting problem in the leather manufacturing is the problem of placing a set of irregularly shaped pieces (called stencils) on a set of irregularly shaped surfaces (called leathers sheets). This paper presents a novel and promising processing approach. After the profile of leather sheets and stencils is obtained with digitizer, the discretization makes the processing independent of the specific geometrical information. The constraints of profile are regarded thoroughly. A heuristic bottom-left placement strategy is employed to sequentially locate stencils on sheets. The optimal placement sequence and rotation are deterimined by genetic algorithms (GA). A natural concise encoding method is developed to satisfy all the possible requirements of the leather nesting problem. The experimental results show that the proposed algorithm can not only be applied to the normal two-dimensional nesting problem, but also especially suitable for the placement of multiple two-dimensional irregular stencils on multiple two-dimensional irregular sheets.
基金Supported by the National Key Technology and Equipment Project of the 10th Five-Year Plan (ZZ02-03-03-01)
摘要According to the cutting stock problem of 2-dimensional shapes, a nesting system (NS) based on hybrid genetic algorithm (HGA) is established. The system optimizes the sequence and angles of polygons with hybrid Genetic Algorithm to accomplish the superior solution. It nests the irregular shape directly without covering irregular shapes with a rectangle. It also improves the decoding strategy of 2-dimensional shapes nesting based on the classical bottom-left strategy, makes the new strategy be universal to convex polygons, concave polygons and line-circular composted polygons.
基金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 School of Engineering, Napier University, United Kingdom, and partially supported by the National Natural Science Foundation of China (No.60273093).
摘要Genetic Algorithm (GA) is a biologically inspired technique and widely used to solve numerous combinational optimization problems. It works on a population of individuals, not just one single solution. As a result, it avoids converging to the local optimum. However, it takes too much CPU time in the late process of GA. On the other hand, in the late process Simulated Annealing (SA) converges faster than GA but it is easily trapped to local optimum. In this letter, a useful method that unifies GA and SA is introduced, which utilizes the advantage of the global search ability of GA and fast convergence of SA. The experimental results show that the proposed algorithm outperforms GA in terms of CPU time without degradation of performance. It also achieves highly comparable placement cost compared to the state-of-the-art results obtained by Versatile Place and Route (VPR) Tool.
摘要The common failure mechanism for brittle rocks is known to be axial splitting which happens parallel to the direction of maximum compression. One of the mechanisms proposed for modelling of axial splitting is the sliding crack or so called, “wing crack” model. Fairhurst-Cook model explains this specific type of failure which starts by a pre-crack and finally breaks the rock by propagating 2-D cracks under uniaxial compression. In this paper, optimization of this model has been considered and the process has been done by a complete sensitivity analysis on the main parameters of the model and excluding the trends of their changes and also their limits and “peak points”. Later on this paper, three artificial intelligence algorithms including Particle Swarm Intelligence (PSO), Ant Colony Optimization (ACO) and genetic algorithm (GA) has been used and compared in order to achieve optimized sets of parameters resulting in near-maximum or near-minimum amounts of wedging forces creating a wing crack.
基金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.
基金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.
摘要A grating eddy current displacement sensor(GECDS) can be used in a watertight electronic transducer to realize long range displacement or position measurement with high accuracy in difficult industry conditions.The parameters optimization of the sensor is essential for economic and efficient production.This paper proposes a method to combine an artificial neural network(ANN) and a genetic algorithm(GA) for the sensor parameters optimization.A neural network model is developed to map the complex relationship between design parameters and the nonlinearity error of the GECDS,and then a GA is used in the optimization process to determine the design parameter values,resulting in a desired minimal nonlinearity error of about 0.11%.The calculated nonlinearity error is 0.25%.These results show that the proposed method performs well for the parameters optimization of the GECDS.
基金Project (Nos. 2006BAK04A02-02 and 2006BAK02B02-08) sup-ported by the National Key Technology R&D Program, China
摘要As the idea of simulated annealing (SA) is introduced into the fitness function, an improved genetic algorithm (GA) is proposed to perform the optimal design of a pressure vessel which aims to attain the minimum weight under burst pressure con- straint. The actual burst pressure is calculated using the arc-length and restart analysis in finite element analysis (FEA). A penalty function in the fitness function is proposed to deal with the constrained problem. The effects of the population size and the number of generations in the GA on the weight and burst pressure of the vessel are explored. The optimization results using the proposed GA are also compared with those using the simple GA and the conventional Monte Carlo method.
基金Supported by the Natural Science Foundation of Jiangxi Province(2009GZC0104)the Science and Technology Research Project of Jiangxi Provincial Department of Education(GJJ10521)~~
摘要Proper fixture design is crucial to obtain the better product quality according to the design specification during the workpiece fabrication. Locator layout planning is one of the most important tasks in the fixture design process. However, the design of a fixture relies heavily on the designerts expertise and experience up to now. Therefore, a new approach to loeator layout determination for workpieces with arbitrary complex surfaces is pro- posed for the first time. Firstly, based on the fuzzy judgment method, the proper locating reference and locator - numbers are determined with consideration of surface type, surface area and position tolerance. Secondly, the lo- cator positions are optimized by genetic algorithm(GA). Finally, a typical example shows that the approach is su- perior to the experiential method and can improve positioning accuracy effectively.
基金Project supported by the National Natural Science Foundation of China (Grant No 10647105)
摘要Frequency selective surface (FSS) is a two-dimensional periodic structure which has promiaent characteristics of bandpass or bandbloek when interacting with electromagnetic waves. In this paper, the thickness, the dielectric constant, the element graph and the arrangement periodicity of an FSS medium are investigated by Genetic Algorithm (GA) when an electromagnetic wave is incident on the FSS at a wide angle, and an optimized FSS structure and transmission characteristics are obtained. The results show that the optimized structure has better stability in relation to incident angle of electromagnetic wave and preserves the stability of centre frequency even at an incident angle as large as 80°, thereby laying the foundation for the application of FSS to curved surfaces at wide angles.
摘要In this paper, a hybrid genetic algorithm (GA) is proposed for the traveling salesman problem (TSP) with pickup and delivery (TSPPD). In our algorithm, a novel pheromone-based crossover operator is advanced that utilizes both local and global information to construct offspring. In addition, a local search procedure is integrated into the GA to accelerate convergence. The proposed GA has been tested on benchmark instances, and the computational results show that it gives better convergence than existing heuristics.
摘要Accurate stereo vision calibration is a preliminary step towards high-precision visual posi- tioning of robot. Combining with the characteristics of genetic algorithm (GA) and particle swarm optimization (PSO), a three-stage calibration method based on hybrid intelligent optimization is pro- posed for nonlinear camera models in this paper. The motivation is to improve the accuracy of the calibration process. In this approach, the stereo vision calibration is considered as an optimization problem that can be solved by the GA and PSO. The initial linear values can be obtained in the frost stage. Then in the second stage, two cameras' parameters are optimized separately. Finally, the in- tegrated optimized calibration of two models is obtained in the third stage. Direct linear transforma- tion (DLT), GA and PSO are individually used in three stages. It is shown that the results of every stage can correctly find near-optimal solution and it can be used to initialize the next stage. Simula- tion analysis and actual experimental results indicate that this calibration method works more accu- rate and robust in noisy environment compared with traditional calibration methods. The proposed method can fulfill the requirements of robot sophisticated visual operation.
基金Project supported by the National Natural Science Foundation of China (Grant No.50375023)
摘要This paper establishes a mathematical model of multi-objective optimization with behavior constraints in solid space based on the problem of optimal design of hydraulic manifold blocks (HMB). Due to the limitation of its local search ability of genetic algorithm (GA) in solving a massive combinatorial optimization problem, simulated annealing (SA) is combined, the multi-parameter concatenated coding is adopted, and the memory function is added. Thus a hybrid genetic-simulated annealing with memory function is formed. Examples show that the modified algorithm can improve the local search ability in the solution space, and the solution quality.
基金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.