In order to obtain the optimized aircraft design concept which meets the increasingly complex operation environment at the conceptual design stage,System-of-systems(So S)engineering must be considered.This paper propo...In order to obtain the optimized aircraft design concept which meets the increasingly complex operation environment at the conceptual design stage,System-of-systems(So S)engineering must be considered.This paper proposes a novel optimization method for the design of aircraft Mission Success Space(MSS)based on Gaussian fitting and Genetic Algorithm(GA)in the So S area.First,the concepts in the design and evaluation of MSS are summarized to introduce the Contribution to System-of-Systems(CSS)by using a conventional effectiveness index,Mission Success Rate(MSR).Then,the mathematic modelling of Gaussian fitting technique is noted as the basis of the optimization work.After that,the proposed optimal MSS design is illustrated by the multiobjective optimization process where GA acts as the search tool to find the best solution(via Pareto front).In the case study,a simulation system of penetration mission was built.The simulation results are collected and then processed by two MSS design schemes(contour and neural network)giving the initial variable space to GA optimization.Based on that,the proposed optimization method is implemented under both schemes whose optimal solutions are compared to obtain the final best design in the case study.展开更多
Coal consumption curve of the thermal power plant can reflect the function relationship between the coal consumption of unit and load, which plays a key role for research on unit economic operation and load optimal di...Coal consumption curve of the thermal power plant can reflect the function relationship between the coal consumption of unit and load, which plays a key role for research on unit economic operation and load optimal dispatch. Now get coal consumption curve is generally obtained by least square method, but which are static curve and these curves remain unchanged for a long time, and make them are incompatible with the actual operation situation of the unit. Furthermore, coal consumption has the characteristics of typical nonlinear and time varying, sometimes the least square method does not work for nonlinear complex problems. For these problems, a method of coal consumption curve fitting of the thermal power plant units based on genetic algorithm is proposed. The residual analysis method is used for data detection;quadratic function is employed to the objective function;appropriate parameters such as initial population size, crossover rate and mutation rate are set;the unit’s actual coal consumption curves are fitted, and comparing the proposed method with least squares method, the results indicate that fitting effect of the former is better than the latter, and further indicate that the proposed method to do curve fitting can best approximate known data in a certain significance, and they can real-timely reflect the interdependence between power output and coal consumption.展开更多
3D ground-penetrating radar has been widely used in urban road underground disease detection due to its nondestructive,efficient,and intuitive results.However,the 3D imaging of the underground target body presents the...3D ground-penetrating radar has been widely used in urban road underground disease detection due to its nondestructive,efficient,and intuitive results.However,the 3D imaging of the underground target body presents the edge plate phenomenon due to the space between the 3D radar array antennas.Consequently,direct 3D imaging using detection results cannot reflect underground spatial distribution characteristics.Due to the wide-beam polarization of the ground-penetrating radar antenna,the emission of electromagnetic waves with a specific width decreases the strong middle energy on both sides gradually.Therefore,a bicubic high-precision 3D target body slice-imaging fitting algorithm with changing trend characteristics is constructed by combining the subsurface target characteristics with the changing spatial morphology trends.Using the wide-angle polarization antenna’s characteristics in the algorithm to build the trend factor between the measurement lines,the target body change trend and the edge detail portrayal achieve a 3D ground-penetrating radar-detection target high-precision fitting.Compared with other traditional fitting techniques,the fitting error is small.This paper conducts experiments and analyses on GpaMax 3D forward modeling and 3D ground-penetrating measured radar data.The experiments show that the improved bicubic fitting algorithm can eff ectively improve the accuracy of underground target slice imaging and the 3D ground-penetrating radar’s anomaly interpretation.展开更多
The algorithm is divided into two steps. The first step pre-locates the blank by aligning its centre of gravity and approximate normal vector with those of destination surfaces, with largest overlap of projections...The algorithm is divided into two steps. The first step pre-locates the blank by aligning its centre of gravity and approximate normal vector with those of destination surfaces, with largest overlap of projections of two objects on a plane perpendicular to the normal vector. The second step is optimizing an objective function by means of gradient-simulated annealing algorithm to get the best matching of a set of distributed points on the blank and destination surfaces. An example for machining hydroelectric turbine blades is given to verify the effectiveness of algorithm.展开更多
It is necessary to rely on the rail gauge to determine whether the object beside the track will affect train operation safety or not.A convenient and fast method based on line segment detector(LSD)and the least square...It is necessary to rely on the rail gauge to determine whether the object beside the track will affect train operation safety or not.A convenient and fast method based on line segment detector(LSD)and the least square curve fitting to identify the rail in the image is proposed in this paper.The image in front of the train can be obtained through the camera on-board.After preprocessing,it will be divided equally along the longitudinal axis.Utilizing the characteristics of the LSD algorithm,the edges are approximated into multiple line segments.After screening the terminals of the line segments,it can generate the mathematical model of the rail in the image based on the least square.Experiments show that the algorithm in this paper can fit the rail curve accurately and has good applicability and robustness.展开更多
In design science, these two kinds of problems are mutually nested, however, the nesting could not blind us for the fact that their problem-solving and solution justification methods are different. The ant algorithms ...In design science, these two kinds of problems are mutually nested, however, the nesting could not blind us for the fact that their problem-solving and solution justification methods are different. The ant algorithms research field, builds on the idea that the study of the behavior of ant colonies or other social insects is interesting, because it provides models of distributed organization which could be utilized as a source of inspiration for the design of optimization and distributed control algorithms. In this paper, a relatively new type of hybridizing ant search algorithm is developed, and the results are compared against other algorithms. The intelligence of this heuristic approach is not portrayed by individual ants, but rather is expressed by the colony as a whole inspired by labor division and brood sorting. This solution obtained by this method will be evaluated against the one obtained by other traditional heuristics.展开更多
An intuitive method for circle fitting is proposed. Assuming an approximate circle(CA,n) for the fitting of some scattered points, it can be imagined that every point would apply a force to CA,n, which all together fo...An intuitive method for circle fitting is proposed. Assuming an approximate circle(CA,n) for the fitting of some scattered points, it can be imagined that every point would apply a force to CA,n, which all together form an overall effect that "draws" CA,n towards best fitting to the group of points. The basic element of the force is called circular attracting factor(CAF) which is defined as a real scalar in a radial direction of CA,n. An iterative algorithm based on this idea is proposed, and the convergence and accuracy are analyzed. The algorithm converges uniformly which is proved by the analysis of Lyapunov function, and the accuracy of the algorithm is in accord with that of geometric least squares of circle fitting. The algorithm is adopted to circle detection in grayscale images, in which the transferring to binary images is not required, and thus the algorithm is less sensitive to lightening and background noise. The main point for the adaption is the calculation of CAF which is extended in radial directions of CA,n for the whole image. All pixels would apply forces to CA,n, and the overall effect of forces would be equivalent to a force from the centroid of pixels to CA,n. The forces from would-be edge pixels would overweigh that from noisy pixels, so the following approximate circle would be of better fitting. To reduce the amount of calculation, pixels are only used in an annular area including the boundary of CA,n just in between for the calculation of CAF. Examples are given, showing the process of circle fitting of scattered points around a circle from an initial assuming circle, comparing the fitting results for scattered points from some related literature, applying the method proposed for circular edge detection in grayscale images with noise, and/or with only partial arc of a circle, and for circle detection in BGA inspection.展开更多
Using a fuzzy estimator to evaluate the fitness of chromosomes in a genetic algorithm and adaptively training it in the evolutionary process, the genetic algorithm with fuzzy fitness evaluation is proposed to reduce t...Using a fuzzy estimator to evaluate the fitness of chromosomes in a genetic algorithm and adaptively training it in the evolutionary process, the genetic algorithm with fuzzy fitness evaluation is proposed to reduce the computation time of the algorithm. An analysis on the optimization performance of the proposed algorithm shows that it maintains good performance with its computation time saved. Finally, simulation results on design of a fuzzy controller are presented.展开更多
In this paper we discuss a novel storage scheme for simultaneous memory access in parallel turbo decoder. The new scheme employs vertex coloring in graph theory. Compared to a similar method that also uses unnatural o...In this paper we discuss a novel storage scheme for simultaneous memory access in parallel turbo decoder. The new scheme employs vertex coloring in graph theory. Compared to a similar method that also uses unnatural order in storage, our scheme requires 25 more memory blocks but allows a simpler configuration for variable sizes of code lengths that can be implemented on-chip. Experiment shows that for a moderate to high decoding throughput （40-100 Mbps）, the hardware cost is still affordable for 3GPP＇s （3rd generation partnership project） interleaver.展开更多
A new algorithm is proposed for underwater vehicles multi-path planning. This algorithm is based on fitness sharing genetic algorithm, clustering and evolution of multiple populations, which can keep the diversity of ...A new algorithm is proposed for underwater vehicles multi-path planning. This algorithm is based on fitness sharing genetic algorithm, clustering and evolution of multiple populations, which can keep the diversity of the solution path, and decrease the operating time because of the independent evolution of each subpopulation. The multi-path planning algorithm is demonstrated by a number of two-dimensional path planning problems. The results show that the multi-path planning algorithm has the following characteristics: high searching capability, rapid convergence and high reliability.展开更多
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.展开更多
As an optimization method that has experienced rapid development over the past 20 years, the genetic algorithm has been successfully applied in many fields, but it requires repeated searches based on the characteristi...As an optimization method that has experienced rapid development over the past 20 years, the genetic algorithm has been successfully applied in many fields, but it requires repeated searches based on the characteristics of high-speed computer calculation and conditions of the known relationship between the objective function and independent variables. There are several hundred generations of evolvement, but the functional relationship is unknown in pollution source searches. Therefore, the genetic algorithm cannot be used directly. Certain improvements need to be made based on the actual situation, so that the genetic algorithm can adapt to the actual conditions of environmental problems, and can be used in environmental monitoring and environmental quality assessment. Therefore, a series of methods are proposed for the improvement of the genetic algorithm： （1） the initial generation of individual groups should be artificially set and move from lightly polluted areas to heavily polluted areas; （2） intervention measures should be introduced in the competition between individuals; （3） guide individuals should be added; and （4） specific improvement programs should be put forward. Finally, the scientific rigor and rationality of the improved genetic algorithm are proven through an example.展开更多
Based on the bat algorithm(BA), this paper proposes a discrete BA(DBA) approach to optimize the disassembly sequence planning(DSP) problem, for the purpose of obtaining an optimum disassembly sequence(ODS) of a produc...Based on the bat algorithm(BA), this paper proposes a discrete BA(DBA) approach to optimize the disassembly sequence planning(DSP) problem, for the purpose of obtaining an optimum disassembly sequence(ODS) of a product with a high degree of automation and guiding maintenance operation. The BA for solving continuous problems is introduced, and combining with mathematical formulations, the BA is reformed to be the DBA for DSP problems. The fitness function model(FFM) is built to evaluate the quality of disassembly sequences. The optimization performance of the DBA is tested and verified by an application case, and the DBA is compared with the genetic algorithm(GA), particle swarm optimization(PSO) algorithm and differential mutation BA(DMBA). Numerical experiments show that the proposed DBA has a better optimization capability and provides more accurate solutions than the other three algorithms.展开更多
The nesting problem involves arranging pieces on a plate to maximize use of material. A new scheme for 2D ir- regular-shaped nesting problem is proposed. The new scheme is based on the NFP (No Fit Polygon) algorithm a...The nesting problem involves arranging pieces on a plate to maximize use of material. A new scheme for 2D ir- regular-shaped nesting problem is proposed. The new scheme is based on the NFP (No Fit Polygon) algorithm and a new placement principle for pieces. The novel placement principle is to place a piece to the position with lowest gravity center based on NFP. In addition, genetic algorithm (GA) is adopted to find an efficient nesting sequence. The proposed scheme can deal with pieces with arbitrary rotation and containing region with holes, and achieves competitive results in experiment on benchmark datasets.展开更多
Mobile robot global path planning in a static environment is an important problem. The paper proposes a method of global path planning based on neural network and genetic algorithm. We constructed the neural network m...Mobile robot global path planning in a static environment is an important problem. The paper proposes a method of global path planning based on neural network and genetic algorithm. We constructed the neural network model of environmental information in the workspace for a robot and used this model to establish the relationship between a collision avoidance path and the output of the model. Then the two-dimensional coding for the path via-points was converted to one-dimensional one and the fitness of both the collision avoidance path and the shortest distance are integrated into a fitness function. The simulation results showed that the proposed method is correct and effective.展开更多
Combining the advantages of a genetic algorithm and an artificial immune system, a novel genetic algorithm named immune genetic algorithm based on quasi secondary response （IGA QSR） is proposed. IGA QSR employs a da...Combining the advantages of a genetic algorithm and an artificial immune system, a novel genetic algorithm named immune genetic algorithm based on quasi secondary response （IGA QSR） is proposed. IGA QSR employs a database to simulate the standard secondary response and the quasi secondary response. Elitist strategy, automatic extinction, clonal propagation, diversity guarantee, and selection based on comprehensive fitness are also used in the process of IGA QSR. Theoretical analysis, numerical examples of three benchmark mathematical optimization problems and a trave ling salesman problem all demonstrate that IGA-QSR is more effective not only on convergence speed but also on convergence probability than a simple genetic algorithm with the elitist strategy （ SGA ES）. Besides, IGA QSR allows the designers to stop and restart the optimization process freely with out losing the best results that have already been obtained. These properties make IGA QSR be a fea sible, effective and robust search algorithm for complex engineering problems.展开更多
In many real-world applications of evolutionary algorithms,the fitness of an individual requires a quantitative measure.This paper proposes a self-adaptive linear evolutionary algorithm （ALEA） in which we introduce ...In many real-world applications of evolutionary algorithms,the fitness of an individual requires a quantitative measure.This paper proposes a self-adaptive linear evolutionary algorithm （ALEA） in which we introduce a novel strategy for evaluating individual＇s relative strengths and weaknesses.Based on this strategy,searching space of constrained optimization problems with high dimensions for design variables is compressed into two-dimensional performance space in which it is possible to quickly identify ＇good＇ individuals of the performance for a multiobjective optimization application,regardless of original space complexity.This is considered as our main contribution.In addition,the proposed new evolutionary algorithm combines two basic operators with modification in reproduction phase,namely,crossover and mutation.Simulation results over a comprehensive set of benchmark functions show that the proposed strategy is feasible and effective,and provides good performance in terms of uniformity and diversity of solutions.展开更多
文摘In order to obtain the optimized aircraft design concept which meets the increasingly complex operation environment at the conceptual design stage,System-of-systems(So S)engineering must be considered.This paper proposes a novel optimization method for the design of aircraft Mission Success Space(MSS)based on Gaussian fitting and Genetic Algorithm(GA)in the So S area.First,the concepts in the design and evaluation of MSS are summarized to introduce the Contribution to System-of-Systems(CSS)by using a conventional effectiveness index,Mission Success Rate(MSR).Then,the mathematic modelling of Gaussian fitting technique is noted as the basis of the optimization work.After that,the proposed optimal MSS design is illustrated by the multiobjective optimization process where GA acts as the search tool to find the best solution(via Pareto front).In the case study,a simulation system of penetration mission was built.The simulation results are collected and then processed by two MSS design schemes(contour and neural network)giving the initial variable space to GA optimization.Based on that,the proposed optimization method is implemented under both schemes whose optimal solutions are compared to obtain the final best design in the case study.
文摘Coal consumption curve of the thermal power plant can reflect the function relationship between the coal consumption of unit and load, which plays a key role for research on unit economic operation and load optimal dispatch. Now get coal consumption curve is generally obtained by least square method, but which are static curve and these curves remain unchanged for a long time, and make them are incompatible with the actual operation situation of the unit. Furthermore, coal consumption has the characteristics of typical nonlinear and time varying, sometimes the least square method does not work for nonlinear complex problems. For these problems, a method of coal consumption curve fitting of the thermal power plant units based on genetic algorithm is proposed. The residual analysis method is used for data detection;quadratic function is employed to the objective function;appropriate parameters such as initial population size, crossover rate and mutation rate are set;the unit’s actual coal consumption curves are fitted, and comparing the proposed method with least squares method, the results indicate that fitting effect of the former is better than the latter, and further indicate that the proposed method to do curve fitting can best approximate known data in a certain significance, and they can real-timely reflect the interdependence between power output and coal consumption.
基金supported by The National Key Research and Development Program of China (2021YFC3090304)The Fundamental Research Funds for the Central Universities,China University of Mining and Technology-Beijing (8000150A073).
文摘3D ground-penetrating radar has been widely used in urban road underground disease detection due to its nondestructive,efficient,and intuitive results.However,the 3D imaging of the underground target body presents the edge plate phenomenon due to the space between the 3D radar array antennas.Consequently,direct 3D imaging using detection results cannot reflect underground spatial distribution characteristics.Due to the wide-beam polarization of the ground-penetrating radar antenna,the emission of electromagnetic waves with a specific width decreases the strong middle energy on both sides gradually.Therefore,a bicubic high-precision 3D target body slice-imaging fitting algorithm with changing trend characteristics is constructed by combining the subsurface target characteristics with the changing spatial morphology trends.Using the wide-angle polarization antenna’s characteristics in the algorithm to build the trend factor between the measurement lines,the target body change trend and the edge detail portrayal achieve a 3D ground-penetrating radar-detection target high-precision fitting.Compared with other traditional fitting techniques,the fitting error is small.This paper conducts experiments and analyses on GpaMax 3D forward modeling and 3D ground-penetrating measured radar data.The experiments show that the improved bicubic fitting algorithm can eff ectively improve the accuracy of underground target slice imaging and the 3D ground-penetrating radar’s anomaly interpretation.
文摘The algorithm is divided into two steps. The first step pre-locates the blank by aligning its centre of gravity and approximate normal vector with those of destination surfaces, with largest overlap of projections of two objects on a plane perpendicular to the normal vector. The second step is optimizing an objective function by means of gradient-simulated annealing algorithm to get the best matching of a set of distributed points on the blank and destination surfaces. An example for machining hydroelectric turbine blades is given to verify the effectiveness of algorithm.
基金National Natural Science Foundation of China(No.61763023).
文摘It is necessary to rely on the rail gauge to determine whether the object beside the track will affect train operation safety or not.A convenient and fast method based on line segment detector(LSD)and the least square curve fitting to identify the rail in the image is proposed in this paper.The image in front of the train can be obtained through the camera on-board.After preprocessing,it will be divided equally along the longitudinal axis.Utilizing the characteristics of the LSD algorithm,the edges are approximated into multiple line segments.After screening the terminals of the line segments,it can generate the mathematical model of the rail in the image based on the least square.Experiments show that the algorithm in this paper can fit the rail curve accurately and has good applicability and robustness.
文摘In design science, these two kinds of problems are mutually nested, however, the nesting could not blind us for the fact that their problem-solving and solution justification methods are different. The ant algorithms research field, builds on the idea that the study of the behavior of ant colonies or other social insects is interesting, because it provides models of distributed organization which could be utilized as a source of inspiration for the design of optimization and distributed control algorithms. In this paper, a relatively new type of hybridizing ant search algorithm is developed, and the results are compared against other algorithms. The intelligence of this heuristic approach is not portrayed by individual ants, but rather is expressed by the colony as a whole inspired by labor division and brood sorting. This solution obtained by this method will be evaluated against the one obtained by other traditional heuristics.
基金Project(2013CB035504) supported by the National Basic Research Program of ChinaProject(2012zzts078) supported by the Fundamental Research Funds for the Central Universities of Central South University,ChinaProject(2009ZX02038) supported by the National Science and Technology Major Project of the Ministry of Science and Technology of China
文摘An intuitive method for circle fitting is proposed. Assuming an approximate circle(CA,n) for the fitting of some scattered points, it can be imagined that every point would apply a force to CA,n, which all together form an overall effect that "draws" CA,n towards best fitting to the group of points. The basic element of the force is called circular attracting factor(CAF) which is defined as a real scalar in a radial direction of CA,n. An iterative algorithm based on this idea is proposed, and the convergence and accuracy are analyzed. The algorithm converges uniformly which is proved by the analysis of Lyapunov function, and the accuracy of the algorithm is in accord with that of geometric least squares of circle fitting. The algorithm is adopted to circle detection in grayscale images, in which the transferring to binary images is not required, and thus the algorithm is less sensitive to lightening and background noise. The main point for the adaption is the calculation of CAF which is extended in radial directions of CA,n for the whole image. All pixels would apply forces to CA,n, and the overall effect of forces would be equivalent to a force from the centroid of pixels to CA,n. The forces from would-be edge pixels would overweigh that from noisy pixels, so the following approximate circle would be of better fitting. To reduce the amount of calculation, pixels are only used in an annular area including the boundary of CA,n just in between for the calculation of CAF. Examples are given, showing the process of circle fitting of scattered points around a circle from an initial assuming circle, comparing the fitting results for scattered points from some related literature, applying the method proposed for circular edge detection in grayscale images with noise, and/or with only partial arc of a circle, and for circle detection in BGA inspection.
文摘Using a fuzzy estimator to evaluate the fitness of chromosomes in a genetic algorithm and adaptively training it in the evolutionary process, the genetic algorithm with fuzzy fitness evaluation is proposed to reduce the computation time of the algorithm. An analysis on the optimization performance of the proposed algorithm shows that it maintains good performance with its computation time saved. Finally, simulation results on design of a fuzzy controller are presented.
基金supported by the National High-Technology Research and Development Program of China （Grant No.2003AA123310）, and the National Natural Science Foundation of China （Grant Nos.60332030, 60572157）
文摘In this paper we discuss a novel storage scheme for simultaneous memory access in parallel turbo decoder. The new scheme employs vertex coloring in graph theory. Compared to a similar method that also uses unnatural order in storage, our scheme requires 25 more memory blocks but allows a simpler configuration for variable sizes of code lengths that can be implemented on-chip. Experiment shows that for a moderate to high decoding throughput （40-100 Mbps）, the hardware cost is still affordable for 3GPP＇s （3rd generation partnership project） interleaver.
文摘A new algorithm is proposed for underwater vehicles multi-path planning. This algorithm is based on fitness sharing genetic algorithm, clustering and evolution of multiple populations, which can keep the diversity of the solution path, and decrease the operating time because of the independent evolution of each subpopulation. The multi-path planning algorithm is demonstrated by a number of two-dimensional path planning problems. The results show that the multi-path planning algorithm has the following characteristics: high searching capability, rapid convergence and high reliability.
基金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 Science and Technology Support Program of Jiangsu Province(Grant No.BE2010738)Jiangsu Colleges and Universities Natural Science Foundation Funded Project(Grant No.08KJB620001)the Qing Lan Project of Jiangsu Province
文摘As an optimization method that has experienced rapid development over the past 20 years, the genetic algorithm has been successfully applied in many fields, but it requires repeated searches based on the characteristics of high-speed computer calculation and conditions of the known relationship between the objective function and independent variables. There are several hundred generations of evolvement, but the functional relationship is unknown in pollution source searches. Therefore, the genetic algorithm cannot be used directly. Certain improvements need to be made based on the actual situation, so that the genetic algorithm can adapt to the actual conditions of environmental problems, and can be used in environmental monitoring and environmental quality assessment. Therefore, a series of methods are proposed for the improvement of the genetic algorithm： （1） the initial generation of individual groups should be artificially set and move from lightly polluted areas to heavily polluted areas; （2） intervention measures should be introduced in the competition between individuals; （3） guide individuals should be added; and （4） specific improvement programs should be put forward. Finally, the scientific rigor and rationality of the improved genetic algorithm are proven through an example.
文摘Based on the bat algorithm(BA), this paper proposes a discrete BA(DBA) approach to optimize the disassembly sequence planning(DSP) problem, for the purpose of obtaining an optimum disassembly sequence(ODS) of a product with a high degree of automation and guiding maintenance operation. The BA for solving continuous problems is introduced, and combining with mathematical formulations, the BA is reformed to be the DBA for DSP problems. The fitness function model(FFM) is built to evaluate the quality of disassembly sequences. The optimization performance of the DBA is tested and verified by an application case, and the DBA is compared with the genetic algorithm(GA), particle swarm optimization(PSO) algorithm and differential mutation BA(DMBA). Numerical experiments show that the proposed DBA has a better optimization capability and provides more accurate solutions than the other three algorithms.
基金Project (No. 60573146) supported by the National Natural ScienceFoundation of China
文摘The nesting problem involves arranging pieces on a plate to maximize use of material. A new scheme for 2D ir- regular-shaped nesting problem is proposed. The new scheme is based on the NFP (No Fit Polygon) algorithm and a new placement principle for pieces. The novel placement principle is to place a piece to the position with lowest gravity center based on NFP. In addition, genetic algorithm (GA) is adopted to find an efficient nesting sequence. The proposed scheme can deal with pieces with arbitrary rotation and containing region with holes, and achieves competitive results in experiment on benchmark datasets.
基金Project supported by the National Natural Science Foundation of China (No. 60105003) and the Natural Science Foundation of Zhejiang Province (No. 600025), China
文摘Mobile robot global path planning in a static environment is an important problem. The paper proposes a method of global path planning based on neural network and genetic algorithm. We constructed the neural network model of environmental information in the workspace for a robot and used this model to establish the relationship between a collision avoidance path and the output of the model. Then the two-dimensional coding for the path via-points was converted to one-dimensional one and the fitness of both the collision avoidance path and the shortest distance are integrated into a fitness function. The simulation results showed that the proposed method is correct and effective.
基金Supported by the National Science Foundation for Post-doctoral Scientists of China(20090460216)the National Defense Fundamental Research Foundation of China(B222006060)
文摘Combining the advantages of a genetic algorithm and an artificial immune system, a novel genetic algorithm named immune genetic algorithm based on quasi secondary response （IGA QSR） is proposed. IGA QSR employs a database to simulate the standard secondary response and the quasi secondary response. Elitist strategy, automatic extinction, clonal propagation, diversity guarantee, and selection based on comprehensive fitness are also used in the process of IGA QSR. Theoretical analysis, numerical examples of three benchmark mathematical optimization problems and a trave ling salesman problem all demonstrate that IGA-QSR is more effective not only on convergence speed but also on convergence probability than a simple genetic algorithm with the elitist strategy （ SGA ES）. Besides, IGA QSR allows the designers to stop and restart the optimization process freely with out losing the best results that have already been obtained. These properties make IGA QSR be a fea sible, effective and robust search algorithm for complex engineering problems.
基金supported by the National Natural Science Foundation of China(No.60803049,60472060)
文摘In many real-world applications of evolutionary algorithms,the fitness of an individual requires a quantitative measure.This paper proposes a self-adaptive linear evolutionary algorithm （ALEA） in which we introduce a novel strategy for evaluating individual＇s relative strengths and weaknesses.Based on this strategy,searching space of constrained optimization problems with high dimensions for design variables is compressed into two-dimensional performance space in which it is possible to quickly identify ＇good＇ individuals of the performance for a multiobjective optimization application,regardless of original space complexity.This is considered as our main contribution.In addition,the proposed new evolutionary algorithm combines two basic operators with modification in reproduction phase,namely,crossover and mutation.Simulation results over a comprehensive set of benchmark functions show that the proposed strategy is feasible and effective,and provides good performance in terms of uniformity and diversity of solutions.
