In Systems Biology, system identification, which infers regulatory network in genetic system and metabolic pathways using experimentally observed time-course data, is one of the hottest issues. The efficient numerical...In Systems Biology, system identification, which infers regulatory network in genetic system and metabolic pathways using experimentally observed time-course data, is one of the hottest issues. The efficient numerical optimization algorithm to estimate more than 100 real-coded parameters should be developed for this purpose. New real-coded genetic algorithm (RCGA), the combination of AREX (adaptive real-coded ensemble crossover) with JGG (just generation gap), have applied to the inference of genetic interactions involving more than 100 parameters related to the interactions with using experimentally observed time-course data. Compared with conventional RCGA, the combination of UNDX (unimodal normal distribution crossover) with MGG (minimal generation gap), new algorithm has shown the superiority with improving early convergence in the first stage of search and suppressing evolutionary stagnation in the last stage of search.展开更多
Neural-Network Response Surfaces （NNRS） is applied to replace the actual expensive finite element analysis during the composite structural optimization process. The Orthotropic Experiment Method （OEM） is used to s...Neural-Network Response Surfaces （NNRS） is applied to replace the actual expensive finite element analysis during the composite structural optimization process. The Orthotropic Experiment Method （OEM） is used to select the most appropriate design samples for network training. The trained response surfaces can either be objective function or constraint conditions. Together with other conven- tional constraints, an optimization model is then set up and can be solved by Genetic Algorithm （GA）. This allows the separation between design analysis modeling and optimization searching. Through an example of a hat-stiffened composite plate design, the weight response surface is constructed to be objective function, and strength and buckling response surfaces as constraints; and all of them are trained through NASTRAN finite element analysis. The results of optimization study illustrate that the cycles of structural analysis ean be remarkably reduced or even eliminated during the optimization, thus greatly raising the efficiency of optimization process. It also observed that NNRS approximation can achieve equal or even better accuracy than conventional functional response surfaces.展开更多
An extended crowding genetic algorithm (ECGA) is introduced for solvingoptimal pump configuration problem, which was presented by T. Westerlund in 1994. This problem hasbeen found to be non-convex, and the objective f...An extended crowding genetic algorithm (ECGA) is introduced for solvingoptimal pump configuration problem, which was presented by T. Westerlund in 1994. This problem hasbeen found to be non-convex, and the objective function contained several local optima and globaloptimality could not be ensured by all the traditional MINLP optimization method. The concepts ofspecies conserving and composite encoding are introduced to crowding genetic algorithm (CGA) formaintain the diversity of population more effectively and coping with the continuous and/or discretevariables in MINLP problem. The solution of three-levels pump configuration got from DICOPT++software (OA algorithm) is also given. By comparing with the solutions obtained from DICOPT++, ECPmethod, and MIN-MIN method, the ECGA algorithm proved to be very effective in finding the globaloptimal solution of multi-levels pump configuration via using the problem-specific information.展开更多
Fault diagnosis of liquid rocket propulsion systems （LRPSs） is a very important issue in space launch activities particularly when manned space missions are accompanied, since the safety and reliability can be signi...Fault diagnosis of liquid rocket propulsion systems （LRPSs） is a very important issue in space launch activities particularly when manned space missions are accompanied, since the safety and reliability can be significantly enhanced by exploiting an efficient fault diagnosis system. Currently, inverse problem-based diagnosis has attracted a great deal of research attention in fault diagnosis domain. This methodology provides a new strategy to model-based fault diagnosis for monitoring the health of propulsion systems. To solve the inverse problems arising from the fault diagnosis of LRPSs, GAs have been adopted in recent years as the first and effective choice of available numerical optimization tools. However, the GA has many control parameters to be chosen in advance and there still lack sound theoretical tools to analyze the effects of these parameters on diagnostic performance analytically. In this paper a comparative study of the influence of GA parameters on diagnostic results is conducted by performing a series of numerical experiments. The objective of this study is to investigate the contribution of individual algorithm parameter to final diagnostic result and provide reasonable estimates for choosing GA parameters in the inverse problem-based fault diagnosis of LRPSs. Some constructive remarks are made in conclusion and will be helpful for the implementation of GA to the fault diagnosis practice of LRPSs in the future.展开更多
A new algorithm is presented by using the ant colony algorithm based on genetic method （ACG） to solve the continuous optimization problem. Each component has a seed set. The seed in the set has the value of componen...A new algorithm is presented by using the ant colony algorithm based on genetic method （ACG） to solve the continuous optimization problem. Each component has a seed set. The seed in the set has the value of component, trail information and fitness. The ant chooses a seed from the seed set with the possibility determined by trail information and fitness of the seed. The genetic method is used to form new solutions from the solutions got by the ants. Best solutions are selected to update the seeds in the sets and trail information of the seeds. In updating the trail information, a diffusion function is used to achieve the diffuseness of trail information. The new algorithm is tested with 8 different benchmark functions.展开更多
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.展开更多
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.展开更多
An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorith...An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorithm is developed for solving the binary linear implicit programming problem based on the orthogonal design. The orthogonal design with the factor analysis, an experimental design method is applied to the genetic algorithm to make the algorithm more robust, statistical y sound and quickly convergent. A crossover operator formed by the orthogonal array and the factor analysis is presented. First, this crossover operator can generate a smal but representative sample of points as offspring. After al of the better genes of these offspring are selected, a best combination among these offspring is then generated. The simulation results show the effectiveness of the proposed algorithm.展开更多
A quadratic bilevel programming problem is transformed into a single level complementarity slackness problem by applying Karush-Kuhn-Tucker（KKT） conditions.To cope with the complementarity constraints,a binary encod...A quadratic bilevel programming problem is transformed into a single level complementarity slackness problem by applying Karush-Kuhn-Tucker（KKT） conditions.To cope with the complementarity constraints,a binary encoding scheme is adopted for KKT multipliers,and then the complementarity slackness problem is simplified to successive quadratic programming problems,which can be solved by many algorithms available.Based on 0-1 binary encoding,an orthogonal genetic algorithm,in which the orthogonal experimental design with both two-level orthogonal array and factor analysis is used as crossover operator,is proposed.Numerical experiments on 10 benchmark examples show that the orthogonal genetic algorithm can find global optimal solutions of quadratic bilevel programming problems with high accuracy in a small number of iterations.展开更多
An improved genetic algorithm and its application to resolve cutting stock problem arc presented.It is common to apply simple genetic algorithm(SGA)to cutting stock problem,but the huge amount of computing of SGA is a...An improved genetic algorithm and its application to resolve cutting stock problem arc presented.It is common to apply simple genetic algorithm(SGA)to cutting stock problem,but the huge amount of computing of SGA is a serious problem in practical application.Accelerating genetic algorithm(AGA)based on integer coding and AGA's detailed steps are developed to reduce the amount of computation,and a new kind of rectangular parts blank layout algorithm is designed for rectangular cutting stock problem.SGA is adopted to produce individuals within given evolution process,and the variation interval of these individuals is taken as initial domain of the next optimization process,thus shrinks searching range intensively and accelerates the evaluation process of SGA.To enhance the diversity of population and to avoid the algorithm stagnates at local optimization result,fixed number of individuals are produced randomly and replace the same number of parents in every evaluation process.According to the computational experiment,it is observed that this improved GA converges much sooner than SGA,and is able to get the balance of good result and high efficiency in the process of optimization for rectangular cutting stock problem.展开更多
The VRP is classified as an NP-hard problem. Hence exact optimization methods may be difficult to solve these problems in acceptable CPU times, when the problem involves real-world data sets that are very large. To ge...The VRP is classified as an NP-hard problem. Hence exact optimization methods may be difficult to solve these problems in acceptable CPU times, when the problem involves real-world data sets that are very large. To get solutions in determining routes which are realistic and very close to the actual solution, we use heuristics and metaheuristics which are of the combinatorial optimization type. A literature review of VRPTW, TDVRP, and a metaheuristic such as the genetic algorithm was conducted. In this paper, the implementation of the VRPTW and its extension, the time-dependent VRPTW (TDVRPTW) has been carried out using the model as well as metaheuristics such as the genetic algorithm (GA). The algorithms were implemented, using Matlab and HeuristicLab optimization software. A plugin was developed using Visual C# and DOT NET framework 4.5. Results were tested using Solomon’s 56 benchmark instances classified into groups such as C1, C2, R1, R2, RC1, RC2, with 100 customer nodes, 25 vehicles and each vehicle capacity of 200. The results were comparable to the earlier algorithms developed and in some cases the current algorithm yielded better results in terms of total distance travelled and the average number of vehicles used.展开更多
A new genetic algorithm named niche pseudo-parallel genetic algorithm （NPPGA） is presented for path evolution and genetic optimization of autonomous mobile robot. The NPPGA is an effective improvement to maintain th...A new genetic algorithm named niche pseudo-parallel genetic algorithm （NPPGA） is presented for path evolution and genetic optimization of autonomous mobile robot. The NPPGA is an effective improvement to maintain the population diversity as well for the sake of avoiding premature and strengthen parallelism of the population to accelerate the search process combined with niche genetic algorithms and pseudo-parallel genetic algorithms. The proposed approach is evaluated by robotic path optimization, which is a specific application of traveler salesman problem （TSP）. Experimental results indicated that a shortest path could be obtained in the practical traveling salesman problem named ＂Robot tour around Pekin＂, and the performance conducted by NPPGA is better than simple genetic algorithm （SGA） and distributed paralell genetic algorithms （DPGA）.展开更多
This paper presents a new approach to the analysis of complex distribution problems under capacity constraints. These problems are known in the literature as CVRPs (Capacitated Vehicle Routing Problems). The procedure...This paper presents a new approach to the analysis of complex distribution problems under capacity constraints. These problems are known in the literature as CVRPs (Capacitated Vehicle Routing Problems). The procedure introduced in this paper optimizes a transformed variant of a CVRP. It starts generating feasible clusters and codifies their ordering. In the next stage the procedure feeds this information into a genetic algorithm for its optimization. This makes the algorithm independent of the constraints and improves its performance. Van Breedam problems have been used to test this technique. While the results obtained are similar to those in other works, the processing times are longer.展开更多
Conventional pit excavation engineering methods often struggle to manage the complex deformation patterns associated with asymmetric excavations,resulting in significant safety risks and increased project costs.These ...Conventional pit excavation engineering methods often struggle to manage the complex deformation patterns associated with asymmetric excavations,resulting in significant safety risks and increased project costs.These challenges highlight the need for more precise and efficient design methodologies to ensure structural stability and economic feasibility.This research proposes an innovative automatic optimization inverse design method(AOIDM)that integrates an enhanced genetic algorithm(EGA)with a multiobjective optimization model.By combining advanced computational techniques with engineering principles,this approach improves search efficiency by 30%and enhances deformation control accuracy by 25%.Additionally,the approach exhibits potential for reducing carbon emissions to align with sustainable engineering goals.The effectiveness of this approach was validated through comprehensive data analysis and practical case studies,demonstrating its ability to optimize retaining structure designs under complex asymmetric loading conditions.This research establishes a new standard for precision and efficiency in automated excavation design,with accompanying improvements in safety and cost-effectiveness.Furthermore,it lays the foundation for future geotechnical engineering advancements,offering a robust solution to one of the most challenging aspects of modern excavation projects.展开更多
The standard genetic algorithm has limitations of a low convergence rate and premature convergence in solving the job-shop scheduling problem.To overcome these limitations,this paper presents a new improved hybrid gen...The standard genetic algorithm has limitations of a low convergence rate and premature convergence in solving the job-shop scheduling problem.To overcome these limitations,this paper presents a new improved hybrid genetic algorithm on the basis of the idea of graft in botany.Through the introduction of a grafted population and crossover probability matrix,this algorithm accelerates the convergence rate greatly and also increases the ability to fight premature convergence.Finally,the approach is tested on a set of standard instances taken from the literature and compared with other approaches.The computation results validate the effectiveness of the proposed algorithm.展开更多
The flowshop scheduling problem is NP complete. To solve it by genetic algorithm, an efficient crossover operator is designed. Compared with another crossover operator, this one often finds a better solution within th...The flowshop scheduling problem is NP complete. To solve it by genetic algorithm, an efficient crossover operator is designed. Compared with another crossover operator, this one often finds a better solution within the same time.展开更多
Energy issues have always been one of the most significant concerns for scientists worldwide.With the ongoing over exploitation and continued outbreaks of wars,traditional energy sources face the threat of depletion.W...Energy issues have always been one of the most significant concerns for scientists worldwide.With the ongoing over exploitation and continued outbreaks of wars,traditional energy sources face the threat of depletion.Wind energy is a readily available and sustainable energy source.Wind farm layout optimization problem,through scientifically arranging wind turbines,significantly enhances the efficiency of harnessing wind energy.Meta-heuristic algorithms have been widely employed in wind farm layout optimization.This paper introduces an Adaptive strategy-incorporated Integer Genetic Algorithm,referred to as AIGA,for optimizing wind farm layout problems.The adaptive strategy dynamically adjusts the placement of wind turbines,leading to a substantial improvement in energy utilization efficiency within the wind farm.In this study,AIGA is tested in four different wind conditions,alongside four other classical algorithms,to assess their energy conversion efficiency within the wind farm.Experimental results demonstrate a notable advantage of AIGA.展开更多
The article presents the results of research on the possibilities of using genetic algorithms for solving the multicriteria optimization problem of determining the active components of a wind farm.Optimization is carr...The article presents the results of research on the possibilities of using genetic algorithms for solving the multicriteria optimization problem of determining the active components of a wind farm.Optimization is carried out on two parameters:efficiency factor of wind farm use(integrated parameter calculated on the basis of 6 parameters of each of the wind farm),average power deviation level(average difference between the load power and energy generation capabilities of the active wind farm).That was done an analysis of publications on the use of genetic algorithms to solve multicriteria optimization problems.Computer simulations were performed,which allowed us to analyze the obtained statistical data and determine the main optimization indicators.That was carried out a comparative analysis of the obtained results with other methods,such as the dynamic programming method;the dynamic programming method with the general increase of the set loading;the modified dynamic programming method,neural networks.It is established that the average power deviation for the genetic algorithm and for the modified dynamic programming method is located at the same level,33.7 and 28.8 kW,respectively.The average value of the efficiency coefficient of wind turbine used for the genetic algorithm is 2.4%less than for the modified dynamic programming method.However,the time of finding the solution by the genetic algorithm is 3.6 times less than for the modified dynamic programming method.The obtained results provide an opportunity to implement an effective decision support system in energy flow management.展开更多
Genetic algorithms (GAs) employ the evolutionary process of Darwin’s nature selection theory to find the solutions of optimization problems. In this paper, an implementation of genetic algorithm is put forward to sol...Genetic algorithms (GAs) employ the evolutionary process of Darwin’s nature selection theory to find the solutions of optimization problems. In this paper, an implementation of genetic algorithm is put forward to solve a classical transportation problem, namely the Hitchcock’s Transportation Problem (HTP), and the GA is improved to search for all optimal solutions and identify them automatically. The algorithm is coded with C++ and validated by numerical examples. The computational results show that the algorithm is efficient for solving the Hitchcock’s transportation problem.展开更多
An adaptive approximation-based optimization （AABO） procedure is developed for the optimum design of a composite advanced grid-stiffened （AGS） cylinder subject to post-buckling. The design taking account of post-b...An adaptive approximation-based optimization （AABO） procedure is developed for the optimum design of a composite advanced grid-stiffened （AGS） cylinder subject to post-buckling. The design taking account of post-buckling under ultimate load will be able to promote the structural efficiency compared to the conventional design in which only the linear buckling is allowed. The beam-shell offsets technique is utilized for modeling the stiffener-skin connection, and the Newton-Raphson method is employed for the post-buckling analysis. A few structural analysis efforts are carried out for establishing the Kriging model of the collapse load of the AGS cylinder for optimization to significantly increase the optimization efficiency. The multi-island genetic algorithm （MIGA） is utilized for global optimum search. An adaptive approximation framework is proposed to resolve the computational burden caused by the large domain of design variables, and it is demonstrated that much less computational expense than that of the traditional approximation-based optimization method can be achieved. The utility of making use of commercial optimization package iSIGHT in conjunction with the finite element （FE） code MSC.MARC to develop the preliminary design tool of the composite AGS cylinder is evaluated as well.展开更多
文摘In Systems Biology, system identification, which infers regulatory network in genetic system and metabolic pathways using experimentally observed time-course data, is one of the hottest issues. The efficient numerical optimization algorithm to estimate more than 100 real-coded parameters should be developed for this purpose. New real-coded genetic algorithm (RCGA), the combination of AREX (adaptive real-coded ensemble crossover) with JGG (just generation gap), have applied to the inference of genetic interactions involving more than 100 parameters related to the interactions with using experimentally observed time-course data. Compared with conventional RCGA, the combination of UNDX (unimodal normal distribution crossover) with MGG (minimal generation gap), new algorithm has shown the superiority with improving early convergence in the first stage of search and suppressing evolutionary stagnation in the last stage of search.
文摘Neural-Network Response Surfaces （NNRS） is applied to replace the actual expensive finite element analysis during the composite structural optimization process. The Orthotropic Experiment Method （OEM） is used to select the most appropriate design samples for network training. The trained response surfaces can either be objective function or constraint conditions. Together with other conven- tional constraints, an optimization model is then set up and can be solved by Genetic Algorithm （GA）. This allows the separation between design analysis modeling and optimization searching. Through an example of a hat-stiffened composite plate design, the weight response surface is constructed to be objective function, and strength and buckling response surfaces as constraints; and all of them are trained through NASTRAN finite element analysis. The results of optimization study illustrate that the cycles of structural analysis ean be remarkably reduced or even eliminated during the optimization, thus greatly raising the efficiency of optimization process. It also observed that NNRS approximation can achieve equal or even better accuracy than conventional functional response surfaces.
基金This project is supported by Provincial Science Foundation of Hebei (No.01213553).
文摘An extended crowding genetic algorithm (ECGA) is introduced for solvingoptimal pump configuration problem, which was presented by T. Westerlund in 1994. This problem hasbeen found to be non-convex, and the objective function contained several local optima and globaloptimality could not be ensured by all the traditional MINLP optimization method. The concepts ofspecies conserving and composite encoding are introduced to crowding genetic algorithm (CGA) formaintain the diversity of population more effectively and coping with the continuous and/or discretevariables in MINLP problem. The solution of three-levels pump configuration got from DICOPT++software (OA algorithm) is also given. By comparing with the solutions obtained from DICOPT++, ECPmethod, and MIN-MIN method, the ECGA algorithm proved to be very effective in finding the globaloptimal solution of multi-levels pump configuration via using the problem-specific information.
基金This work was supported by the National Natural Science Foundation of China(No.50106005)
文摘Fault diagnosis of liquid rocket propulsion systems （LRPSs） is a very important issue in space launch activities particularly when manned space missions are accompanied, since the safety and reliability can be significantly enhanced by exploiting an efficient fault diagnosis system. Currently, inverse problem-based diagnosis has attracted a great deal of research attention in fault diagnosis domain. This methodology provides a new strategy to model-based fault diagnosis for monitoring the health of propulsion systems. To solve the inverse problems arising from the fault diagnosis of LRPSs, GAs have been adopted in recent years as the first and effective choice of available numerical optimization tools. However, the GA has many control parameters to be chosen in advance and there still lack sound theoretical tools to analyze the effects of these parameters on diagnostic performance analytically. In this paper a comparative study of the influence of GA parameters on diagnostic results is conducted by performing a series of numerical experiments. The objective of this study is to investigate the contribution of individual algorithm parameter to final diagnostic result and provide reasonable estimates for choosing GA parameters in the inverse problem-based fault diagnosis of LRPSs. Some constructive remarks are made in conclusion and will be helpful for the implementation of GA to the fault diagnosis practice of LRPSs in the future.
基金project supported by the National High-Technology Research and Development Program of China(Grant No.8632005AA642010)
文摘A new algorithm is presented by using the ant colony algorithm based on genetic method （ACG） to solve the continuous optimization problem. Each component has a seed set. The seed in the set has the value of component, trail information and fitness. The ant chooses a seed from the seed set with the possibility determined by trail information and fitness of the seed. The genetic method is used to form new solutions from the solutions got by the ants. Best solutions are selected to update the seeds in the sets and trail information of the seeds. In updating the trail information, a diffusion function is used to achieve the diffuseness of trail information. The new algorithm is tested with 8 different benchmark functions.
文摘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.
基金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.
基金supported by the Fundamental Research Funds for the Central Universities(K50511700004)the Natural Science Basic Research Plan in Shaanxi Province of China(2013JM1022)
文摘An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorithm is developed for solving the binary linear implicit programming problem based on the orthogonal design. The orthogonal design with the factor analysis, an experimental design method is applied to the genetic algorithm to make the algorithm more robust, statistical y sound and quickly convergent. A crossover operator formed by the orthogonal array and the factor analysis is presented. First, this crossover operator can generate a smal but representative sample of points as offspring. After al of the better genes of these offspring are selected, a best combination among these offspring is then generated. The simulation results show the effectiveness of the proposed algorithm.
基金supported by the National Natural Science Foundation of China (60873099)
文摘A quadratic bilevel programming problem is transformed into a single level complementarity slackness problem by applying Karush-Kuhn-Tucker（KKT） conditions.To cope with the complementarity constraints,a binary encoding scheme is adopted for KKT multipliers,and then the complementarity slackness problem is simplified to successive quadratic programming problems,which can be solved by many algorithms available.Based on 0-1 binary encoding,an orthogonal genetic algorithm,in which the orthogonal experimental design with both two-level orthogonal array and factor analysis is used as crossover operator,is proposed.Numerical experiments on 10 benchmark examples show that the orthogonal genetic algorithm can find global optimal solutions of quadratic bilevel programming problems with high accuracy in a small number of iterations.
基金supported by National Natural Science Foundation of China(No.50575153)Provincial Key Technology Projects of Sichuan,China(No.03GG010-002)
文摘An improved genetic algorithm and its application to resolve cutting stock problem arc presented.It is common to apply simple genetic algorithm(SGA)to cutting stock problem,but the huge amount of computing of SGA is a serious problem in practical application.Accelerating genetic algorithm(AGA)based on integer coding and AGA's detailed steps are developed to reduce the amount of computation,and a new kind of rectangular parts blank layout algorithm is designed for rectangular cutting stock problem.SGA is adopted to produce individuals within given evolution process,and the variation interval of these individuals is taken as initial domain of the next optimization process,thus shrinks searching range intensively and accelerates the evaluation process of SGA.To enhance the diversity of population and to avoid the algorithm stagnates at local optimization result,fixed number of individuals are produced randomly and replace the same number of parents in every evaluation process.According to the computational experiment,it is observed that this improved GA converges much sooner than SGA,and is able to get the balance of good result and high efficiency in the process of optimization for rectangular cutting stock problem.
文摘The VRP is classified as an NP-hard problem. Hence exact optimization methods may be difficult to solve these problems in acceptable CPU times, when the problem involves real-world data sets that are very large. To get solutions in determining routes which are realistic and very close to the actual solution, we use heuristics and metaheuristics which are of the combinatorial optimization type. A literature review of VRPTW, TDVRP, and a metaheuristic such as the genetic algorithm was conducted. In this paper, the implementation of the VRPTW and its extension, the time-dependent VRPTW (TDVRPTW) has been carried out using the model as well as metaheuristics such as the genetic algorithm (GA). The algorithms were implemented, using Matlab and HeuristicLab optimization software. A plugin was developed using Visual C# and DOT NET framework 4.5. Results were tested using Solomon’s 56 benchmark instances classified into groups such as C1, C2, R1, R2, RC1, RC2, with 100 customer nodes, 25 vehicles and each vehicle capacity of 200. The results were comparable to the earlier algorithms developed and in some cases the current algorithm yielded better results in terms of total distance travelled and the average number of vehicles used.
文摘A new genetic algorithm named niche pseudo-parallel genetic algorithm （NPPGA） is presented for path evolution and genetic optimization of autonomous mobile robot. The NPPGA is an effective improvement to maintain the population diversity as well for the sake of avoiding premature and strengthen parallelism of the population to accelerate the search process combined with niche genetic algorithms and pseudo-parallel genetic algorithms. The proposed approach is evaluated by robotic path optimization, which is a specific application of traveler salesman problem （TSP）. Experimental results indicated that a shortest path could be obtained in the practical traveling salesman problem named ＂Robot tour around Pekin＂, and the performance conducted by NPPGA is better than simple genetic algorithm （SGA） and distributed paralell genetic algorithms （DPGA）.
文摘This paper presents a new approach to the analysis of complex distribution problems under capacity constraints. These problems are known in the literature as CVRPs (Capacitated Vehicle Routing Problems). The procedure introduced in this paper optimizes a transformed variant of a CVRP. It starts generating feasible clusters and codifies their ordering. In the next stage the procedure feeds this information into a genetic algorithm for its optimization. This makes the algorithm independent of the constraints and improves its performance. Van Breedam problems have been used to test this technique. While the results obtained are similar to those in other works, the processing times are longer.
基金supported by the National Key R&D Program of China(Grant No.2023YFC3009400)the National Natural Science Foundation of China(Grant Nos.52238009 and 52208344).
文摘Conventional pit excavation engineering methods often struggle to manage the complex deformation patterns associated with asymmetric excavations,resulting in significant safety risks and increased project costs.These challenges highlight the need for more precise and efficient design methodologies to ensure structural stability and economic feasibility.This research proposes an innovative automatic optimization inverse design method(AOIDM)that integrates an enhanced genetic algorithm(EGA)with a multiobjective optimization model.By combining advanced computational techniques with engineering principles,this approach improves search efficiency by 30%and enhances deformation control accuracy by 25%.Additionally,the approach exhibits potential for reducing carbon emissions to align with sustainable engineering goals.The effectiveness of this approach was validated through comprehensive data analysis and practical case studies,demonstrating its ability to optimize retaining structure designs under complex asymmetric loading conditions.This research establishes a new standard for precision and efficiency in automated excavation design,with accompanying improvements in safety and cost-effectiveness.Furthermore,it lays the foundation for future geotechnical engineering advancements,offering a robust solution to one of the most challenging aspects of modern excavation projects.
文摘The standard genetic algorithm has limitations of a low convergence rate and premature convergence in solving the job-shop scheduling problem.To overcome these limitations,this paper presents a new improved hybrid genetic algorithm on the basis of the idea of graft in botany.Through the introduction of a grafted population and crossover probability matrix,this algorithm accelerates the convergence rate greatly and also increases the ability to fight premature convergence.Finally,the approach is tested on a set of standard instances taken from the literature and compared with other approaches.The computation results validate the effectiveness of the proposed algorithm.
文摘The flowshop scheduling problem is NP complete. To solve it by genetic algorithm, an efficient crossover operator is designed. Compared with another crossover operator, this one often finds a better solution within the same time.
基金supported by the Japan Society for the Promotion of Science(JSPS)KAKENHI under Grant JP22H03643,Japan Science and Technology Agency(JST)Support for Pioneering Research Initiated by the Next Generation(SPRING)under Grant JPMJSP2145JST through the Establishment of University Fellowships towards the Creation of Science Technology Innovation under Grant JPMJFS2115.
文摘Energy issues have always been one of the most significant concerns for scientists worldwide.With the ongoing over exploitation and continued outbreaks of wars,traditional energy sources face the threat of depletion.Wind energy is a readily available and sustainable energy source.Wind farm layout optimization problem,through scientifically arranging wind turbines,significantly enhances the efficiency of harnessing wind energy.Meta-heuristic algorithms have been widely employed in wind farm layout optimization.This paper introduces an Adaptive strategy-incorporated Integer Genetic Algorithm,referred to as AIGA,for optimizing wind farm layout problems.The adaptive strategy dynamically adjusts the placement of wind turbines,leading to a substantial improvement in energy utilization efficiency within the wind farm.In this study,AIGA is tested in four different wind conditions,alongside four other classical algorithms,to assess their energy conversion efficiency within the wind farm.Experimental results demonstrate a notable advantage of AIGA.
基金This research was funded by National Research Foundation of Ukraine,Grant Number 2020.01/0025.
文摘The article presents the results of research on the possibilities of using genetic algorithms for solving the multicriteria optimization problem of determining the active components of a wind farm.Optimization is carried out on two parameters:efficiency factor of wind farm use(integrated parameter calculated on the basis of 6 parameters of each of the wind farm),average power deviation level(average difference between the load power and energy generation capabilities of the active wind farm).That was done an analysis of publications on the use of genetic algorithms to solve multicriteria optimization problems.Computer simulations were performed,which allowed us to analyze the obtained statistical data and determine the main optimization indicators.That was carried out a comparative analysis of the obtained results with other methods,such as the dynamic programming method;the dynamic programming method with the general increase of the set loading;the modified dynamic programming method,neural networks.It is established that the average power deviation for the genetic algorithm and for the modified dynamic programming method is located at the same level,33.7 and 28.8 kW,respectively.The average value of the efficiency coefficient of wind turbine used for the genetic algorithm is 2.4%less than for the modified dynamic programming method.However,the time of finding the solution by the genetic algorithm is 3.6 times less than for the modified dynamic programming method.The obtained results provide an opportunity to implement an effective decision support system in energy flow management.
文摘Genetic algorithms (GAs) employ the evolutionary process of Darwin’s nature selection theory to find the solutions of optimization problems. In this paper, an implementation of genetic algorithm is put forward to solve a classical transportation problem, namely the Hitchcock’s Transportation Problem (HTP), and the GA is improved to search for all optimal solutions and identify them automatically. The algorithm is coded with C++ and validated by numerical examples. The computational results show that the algorithm is efficient for solving the Hitchcock’s transportation problem.
基金National Basic Research Program of China (070022)Ph.D.Innovation Foundation of Beijing University of Aeronautics and Astronautics
文摘An adaptive approximation-based optimization （AABO） procedure is developed for the optimum design of a composite advanced grid-stiffened （AGS） cylinder subject to post-buckling. The design taking account of post-buckling under ultimate load will be able to promote the structural efficiency compared to the conventional design in which only the linear buckling is allowed. The beam-shell offsets technique is utilized for modeling the stiffener-skin connection, and the Newton-Raphson method is employed for the post-buckling analysis. A few structural analysis efforts are carried out for establishing the Kriging model of the collapse load of the AGS cylinder for optimization to significantly increase the optimization efficiency. The multi-island genetic algorithm （MIGA） is utilized for global optimum search. An adaptive approximation framework is proposed to resolve the computational burden caused by the large domain of design variables, and it is demonstrated that much less computational expense than that of the traditional approximation-based optimization method can be achieved. The utility of making use of commercial optimization package iSIGHT in conjunction with the finite element （FE） code MSC.MARC to develop the preliminary design tool of the composite AGS cylinder is evaluated as well.
