In this paper,we propose a hybrid algorithm for finding a set of non dominated solutions of a multi objective optimization problem.In the proposed algorithm,a local search procedure is applied to each solution gener...In this paper,we propose a hybrid algorithm for finding a set of non dominated solutions of a multi objective optimization problem.In the proposed algorithm,a local search procedure is applied to each solution generated by genetic operations.The aim of the proposed algorithm is not to determine a single final solution but to try to find all the non dominated solutions of a multi objective optimization problem.The choice of the final solution is left to the decision makers preference.High search ability of the proposed algorithm is demonstrated by computer simulation.展开更多
This paper discusses the inversion of velocity structure and hypocenters location in the Beijing Tianjin Tangshan Zhangjiakou area by genetic algorithm. The hypocenters location of sele...This paper discusses the inversion of velocity structure and hypocenters location in the Beijing Tianjin Tangshan Zhangjiakou area by genetic algorithm. The hypocenters location of selected earthquakes and crustal structure of this area are obtained using the travel time data of local earthquakes acquired by the Telemetered Seismic Network of Northern China. The mean and standard residuals of hypocenter location acquired by this method are much less than those provided by the report of respective earthquakes. The crustal structure of the first and the second layers obtained interpret the outline of the plain and mountain area in the region successfully and the crustal structure of the third layer nearly coincides with the Moho discontinuity obtained by artificial seismic sounding. These show the genetic algorithm is effective to the inversion of hypocenter location and three dimensional velocity structure.展开更多
Genetic algorithm has been proposed to solve the problem of task assignment. However, it has some drawbacks, e.g., it often takes a long time to find an optimal solution, and the success rate is low. To overcome these...Genetic algorithm has been proposed to solve the problem of task assignment. However, it has some drawbacks, e.g., it often takes a long time to find an optimal solution, and the success rate is low. To overcome these problems, a new coarse grained parallel genetic algorithm with the scheme of central migration is presented, which exploits isolated sub populations. The new approach has been implemented in the PVM environment and has been evaluated on a workstation network for solving the task assignment problem. The results show that it not only significantly improves the result quality but also increases the speed for getting best solution.展开更多
In this paper the nature of predatory pricing is analyzed with genetic algorithms. It is found that, even under the same payoff structure, the results of the coevolution of weak monopolists and entrants are sensitive ...In this paper the nature of predatory pricing is analyzed with genetic algorithms. It is found that, even under the same payoff structure, the results of the coevolution of weak monopolists and entrants are sensitive to the representationof the decisionmaking process. Two representations are studied in this paper. One is the actionbased representation and the other the strategybased representation. The former is to represent a naive mind and the latter is to capture a sophisticated mind. For the actionbased representation, the convergence results are easily obtained and predatory pricing is only temporary in all simulations. However, for the strategybased representation, predatory pricing is not a rare phenomenon and its appearance is cyclical but not regular. Therefore, the snowball effect of a little craziness observed in the experimental game theory wins its support from this representation. Furthermore, the nature of predatory pricing has something to do with the evolution of the sophisticated rather than the naive minds.展开更多
A real valued genetic algorithm(RVGA) for the optimization problem with continuous variables is proposed. It is composed of a simple and general purpose dynamic scaled fitness and selection operator, crossover opera...A real valued genetic algorithm(RVGA) for the optimization problem with continuous variables is proposed. It is composed of a simple and general purpose dynamic scaled fitness and selection operator, crossover operator, mutation operators and adaptive probabilities for these operators. The algorithm is tested by two generally used functions and is used in training a neural network for image recognition. Experimental results show that the algorithm is an efficient global optimization algorithm.展开更多
As the traditional non-linear systems generally based on gradient descent optimization method have some shortage in the field of groundwater level prediction, the paper, according to structure, algorithm and shortcomi...As the traditional non-linear systems generally based on gradient descent optimization method have some shortage in the field of groundwater level prediction, the paper, according to structure, algorithm and shortcoming of the conventional radial basis function neural network （RBF NN）, presented a new improved genetic algorithm （GA）： hybrid hierarchy genetic algorithm （HHGA）. In training RBF NN, the algorithm can automatically determine the structure and parameters of RBF based on the given sample data. Compared with the traditional groundwater level prediction model based on back propagation （BP） or RBF NN, the new prediction model based on HHGA and RBF NN can greatly increase the convergence speed and precision.展开更多
Genetic algorithm finite element method (GA FEM) is applied to the study of tectonic stress field of part of East Asia area. From the observed stress distribution, 2 D elastic plane stress inversion is made to dedu...Genetic algorithm finite element method (GA FEM) is applied to the study of tectonic stress field of part of East Asia area. From the observed stress distribution, 2 D elastic plane stress inversion is made to deduce the boundary forces and investigate controlling factors. It is suggested that the continent continent collision is the dominant factor controlling the Chinese tectonic stress field. The ocean continent convergence along the subduction zone is an important factor. There exists tensile boundary force along the marginal sea.展开更多
Hidden Maxkov models （HMMs） have been used to model burst error sources of wireless channels. This paper proposes a hybrid method of using genetic algorithm （GA） and simulated annealing （SA） to train HMM for dis...Hidden Maxkov models （HMMs） have been used to model burst error sources of wireless channels. This paper proposes a hybrid method of using genetic algorithm （GA） and simulated annealing （SA） to train HMM for discrete channel modelling. The proposed method is compared with pure GA, and experimental results show that the HMMs trained by the hybrid method can better describe the error sequences due to SA＇s ability of facilitating hill-climbing at the later stage of the search. The burst error statistics of the HMMs trained by the proposed method and the corresponding error sequences are also presented to validate the proposed method.展开更多
pplying genetic algorithm to inversion of seismic moment tensor solution and using the data of P waveform from digital network and initial motion directions of P waves of Taiwan network stations, we studied the moment...pplying genetic algorithm to inversion of seismic moment tensor solution and using the data of P waveform from digital network and initial motion directions of P waves of Taiwan network stations, we studied the moment tensor solutions and focal parameters of the earthquake of M=7.3 on 16 September of 1994 in Taiwan Strait and other four quakes of ML5.8 in the near region (21°～26°N, 115°～120°E). Among the five earthquakes, the quake of M=7.3 on September 16, 1994 in Taiwan Strait is the strongest one in the southeastern coast area since Nan′ao earthquake of M=7.3 in 1918. The results show that moment tensor solution of M=7.3 earthquake is mainly doublecouple component, and is normal fault whose fault plane is near NW. The strike of the fault plane resembles that of the distributive bands of earthquakes before the main event and fracture pattern shown by aftershocks. The tension stress axis of focal mechanism is about horizontal, near in NE strike, the compressive stress axis is approximately vertical, near in NWW strike. It seems that this quake is controlled by the force of Philippine plate′s pressing Eurasian plate in NW direction. But from the viewpoint of P axis of near vertical and T axis of near horizontal, it is a normal fault of strong tensibility. There are relatively big difference between focal mechanism solution of this quake and those of the four other strong quakes. The complexity of source mechanism solution of these quakes represents the complexity of the process of the strait earthquake sequences.展开更多
In this paper, a simple and practicable algorithm for optimization of membership function (MF) is proposed. As it is known that MF is very important in the fuzzy control. Unfortunately, to find, especially to optimize...In this paper, a simple and practicable algorithm for optimization of membership function (MF) is proposed. As it is known that MF is very important in the fuzzy control. Unfortunately, to find, especially to optimize MF is always rather complex even difficult. So, to study and develop an effectual aglorithm for MF optimization is a good topic. Allow for the inner advantages of genetic algorithm (GA), it is adopted in the algorithm .The principle and executive procdeure are first presented. Then it is applied in the fuzzy control system of a typical plant. Results of real time run show that the control strategy is encouraging, and the developed algorithm is practicable.展开更多
As a “global” numerical optimization method, genetic algorithm is briefly introduced. It is applied to optimize the absorbing coating to reduce EM scattering, leading to satisfactory results.
Smallholder farming in West Africa faces various challenges, such as limited access to seeds, fertilizers, modern mechanization, and agricultural climate services. Crop productivity obtained under these conditions var...Smallholder farming in West Africa faces various challenges, such as limited access to seeds, fertilizers, modern mechanization, and agricultural climate services. Crop productivity obtained under these conditions varies significantly from one farmer to another, making it challenging to accurately estimate crop production through crop models. This limitation has implications for the reliability of using crop models as agricultural decision-making support tools. To support decision making in agriculture, an approach combining a genetic algorithm (GA) with the crop model AquaCrop is proposed for a location-specific calibration of maize cropping. In this approach, AquaCrop is used to simulate maize crop yield while the GA is used to derive optimal parameters set at grid cell resolution from various combinations of cultivar parameters and crop management in the process of crop and management options calibration. Statistics on pairwise simulated and observed yields indicate that the coefficient of determination varies from 0.20 to 0.65, with a yield deviation ranging from 8% to 36% across Burkina Faso (BF). An analysis of the optimal parameter sets shows that regardless of the climatic zone, a base temperature of 10˚C and an upper temperature of 32˚C is observed in at least 50% of grid cells. The growing season length and the harvest index vary significantly across BF, with the highest values found in the Soudanian zone and the lowest values in the Sahelian zone. Regarding management strategies, the fertility mean rate is approximately 35%, 39%, and 49% for the Sahelian, Soudano-sahelian, and Soudanian zones, respectively. The mean weed cover is around 36%, with the Sahelian and Soudano-sahelian zones showing the highest variability. The proposed approach can be an alternative to the conventional one-size-fits-all approach commonly used for regional crop modeling. Moreover, it has the potential to explore the performance of cropping strategies to adapt to changing climate conditions.展开更多
To address the shortcomings of traditional Genetic Algorithm (GA) in multi-agent path planning, such as prolonged planning time, slow convergence, and solution instability, this paper proposes an Asynchronous Genetic ...To address the shortcomings of traditional Genetic Algorithm (GA) in multi-agent path planning, such as prolonged planning time, slow convergence, and solution instability, this paper proposes an Asynchronous Genetic Algorithm (AGA) to solve multi-agent path planning problems effectively. To enhance the real-time performance and computational efficiency of Multi-Agent Systems (MAS) in path planning, the AGA incorporates an Equal-Size Clustering Algorithm (ESCA) based on the K-means clustering method. The ESCA divides the primary task evenly into a series of subtasks, thereby reducing the gene length in the subsequent GA process. The algorithm then employs GA to solve each subtask sequentially. To evaluate the effectiveness of the proposed method, a simulation program was designed to perform path planning for 100 trajectories, and the results were compared with those of State-Of-The-Art (SOTA) methods. The simulation results demonstrate that, although the solutions provided by AGA are suboptimal, it exhibits significant advantages in terms of execution speed and solution stability compared to other algorithms.展开更多
Wind energy has emerged as a potential replacement for fossil fuel-based energy sources.To harness maximum wind energy,a crucial decision in the development of an efficient wind farm is the optimal layout design.This ...Wind energy has emerged as a potential replacement for fossil fuel-based energy sources.To harness maximum wind energy,a crucial decision in the development of an efficient wind farm is the optimal layout design.This layout defines the specific locations of the turbines within the wind farm.The process of finding the optimal locations of turbines,in the presence of various technical and technological constraints,makes the wind farm layout design problem a complex optimization problem.This problem has traditionally been solved with nature-inspired algorithms with promising results.The performance and convergence of nature-inspired algorithms depend on several parameters,among which the algorithm termination criterion plays a crucial role.Timely convergence is an important aspect of efficient algorithm design because an inefficient algorithm results in wasted computational resources,unwarranted electricity consumption,and hardware stress.This study provides an in-depth analysis of several termination criteria while using the genetic algorithm as a test bench,with its application to the wind farm layout design problem while considering various wind scenarios.The performance of six termination criteria is empirically evaluated with respect to the quality of solutions produced and the execution time involved.Due to the conflicting nature of these two attributes,fuzzy logic-based multi-attribute decision-making is employed in the decision process.Results for the fuzzy decision approach indicate that among the various criteria tested,the criterion Phi achieves an improvement in the range of 2.44%to 32.93%for wind scenario 1.For scenario 2,Best-worst termination criterion performed well compared to the other criteria evaluated,with an improvement in the range of 1.2%to 9.64%.For scenario 3,Hitting bound was the best performer with an improvement of 1.16%to 20.93%.展开更多
This paper introduces an optimized planning approach for integrating photovoltaic as distributed generation (PV-DG) into the radial distribution power systems, utilizing exhaustive load flow (ELF), loss sensitivity fa...This paper introduces an optimized planning approach for integrating photovoltaic as distributed generation (PV-DG) into the radial distribution power systems, utilizing exhaustive load flow (ELF), loss sensitivity factor (LSF), genetic algorithms (GA) methods, and numerical method based on LSF. The methodology aims to determine the optimal allocation and sizing of multiple PV-DG to minimize power loss through time series power flow analysis. An approach utilizing continuous sensitivity analysis is developed and inherently leverages power flow and loss equations to compute LSF of all buses in the system towards employing a dynamic PV-DG model for more accurate results. The algorithm uses a numerical grid search method to optimize PV-DG placement in a power distribution system, focusing on minimizing system losses. It combines iterative analysis, sensitivity assessment, and comprehensive visualization to identify and present the optimal PV-DG configurations. The present-ed algorithms are verified through co-simulation framework combining MATLAB and OpenDSS to carry out analysis for 12-bus radial distribution test system. The proposed numerical method is compared with other algorithms, such as ELF, LSF methods, and Genetic Algorithms (GA). Results show that the proposed numerical method performs well in comparison with LSF and ELF solutions.展开更多
The research on optimization methods for constellation launch deployment strategies focused on the consideration of mission interval time constraints at the launch site.Firstly,a dynamic modeling of the constellation ...The research on optimization methods for constellation launch deployment strategies focused on the consideration of mission interval time constraints at the launch site.Firstly,a dynamic modeling of the constellation deployment process was established,and the relationship between the deployment window and the phase difference of the orbit insertion point,as well as the cost of phase adjustment after orbit insertion,was derived.Then,the combination of the constellation deployment position sequence was treated as a parameter,together with the sequence of satellite deployment intervals,as optimization variables,simplifying a highdimensional search problem within a wide range of dates to a finite-dimensional integer programming problem.An improved genetic algorithm with local search on deployment dates was introduced to optimize the launch deployment strategy.With the new description of the optimization variables,the total number of elements in the solution space was reduced by N orders of magnitude.Numerical simulation confirms that the proposed optimization method accelerates the convergence speed from hours to minutes.展开更多
The objective of this study is to develop an advanced approach to variogram modelling by integrating genetic algorithms(GA)with machine learning-based linear regression,aiming to improve the accuracy and efficiency of...The objective of this study is to develop an advanced approach to variogram modelling by integrating genetic algorithms(GA)with machine learning-based linear regression,aiming to improve the accuracy and efficiency of geostatistical analysis,particularly in mineral exploration.The study combines GA and machine learning to optimise variogram parameters,including range,sill,and nugget,by minimising the root mean square error(RMSE)and maximising the coefficient of determination(R^(2)).The experimental variograms were computed and modelled using theoretical models,followed by optimisation via evolutionary algorithms.The method was applied to gravity data from the Ngoura-Batouri-Kette mining district in Eastern Cameroon,covering 141 data points.Sequential Gaussian Simulations(SGS)were employed for predictive mapping to validate simulated results against true values.Key findings show variograms with ranges between 24.71 km and 49.77 km,opti-mised RMSE and R^(2) values of 11.21 mGal^(2) and 0.969,respectively,after 42 generations of GA optimisation.Predictive mapping using SGS demonstrated that simulated values closely matched true values,with the simu-lated mean at 21.75 mGal compared to the true mean of 25.16 mGal,and variances of 465.70 mGal^(2) and 555.28 mGal^(2),respectively.The results confirmed spatial variability and anisotropies in the N170-N210 directions,consistent with prior studies.This work presents a novel integration of GA and machine learning for variogram modelling,offering an automated,efficient approach to parameter estimation.The methodology significantly enhances predictive geostatistical models,contributing to the advancement of mineral exploration and improving the precision and speed of decision-making in the petroleum and mining industries.展开更多
Airports around the world commonly face challenges in managing airport slot allocation.Effective management of limited slot resources by civil aviation authority often requires redistributing requested slots among air...Airports around the world commonly face challenges in managing airport slot allocation.Effective management of limited slot resources by civil aviation authority often requires redistributing requested slots among airlines.The allocation process must operate within the prescribed capacity limits of the airport while adhering to established priorities and regulations.Additionally,ensuring market fairness is a key objective,as the value of airport slots plays a significant role in the adjustment process.This transforms the traditional time-shift-based problem into a complex multi-objective optimization problem.Addressing such complications is of significant importance to airlines,airports,and passengers alike.Due to the complexity of fairness metrics,traditional integer programming models encounter difficulties in finding effective solutions.This study proposes a neighborhood search strategy to tackle the single airport slot allocation,making it adaptable to both static and rolling capacity scenarios.Two Genetic Algorithms(GAs)are introduced,corresponding to time adjustment and sequence adjustment strategies,respectively.The GA based on the time adjustment strategy demonstrates high robustness,while the sequence adjustment strategy builds upon this GA to develop a simple heuristic algorithm that offers rapid convergence.Case studies conducted at seven airports in China confirm that all three algorithms yield high-quality adjustment solutions suitable for the majority of applications.Further,Pareto analysis reveals that these algorithms effectively balance the adjustment shifts and fairness metrics,demonstrating high practical value and broad applicability.展开更多
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.展开更多
文摘In this paper,we propose a hybrid algorithm for finding a set of non dominated solutions of a multi objective optimization problem.In the proposed algorithm,a local search procedure is applied to each solution generated by genetic operations.The aim of the proposed algorithm is not to determine a single final solution but to try to find all the non dominated solutions of a multi objective optimization problem.The choice of the final solution is left to the decision makers preference.High search ability of the proposed algorithm is demonstrated by computer simulation.
文摘This paper discusses the inversion of velocity structure and hypocenters location in the Beijing Tianjin Tangshan Zhangjiakou area by genetic algorithm. The hypocenters location of selected earthquakes and crustal structure of this area are obtained using the travel time data of local earthquakes acquired by the Telemetered Seismic Network of Northern China. The mean and standard residuals of hypocenter location acquired by this method are much less than those provided by the report of respective earthquakes. The crustal structure of the first and the second layers obtained interpret the outline of the plain and mountain area in the region successfully and the crustal structure of the third layer nearly coincides with the Moho discontinuity obtained by artificial seismic sounding. These show the genetic algorithm is effective to the inversion of hypocenter location and three dimensional velocity structure.
基金Supported by the Nation"86 3"Hi-Tech Development Program of China(86 3-30 6 -ZD11-0 1-8)
文摘Genetic algorithm has been proposed to solve the problem of task assignment. However, it has some drawbacks, e.g., it often takes a long time to find an optimal solution, and the success rate is low. To overcome these problems, a new coarse grained parallel genetic algorithm with the scheme of central migration is presented, which exploits isolated sub populations. The new approach has been implemented in the PVM environment and has been evaluated on a workstation network for solving the task assignment problem. The results show that it not only significantly improves the result quality but also increases the speed for getting best solution.
文摘In this paper the nature of predatory pricing is analyzed with genetic algorithms. It is found that, even under the same payoff structure, the results of the coevolution of weak monopolists and entrants are sensitive to the representationof the decisionmaking process. Two representations are studied in this paper. One is the actionbased representation and the other the strategybased representation. The former is to represent a naive mind and the latter is to capture a sophisticated mind. For the actionbased representation, the convergence results are easily obtained and predatory pricing is only temporary in all simulations. However, for the strategybased representation, predatory pricing is not a rare phenomenon and its appearance is cyclical but not regular. Therefore, the snowball effect of a little craziness observed in the experimental game theory wins its support from this representation. Furthermore, the nature of predatory pricing has something to do with the evolution of the sophisticated rather than the naive minds.
文摘A real valued genetic algorithm(RVGA) for the optimization problem with continuous variables is proposed. It is composed of a simple and general purpose dynamic scaled fitness and selection operator, crossover operator, mutation operators and adaptive probabilities for these operators. The algorithm is tested by two generally used functions and is used in training a neural network for image recognition. Experimental results show that the algorithm is an efficient global optimization algorithm.
文摘As the traditional non-linear systems generally based on gradient descent optimization method have some shortage in the field of groundwater level prediction, the paper, according to structure, algorithm and shortcoming of the conventional radial basis function neural network （RBF NN）, presented a new improved genetic algorithm （GA）： hybrid hierarchy genetic algorithm （HHGA）. In training RBF NN, the algorithm can automatically determine the structure and parameters of RBF based on the given sample data. Compared with the traditional groundwater level prediction model based on back propagation （BP） or RBF NN, the new prediction model based on HHGA and RBF NN can greatly increase the convergence speed and precision.
文摘Genetic algorithm finite element method (GA FEM) is applied to the study of tectonic stress field of part of East Asia area. From the observed stress distribution, 2 D elastic plane stress inversion is made to deduce the boundary forces and investigate controlling factors. It is suggested that the continent continent collision is the dominant factor controlling the Chinese tectonic stress field. The ocean continent convergence along the subduction zone is an important factor. There exists tensile boundary force along the marginal sea.
文摘Hidden Maxkov models （HMMs） have been used to model burst error sources of wireless channels. This paper proposes a hybrid method of using genetic algorithm （GA） and simulated annealing （SA） to train HMM for discrete channel modelling. The proposed method is compared with pure GA, and experimental results show that the HMMs trained by the hybrid method can better describe the error sequences due to SA＇s ability of facilitating hill-climbing at the later stage of the search. The burst error statistics of the HMMs trained by the proposed method and the corresponding error sequences are also presented to validate the proposed method.
文摘pplying genetic algorithm to inversion of seismic moment tensor solution and using the data of P waveform from digital network and initial motion directions of P waves of Taiwan network stations, we studied the moment tensor solutions and focal parameters of the earthquake of M=7.3 on 16 September of 1994 in Taiwan Strait and other four quakes of ML5.8 in the near region (21°～26°N, 115°～120°E). Among the five earthquakes, the quake of M=7.3 on September 16, 1994 in Taiwan Strait is the strongest one in the southeastern coast area since Nan′ao earthquake of M=7.3 in 1918. The results show that moment tensor solution of M=7.3 earthquake is mainly doublecouple component, and is normal fault whose fault plane is near NW. The strike of the fault plane resembles that of the distributive bands of earthquakes before the main event and fracture pattern shown by aftershocks. The tension stress axis of focal mechanism is about horizontal, near in NE strike, the compressive stress axis is approximately vertical, near in NWW strike. It seems that this quake is controlled by the force of Philippine plate′s pressing Eurasian plate in NW direction. But from the viewpoint of P axis of near vertical and T axis of near horizontal, it is a normal fault of strong tensibility. There are relatively big difference between focal mechanism solution of this quake and those of the four other strong quakes. The complexity of source mechanism solution of these quakes represents the complexity of the process of the strait earthquake sequences.
文摘In this paper, a simple and practicable algorithm for optimization of membership function (MF) is proposed. As it is known that MF is very important in the fuzzy control. Unfortunately, to find, especially to optimize MF is always rather complex even difficult. So, to study and develop an effectual aglorithm for MF optimization is a good topic. Allow for the inner advantages of genetic algorithm (GA), it is adopted in the algorithm .The principle and executive procdeure are first presented. Then it is applied in the fuzzy control system of a typical plant. Results of real time run show that the control strategy is encouraging, and the developed algorithm is practicable.
文摘As a “global” numerical optimization method, genetic algorithm is briefly introduced. It is applied to optimize the absorbing coating to reduce EM scattering, leading to satisfactory results.
文摘Smallholder farming in West Africa faces various challenges, such as limited access to seeds, fertilizers, modern mechanization, and agricultural climate services. Crop productivity obtained under these conditions varies significantly from one farmer to another, making it challenging to accurately estimate crop production through crop models. This limitation has implications for the reliability of using crop models as agricultural decision-making support tools. To support decision making in agriculture, an approach combining a genetic algorithm (GA) with the crop model AquaCrop is proposed for a location-specific calibration of maize cropping. In this approach, AquaCrop is used to simulate maize crop yield while the GA is used to derive optimal parameters set at grid cell resolution from various combinations of cultivar parameters and crop management in the process of crop and management options calibration. Statistics on pairwise simulated and observed yields indicate that the coefficient of determination varies from 0.20 to 0.65, with a yield deviation ranging from 8% to 36% across Burkina Faso (BF). An analysis of the optimal parameter sets shows that regardless of the climatic zone, a base temperature of 10˚C and an upper temperature of 32˚C is observed in at least 50% of grid cells. The growing season length and the harvest index vary significantly across BF, with the highest values found in the Soudanian zone and the lowest values in the Sahelian zone. Regarding management strategies, the fertility mean rate is approximately 35%, 39%, and 49% for the Sahelian, Soudano-sahelian, and Soudanian zones, respectively. The mean weed cover is around 36%, with the Sahelian and Soudano-sahelian zones showing the highest variability. The proposed approach can be an alternative to the conventional one-size-fits-all approach commonly used for regional crop modeling. Moreover, it has the potential to explore the performance of cropping strategies to adapt to changing climate conditions.
文摘To address the shortcomings of traditional Genetic Algorithm (GA) in multi-agent path planning, such as prolonged planning time, slow convergence, and solution instability, this paper proposes an Asynchronous Genetic Algorithm (AGA) to solve multi-agent path planning problems effectively. To enhance the real-time performance and computational efficiency of Multi-Agent Systems (MAS) in path planning, the AGA incorporates an Equal-Size Clustering Algorithm (ESCA) based on the K-means clustering method. The ESCA divides the primary task evenly into a series of subtasks, thereby reducing the gene length in the subsequent GA process. The algorithm then employs GA to solve each subtask sequentially. To evaluate the effectiveness of the proposed method, a simulation program was designed to perform path planning for 100 trajectories, and the results were compared with those of State-Of-The-Art (SOTA) methods. The simulation results demonstrate that, although the solutions provided by AGA are suboptimal, it exhibits significant advantages in terms of execution speed and solution stability compared to other algorithms.
基金funded by King Fahd University of Petroleum&Minerals,Saudi Arabia under IRC-SES grant#INRE 2217.
文摘Wind energy has emerged as a potential replacement for fossil fuel-based energy sources.To harness maximum wind energy,a crucial decision in the development of an efficient wind farm is the optimal layout design.This layout defines the specific locations of the turbines within the wind farm.The process of finding the optimal locations of turbines,in the presence of various technical and technological constraints,makes the wind farm layout design problem a complex optimization problem.This problem has traditionally been solved with nature-inspired algorithms with promising results.The performance and convergence of nature-inspired algorithms depend on several parameters,among which the algorithm termination criterion plays a crucial role.Timely convergence is an important aspect of efficient algorithm design because an inefficient algorithm results in wasted computational resources,unwarranted electricity consumption,and hardware stress.This study provides an in-depth analysis of several termination criteria while using the genetic algorithm as a test bench,with its application to the wind farm layout design problem while considering various wind scenarios.The performance of six termination criteria is empirically evaluated with respect to the quality of solutions produced and the execution time involved.Due to the conflicting nature of these two attributes,fuzzy logic-based multi-attribute decision-making is employed in the decision process.Results for the fuzzy decision approach indicate that among the various criteria tested,the criterion Phi achieves an improvement in the range of 2.44%to 32.93%for wind scenario 1.For scenario 2,Best-worst termination criterion performed well compared to the other criteria evaluated,with an improvement in the range of 1.2%to 9.64%.For scenario 3,Hitting bound was the best performer with an improvement of 1.16%to 20.93%.
文摘This paper introduces an optimized planning approach for integrating photovoltaic as distributed generation (PV-DG) into the radial distribution power systems, utilizing exhaustive load flow (ELF), loss sensitivity factor (LSF), genetic algorithms (GA) methods, and numerical method based on LSF. The methodology aims to determine the optimal allocation and sizing of multiple PV-DG to minimize power loss through time series power flow analysis. An approach utilizing continuous sensitivity analysis is developed and inherently leverages power flow and loss equations to compute LSF of all buses in the system towards employing a dynamic PV-DG model for more accurate results. The algorithm uses a numerical grid search method to optimize PV-DG placement in a power distribution system, focusing on minimizing system losses. It combines iterative analysis, sensitivity assessment, and comprehensive visualization to identify and present the optimal PV-DG configurations. The present-ed algorithms are verified through co-simulation framework combining MATLAB and OpenDSS to carry out analysis for 12-bus radial distribution test system. The proposed numerical method is compared with other algorithms, such as ELF, LSF methods, and Genetic Algorithms (GA). Results show that the proposed numerical method performs well in comparison with LSF and ELF solutions.
文摘The research on optimization methods for constellation launch deployment strategies focused on the consideration of mission interval time constraints at the launch site.Firstly,a dynamic modeling of the constellation deployment process was established,and the relationship between the deployment window and the phase difference of the orbit insertion point,as well as the cost of phase adjustment after orbit insertion,was derived.Then,the combination of the constellation deployment position sequence was treated as a parameter,together with the sequence of satellite deployment intervals,as optimization variables,simplifying a highdimensional search problem within a wide range of dates to a finite-dimensional integer programming problem.An improved genetic algorithm with local search on deployment dates was introduced to optimize the launch deployment strategy.With the new description of the optimization variables,the total number of elements in the solution space was reduced by N orders of magnitude.Numerical simulation confirms that the proposed optimization method accelerates the convergence speed from hours to minutes.
文摘The objective of this study is to develop an advanced approach to variogram modelling by integrating genetic algorithms(GA)with machine learning-based linear regression,aiming to improve the accuracy and efficiency of geostatistical analysis,particularly in mineral exploration.The study combines GA and machine learning to optimise variogram parameters,including range,sill,and nugget,by minimising the root mean square error(RMSE)and maximising the coefficient of determination(R^(2)).The experimental variograms were computed and modelled using theoretical models,followed by optimisation via evolutionary algorithms.The method was applied to gravity data from the Ngoura-Batouri-Kette mining district in Eastern Cameroon,covering 141 data points.Sequential Gaussian Simulations(SGS)were employed for predictive mapping to validate simulated results against true values.Key findings show variograms with ranges between 24.71 km and 49.77 km,opti-mised RMSE and R^(2) values of 11.21 mGal^(2) and 0.969,respectively,after 42 generations of GA optimisation.Predictive mapping using SGS demonstrated that simulated values closely matched true values,with the simu-lated mean at 21.75 mGal compared to the true mean of 25.16 mGal,and variances of 465.70 mGal^(2) and 555.28 mGal^(2),respectively.The results confirmed spatial variability and anisotropies in the N170-N210 directions,consistent with prior studies.This work presents a novel integration of GA and machine learning for variogram modelling,offering an automated,efficient approach to parameter estimation.The methodology significantly enhances predictive geostatistical models,contributing to the advancement of mineral exploration and improving the precision and speed of decision-making in the petroleum and mining industries.
基金supported in part by the National Natural Science Foundation of China(Nos.62167003,52302421)in part by the Diversified Investment Fund of Tianjin,China(No.23JCQNJC00210)。
文摘Airports around the world commonly face challenges in managing airport slot allocation.Effective management of limited slot resources by civil aviation authority often requires redistributing requested slots among airlines.The allocation process must operate within the prescribed capacity limits of the airport while adhering to established priorities and regulations.Additionally,ensuring market fairness is a key objective,as the value of airport slots plays a significant role in the adjustment process.This transforms the traditional time-shift-based problem into a complex multi-objective optimization problem.Addressing such complications is of significant importance to airlines,airports,and passengers alike.Due to the complexity of fairness metrics,traditional integer programming models encounter difficulties in finding effective solutions.This study proposes a neighborhood search strategy to tackle the single airport slot allocation,making it adaptable to both static and rolling capacity scenarios.Two Genetic Algorithms(GAs)are introduced,corresponding to time adjustment and sequence adjustment strategies,respectively.The GA based on the time adjustment strategy demonstrates high robustness,while the sequence adjustment strategy builds upon this GA to develop a simple heuristic algorithm that offers rapid convergence.Case studies conducted at seven airports in China confirm that all three algorithms yield high-quality adjustment solutions suitable for the majority of applications.Further,Pareto analysis reveals that these algorithms effectively balance the adjustment shifts and fairness metrics,demonstrating high practical value and broad applicability.
基金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.
