The K-means method is one of the most widely used clustering methods and has been implemented in many fields of science and technology. One of the major problems of the k-means algorithm is that it may produce empty c...The K-means method is one of the most widely used clustering methods and has been implemented in many fields of science and technology. One of the major problems of the k-means algorithm is that it may produce empty clusters depending on initial center vectors. Genetic Algorithms (GAs) are adaptive heuristic search algorithm based on the evolutionary principles of natural selection and genetics. This paper presents a hybrid version of the k-means algorithm with GAs that efficiently eliminates this empty cluster problem. Results of simulation experiments using several data sets prove our claim.展开更多
The dimensionality of data is increasing very rapidly,which creates challenges for most of the current mining and learning algorithms,such as large memory requirements and high computational costs.The literature inclu...The dimensionality of data is increasing very rapidly,which creates challenges for most of the current mining and learning algorithms,such as large memory requirements and high computational costs.The literature includes much research on feature selection for supervised learning.However,feature selection for unsupervised learning has only recently been studied.Finding the subset of features in unsupervised learning that enhances the performance is challenging since the clusters are indeterminate.This work proposes a hybrid technique for unsupervised feature selection called GAk-MEANS,which combines the genetic algorithm(GA)approach with the classical k-Means algorithm.In the proposed algorithm,a new fitness func-tion is designed in addition to new smart crossover and mutation operators.The effectiveness of this algorithm is demonstrated on various datasets.Fur-thermore,the performance of GAk-MEANS has been compared with other genetic algorithms,such as the genetic algorithm using the Sammon Error Function and the genetic algorithm using the Sum of Squared Error Function.Additionally,the performance of GAk-MEANS is compared with the state-of-the-art statistical unsupervised feature selection techniques.Experimental results show that GAk-MEANS consistently selects subsets of features that result in better classification accuracy compared to others.In particular,GAk-MEANS is able to significantly reduce the size of the subset of selected features by an average of 86.35%(72%–96.14%),which leads to an increase of the accuracy by an average of 3.78%(1.05%–6.32%)compared to using all features.When compared with the genetic algorithm using the Sammon Error Function,GAk-MEANS is able to reduce the size of the subset of selected features by 41.29%on average,improve the accuracy by 5.37%,and reduce the time by 70.71%.When compared with the genetic algorithm using the Sum of Squared Error Function,GAk-MEANS on average is able to reduce the size of the subset of selected features by 15.91%,and improve the accuracy by 9.81%,but the time is increased by a factor of 3.When compared with the machine-learning based methods,we observed that GAk-MEANS is able to increase the accuracy by 13.67%on average with an 88.76%average increase in time.展开更多
A global seventh-order dissipative compact finite-difference scheme is optimized in terms of time stability. The dissipative parameters appearing in the boundary closures are assumed to be different, resulting in an o...A global seventh-order dissipative compact finite-difference scheme is optimized in terms of time stability. The dissipative parameters appearing in the boundary closures are assumed to be different, resulting in an optimization problem with several parameters determined by applying a generic algorithm. The optimized schemes are analyzed carefully from the aspects of the eigenvalue distribution, the ε-pseudospectra, the short time behavior, and the Fourier analysis. Numerical experiments for the Euler equations are used to show the effectiveness of the final recommended scheme.展开更多
The task assignment problem of multiple heterogeneous unmanned aerial vehicles （UAVs）, concerned with cooperative decision making and control, is studied in this paper. The heterogeneous vehicles have different oper...The task assignment problem of multiple heterogeneous unmanned aerial vehicles （UAVs）, concerned with cooperative decision making and control, is studied in this paper. The heterogeneous vehicles have different operational capabilities and kinematic constraints, and carry limited resources （e.g., weapons） onboard. They are designated to perform multiple consecutive tasks cooperatively on multiple ground targets. The problem becomes much more complicated because of these terms of heterogeneity. In order to tackle the challenge, we modify the former genetic algorithm with multi-type genes to stochastically search a best solution. Genes of chromo- somes are different, and they are assorted into several types according to the tasks that must be performed on targets. Different types of genes are processed specifically in the improved genetic operators including initialization, crossover, and mutation. We also present a mirror representation of vehicles to deal with the limited resource constraint. Feasible chromosomes that vehicles could perform tasks using their limited resources under the assignment are created and evolved by genetic operators. The effect of the proposed algorithm is demonstrated in numerical simulations. The results show that it effectively provides good feasible solutions and finds an optimal one.展开更多
In microarray-based cancer classification, gene selection is an important issue owing to the large number of variables and small number of samples as well as its non-linearity. It is difficult to get satisfying result...In microarray-based cancer classification, gene selection is an important issue owing to the large number of variables and small number of samples as well as its non-linearity. It is difficult to get satisfying results by using conventional linear sta- tistical methods. Recursive feature elimination based on support vector machine (SVM RFE) is an effective algorithm for gene selection and cancer classification, which are integrated into a consistent framework. In this paper, we propose a new method to select parameters of the aforementioned algorithm implemented with Gaussian kernel SVMs as better alternatives to the common practice of selecting the apparently best parameters by using a genetic algorithm to search for a couple of optimal parameter. Fast implementation issues for this method are also discussed for pragmatic reasons. The proposed method was tested on two repre- sentative hereditary breast cancer and acute leukaemia datasets. The experimental results indicate that the proposed method per- forms well in selecting genes and achieves high classification accuracies with these genes.展开更多
Based on the analysis of previous genetic algorithms (GAs) for TSP, a novel method called Ge- GA is proposed. It combines gene pool and GA so as to direct the evolution of the whole population. The core of Ge- GA is t...Based on the analysis of previous genetic algorithms (GAs) for TSP, a novel method called Ge- GA is proposed. It combines gene pool and GA so as to direct the evolution of the whole population. The core of Ge- GA is the construction of gene pool and how to apply it to GA. Different from standard GAs, Ge- GA aims to enhance the ability of exploration and exploitation by incorporating global search with local search. On one hand a local search called Ge- Lo-calSearch operator is proposed to improve the solution quality, on the other hand the modified Inver-Over operator called Ge InverOver is considered as a global search mechanism to expand solution space of local minimal. Both of these operators are based on the gene pool. Our algorithm is applied to 11 well-known traveling salesman problems whose numbers of cities are from 70 to 1577 cities. The experiments results indicate that Ge- GA has great robustness for TSP. For each test instance, the average value of solution quality, found in accepted time, stays within 0. 001% from the optimum.展开更多
The joint location planning of charging/battery-swap facilities for electric vehicles is a complex problem.Considering the differences between these two modes of power replenishment,we constructed a joint location-pla...The joint location planning of charging/battery-swap facilities for electric vehicles is a complex problem.Considering the differences between these two modes of power replenishment,we constructed a joint location-planning model to minimize construction and operation costs,user costs,and user satisfaction-related penalty costs.We designed an improved genetic algorithm that changes the crossover rate using the fitness value,memorizes,and transfers excellent genes.In addition,the present model addresses the problem of“premature convergence”in conventional genetic algorithms.A simulated example revealed that our proposed model could provide a basis for optimized location planning of charging/battery-swapping facilities at different levels under different charging modes with an improved computing efficiency.The example also proved that meeting more demand for power supply of electric vehicles does not necessarily mean increasing the sites of charging/battery-swap stations.Instead,optimizing the level and location planning of charging/battery-swap stations can maximize the investment profit.The proposed model can provide a reference for the government and enterprises to better plan the location of charging/battery-swap facilities.Hence,it is of both theoretical and practical value.展开更多
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.展开更多
In this paper the Hamming distance is used to contr ol individual difference in the process of creating an original population, and a peak-depot is established to preserve information of different peak-points. So me n...In this paper the Hamming distance is used to contr ol individual difference in the process of creating an original population, and a peak-depot is established to preserve information of different peak-points. So me new methods are also put forward to improve optimization performance of genet ic algorithm, such as point-cast method and neighborhood search strategy around peak-points. The methods are used to deal with genetic operation besides of cr ossover and mutation, in order to obtain a global optimum solution and avoid GA ’s premature convergence. By means of many control rules and a peak-depot, the new algorithm carries out optimum search surrounding several peak-points. Alon g with evolution of individuals of population, the fitness of peak-points of pe ak-depot increases continually, and a global optimum solution can be obtained. The new algorithm searches around several peak-points, which increases the prob ability to obtain the global optimum solution to the best. By using some example s to test the modified genetic algorithm, the results indicate what we have done makes the modified genetic algorithm effectively to solve both of linear optimi zation problems and nonlinear optimization problems with restrictive functions.展开更多
This paper presents a new algorithm for solving unit commitment (UC) problems using a binary-real coded genetic algorithm based on k-means clustering technique. UC is a NP-hard nonlinear mixed-integer optimization pro...This paper presents a new algorithm for solving unit commitment (UC) problems using a binary-real coded genetic algorithm based on k-means clustering technique. UC is a NP-hard nonlinear mixed-integer optimization problem, encountered as one of the toughest problems in power systems, in which some power generating units are to be scheduled in such a way that the forecasted demand is met at minimum production cost over a time horizon. In the proposed algorithm, the algorithm integrates the main features of a binary-real coded genetic algorithm (GA) and k-means clustering technique. The binary coded GA is used to obtain a feasible commitment schedule for each generating unit;while the power amounts generated by committed units are determined by using real coded GA for the feasible commitment obtained in each interval. k-means clustering algorithm divides population into a specific number of subpopulations with dynamic size. In this way, using k-means clustering algorithm allows the use of different GA operators with the whole population and avoids the local problem minima. The effectiveness of the proposed technique is validated on a test power system available in the literature. The proposed algorithm performance is found quite satisfactory in comparison with the previously reported results.展开更多
With the exponential development of mobile communications and the miniaturization of radio frequency transceivers, the need for small and low profile antennas at mobile frequencies is constantly growing. Therefore, ne...With the exponential development of mobile communications and the miniaturization of radio frequency transceivers, the need for small and low profile antennas at mobile frequencies is constantly growing. Therefore, new antennas should be developed to provide larger bandwidth and at the same time small dimensions. Although the gain in bandwidth performances of an antenna are directly related to its dimensions in relation to the wavelength, the aim is to keep the overall size of the antenna constant and from there, find the geometry and structure that give the best performance. The design and bandwidth optimization of a Planar Inverted-F Antenna (PIFA) were introduced in order to achieve a larger bandwidth in the 2 GHz band, using two optimization techniques based upon genetic algorithms (GA), namely the Binary Coded GA (BCGA) and Real-Coded GA (RCGA). During the optimization process, the different PIFA models were evaluated using the finite-difference time domain (FDTD) method-a technique belonging to the general class of differential time domain numerical modeling methods.展开更多
Although the phase-shift seismic processing method has characteristics of high accuracy, good stability, high efficiency, and high-dip imaging, it is not able to adapt to strong lateral velocity variation. To overcome...Although the phase-shift seismic processing method has characteristics of high accuracy, good stability, high efficiency, and high-dip imaging, it is not able to adapt to strong lateral velocity variation. To overcome this defect, a finite-difference method in the frequency-space domain is introduced in the migration process, because it can adapt to strong lateral velocity variation and the coefficient is optimized by a hybrid genetic and simulated annealing algorithm. The two measures improve the precision of the approximation dispersion equation. Thus, the imaging effect is improved for areas of high-dip structure and strong lateral velocity variation. The migration imaging of a 2-D SEG/EAGE salt dome model proves that a better imaging effect in these areas is achieved by optimized phase-shift migration operator plus a finite-difference method based on a hybrid genetic and simulated annealing algorithm. The method proposed in this paper is better than conventional methods in imaging of areas of high-dip angle and strong lateral velocity variation.展开更多
We present a global optimization method, called the genetic algorithms (GAs), for digital image/speckle correlation (DISC). The new algorithms do not involve reasonable initial guess of displacement and deformation gr...We present a global optimization method, called the genetic algorithms (GAs), for digital image/speckle correlation (DISC). The new algorithms do not involve reasonable initial guess of displacement and deformation gradient and the calculation of second-order spatial derivatives of the digital images, which are important challenges in practical implementation of DISC. The performance of a GA depends largely on the selection of the genetic operators. We test various operators and propose optimal operators. The algorithms are then verified using simulated images and experimental speckle images.展开更多
Parameters identification of rockfill materials is a crucial issue for high rockfill dams. Because of the scale effect, random sampling and sample disturbance, it is difficult to obtain the actual mechanical propertie...Parameters identification of rockfill materials is a crucial issue for high rockfill dams. Because of the scale effect, random sampling and sample disturbance, it is difficult to obtain the actual mechanical properties of rockfill from laboratory tests. Parameters inversion based on in situ monitoring data has been proven to be an efficient method for identifying the exact parameters of the rockfill. In this paper, we propose a modified genetic algorithm to solve the high-dimension multimodal and nonlinear optimal parameters inversion problem. A novel crossover operator based on the sum of differences in gene fragments(So DX) is proposed, inspired by the cloning of superior genes in genetic engineering. The crossover points are selected according to the difference in the gene fragments, defining the adaptive length. The crossover operator increases the speed and accuracy of algorithm convergence by reducing the inbreeding and enhancing the global search capability of the genetic algorithm. This algorithm is compared with two existing crossover operators. The modified genetic algorithm is then used in combination with radial basis function neural networks(RBFNN) to perform the parameters back analysis of a high central earth core rockfill dam. The settlements simulated using the identified parameters show good agreement with the monitoring data, illustrating that the back analysis is reasonable and accurate. The proposed genetic algorithm has considerable superiority for nonlinear multimodal parameter identification problems.展开更多
The Intrusion Detection System(IDS)is a security mechanism developed to observe network traffic and recognize suspicious or malicious activities.Clustering algorithms are often incorporated into IDS;however,convention...The Intrusion Detection System(IDS)is a security mechanism developed to observe network traffic and recognize suspicious or malicious activities.Clustering algorithms are often incorporated into IDS;however,conventional clustering-based methods face notable drawbacks,including poor scalability in handling high-dimensional datasets and a strong dependence of outcomes on initial conditions.To overcome the performance limitations of existing methods,this study proposes a novel quantum-inspired clustering algorithm that relies on a similarity coefficient-based quantum genetic algorithm(SC-QGA)and an improved quantum artificial bee colony algorithm hybrid K-means(IQABC-K).First,the SC-QGA algorithmis constructed based on quantum computing and integrates similarity coefficient theory to strengthen genetic diversity and feature extraction capabilities.For the subsequent clustering phase,the process based on the IQABC-K algorithm is enhanced with the core improvement of adaptive rotation gate and movement exploitation strategies to balance the exploration capabilities of global search and the exploitation capabilities of local search.Simultaneously,the acceleration of convergence toward the global optimum and a reduction in computational complexity are facilitated by means of the global optimum bootstrap strategy and a linear population reduction strategy.Through experimental evaluation with multiple algorithms and diverse performance metrics,the proposed algorithm confirms reliable accuracy on three datasets:KDD CUP99,NSL_KDD,and UNSW_NB15,achieving accuracy of 98.57%,98.81%,and 98.32%,respectively.These results affirm its potential as an effective solution for practical clustering applications.展开更多
This study aimed to develop a neural network(NN)-based method to predict the long-term mean radiant temperature(MRT)around buildings by using meteorological parameters as training data.The MRT dramatically impacts bui...This study aimed to develop a neural network(NN)-based method to predict the long-term mean radiant temperature(MRT)around buildings by using meteorological parameters as training data.The MRT dramatically impacts building energy consumption and significantly affects outdoor thermal comfort.In NN-based long-term MRT prediction,two main restrictions must be overcome to achieve precise results:first,the difficulty of preparing numerous training datasets;second,the challenge of developing an accurate NN model.To overcome these restrictions,a combination of principal component analysis(PCA)and K-means clustering was employed to reduce the training data while maintaining high prediction accuracy.Second,three widely used NN models(feedforward NN(FFNN),backpropagation NN(BPNN),and BPNN optimized using a genetic algorithm(GA-BPNN))were compared to identify the NN with the best long-term MRT prediction performance.The performances of the tested NNs were evaluated using the mean absolute percentage error(MAPE),which was≤3%in each case.The findings indicate that the training dataset was reduced effectively by the PCA and K-means.Among the three NNs,the GA-BPNN produced the most accurate results,with its MAPE being below 1%.This study will contribute to the development of fast and feasible outdoor thermal environment prediction.展开更多
Multi-objective genetic algorithm is much suitable for solving multi-objective optimization problems. By use of Genetic algorithm, the optimization of S-boxes is explored in this paper. Results of the experiments show...Multi-objective genetic algorithm is much suitable for solving multi-objective optimization problems. By use of Genetic algorithm, the optimization of S-boxes is explored in this paper. Results of the experiments show that, with heuristic mutation strategy, the algorithm has high searching efficiency and fast convergence speed. Meanwhile, we also have take the avalanche probability of S-boxes into account, besides nonlinearity and difference uniformity. Under this method, an effective genetic algorithm for 6×6 S-boxes is provided and a number of S-boxes with good cryptographic capability can be obtained.展开更多
The micro-genetic algorithm (MGA) optimization combined with the finite-difference time-domain (FDTD) method is applied to design a band-notched ultra wide-band (UWB) antenna. A U-type slot on a stepped U-type UWB mon...The micro-genetic algorithm (MGA) optimization combined with the finite-difference time-domain (FDTD) method is applied to design a band-notched ultra wide-band (UWB) antenna. A U-type slot on a stepped U-type UWB monopole is used to obtain the band-notched characteristic for 5 GHz wireless local area network (WLAN) band. The measured results show that voltage standing wave ration (VSWR) less than 2 covers 3.1-10.6 GHz operating band and VSWR more than 2 is within 5.150-5.825 GHz notched one with the highest value of 5.6. Agreement among the calculated, HFSS simulated and measured results validates the effiectiveness of this MGA-FDTD method, which is efficient for UWB antennas design.展开更多
A method combining finite difference method(FDM)and k-means clustering algorithm which can determine the threshold of rock bridge generation is proposed.Jointed slope models with different joint coalescence coefficien...A method combining finite difference method(FDM)and k-means clustering algorithm which can determine the threshold of rock bridge generation is proposed.Jointed slope models with different joint coalescence coefficients(k)are constructed based on FDM.The rock bridge area was divided through k-means algorithm and the optimal number of clusters was determined by sum of squared errors(SSE)and elbow method.The influence of maximum principal stress and stress change rate as clustering indexes on the clustering results of rock bridges was compared by using Euclidean distance.The results show that using stress change rate as clustering index is more effective.When the joint coalescence coefficient is less than 0.6,there is no significant stress concentration in the middle area of adjacent joints,that is,no generation of rock bridge.In addition,the range of rock bridge is affected by the coalescence coefficient(k),the relative position of joints and the parameters of weak interlayer.展开更多
Based on the rapid genetic algorithm(RGA),the band gap structures of square lattices with square scatters are optimized.In the optimizing process,gene codes are used to express square scatters and the fitting function...Based on the rapid genetic algorithm(RGA),the band gap structures of square lattices with square scatters are optimized.In the optimizing process,gene codes are used to express square scatters and the fitting function adopts the relative values of the largest absolute photonic band gaps(PBGs).By changing the value of filling factor,three cell forms with large photonic band gaps are obtained.In addition,the comparison between the rapid genetic algorithm and the general genetic algorithm(GGA) is analyzed.展开更多
文摘The K-means method is one of the most widely used clustering methods and has been implemented in many fields of science and technology. One of the major problems of the k-means algorithm is that it may produce empty clusters depending on initial center vectors. Genetic Algorithms (GAs) are adaptive heuristic search algorithm based on the evolutionary principles of natural selection and genetics. This paper presents a hybrid version of the k-means algorithm with GAs that efficiently eliminates this empty cluster problem. Results of simulation experiments using several data sets prove our claim.
文摘The dimensionality of data is increasing very rapidly,which creates challenges for most of the current mining and learning algorithms,such as large memory requirements and high computational costs.The literature includes much research on feature selection for supervised learning.However,feature selection for unsupervised learning has only recently been studied.Finding the subset of features in unsupervised learning that enhances the performance is challenging since the clusters are indeterminate.This work proposes a hybrid technique for unsupervised feature selection called GAk-MEANS,which combines the genetic algorithm(GA)approach with the classical k-Means algorithm.In the proposed algorithm,a new fitness func-tion is designed in addition to new smart crossover and mutation operators.The effectiveness of this algorithm is demonstrated on various datasets.Fur-thermore,the performance of GAk-MEANS has been compared with other genetic algorithms,such as the genetic algorithm using the Sammon Error Function and the genetic algorithm using the Sum of Squared Error Function.Additionally,the performance of GAk-MEANS is compared with the state-of-the-art statistical unsupervised feature selection techniques.Experimental results show that GAk-MEANS consistently selects subsets of features that result in better classification accuracy compared to others.In particular,GAk-MEANS is able to significantly reduce the size of the subset of selected features by an average of 86.35%(72%–96.14%),which leads to an increase of the accuracy by an average of 3.78%(1.05%–6.32%)compared to using all features.When compared with the genetic algorithm using the Sammon Error Function,GAk-MEANS is able to reduce the size of the subset of selected features by 41.29%on average,improve the accuracy by 5.37%,and reduce the time by 70.71%.When compared with the genetic algorithm using the Sum of Squared Error Function,GAk-MEANS on average is able to reduce the size of the subset of selected features by 15.91%,and improve the accuracy by 9.81%,but the time is increased by a factor of 3.When compared with the machine-learning based methods,we observed that GAk-MEANS is able to increase the accuracy by 13.67%on average with an 88.76%average increase in time.
基金Project supported by the National Natural Science Foundation of China(Nos.11601517,11502296,61772542,and 61561146395)the Basic Research Foundation of National University of Defense Technology(No.ZDYYJ-CYJ20140101)
文摘A global seventh-order dissipative compact finite-difference scheme is optimized in terms of time stability. The dissipative parameters appearing in the boundary closures are assumed to be different, resulting in an optimization problem with several parameters determined by applying a generic algorithm. The optimized schemes are analyzed carefully from the aspects of the eigenvalue distribution, the ε-pseudospectra, the short time behavior, and the Fourier analysis. Numerical experiments for the Euler equations are used to show the effectiveness of the final recommended scheme.
文摘The task assignment problem of multiple heterogeneous unmanned aerial vehicles （UAVs）, concerned with cooperative decision making and control, is studied in this paper. The heterogeneous vehicles have different operational capabilities and kinematic constraints, and carry limited resources （e.g., weapons） onboard. They are designated to perform multiple consecutive tasks cooperatively on multiple ground targets. The problem becomes much more complicated because of these terms of heterogeneity. In order to tackle the challenge, we modify the former genetic algorithm with multi-type genes to stochastically search a best solution. Genes of chromo- somes are different, and they are assorted into several types according to the tasks that must be performed on targets. Different types of genes are processed specifically in the improved genetic operators including initialization, crossover, and mutation. We also present a mirror representation of vehicles to deal with the limited resource constraint. Feasible chromosomes that vehicles could perform tasks using their limited resources under the assignment are created and evolved by genetic operators. The effect of the proposed algorithm is demonstrated in numerical simulations. The results show that it effectively provides good feasible solutions and finds an optimal one.
基金Project supported by the National Basic Research Program (973) of China (No. 2002CB312200) and the Center for Bioinformatics Pro-gram Grant of Harvard Center of Neurodegeneration and Repair,Harvard Medical School, Harvard University, Boston, USA
文摘In microarray-based cancer classification, gene selection is an important issue owing to the large number of variables and small number of samples as well as its non-linearity. It is difficult to get satisfying results by using conventional linear sta- tistical methods. Recursive feature elimination based on support vector machine (SVM RFE) is an effective algorithm for gene selection and cancer classification, which are integrated into a consistent framework. In this paper, we propose a new method to select parameters of the aforementioned algorithm implemented with Gaussian kernel SVMs as better alternatives to the common practice of selecting the apparently best parameters by using a genetic algorithm to search for a couple of optimal parameter. Fast implementation issues for this method are also discussed for pragmatic reasons. The proposed method was tested on two repre- sentative hereditary breast cancer and acute leukaemia datasets. The experimental results indicate that the proposed method per- forms well in selecting genes and achieves high classification accuracies with these genes.
基金Supported by the National Natural Science Foundation of China(70071042,60073043,and 60133010)
文摘Based on the analysis of previous genetic algorithms (GAs) for TSP, a novel method called Ge- GA is proposed. It combines gene pool and GA so as to direct the evolution of the whole population. The core of Ge- GA is the construction of gene pool and how to apply it to GA. Different from standard GAs, Ge- GA aims to enhance the ability of exploration and exploitation by incorporating global search with local search. On one hand a local search called Ge- Lo-calSearch operator is proposed to improve the solution quality, on the other hand the modified Inver-Over operator called Ge InverOver is considered as a global search mechanism to expand solution space of local minimal. Both of these operators are based on the gene pool. Our algorithm is applied to 11 well-known traveling salesman problems whose numbers of cities are from 70 to 1577 cities. The experiments results indicate that Ge- GA has great robustness for TSP. For each test instance, the average value of solution quality, found in accepted time, stays within 0. 001% from the optimum.
文摘The joint location planning of charging/battery-swap facilities for electric vehicles is a complex problem.Considering the differences between these two modes of power replenishment,we constructed a joint location-planning model to minimize construction and operation costs,user costs,and user satisfaction-related penalty costs.We designed an improved genetic algorithm that changes the crossover rate using the fitness value,memorizes,and transfers excellent genes.In addition,the present model addresses the problem of“premature convergence”in conventional genetic algorithms.A simulated example revealed that our proposed model could provide a basis for optimized location planning of charging/battery-swapping facilities at different levels under different charging modes with an improved computing efficiency.The example also proved that meeting more demand for power supply of electric vehicles does not necessarily mean increasing the sites of charging/battery-swap stations.Instead,optimizing the level and location planning of charging/battery-swap stations can maximize the investment profit.The proposed model can provide a reference for the government and enterprises to better plan the location of charging/battery-swap facilities.Hence,it is of both theoretical and practical value.
文摘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.
文摘In this paper the Hamming distance is used to contr ol individual difference in the process of creating an original population, and a peak-depot is established to preserve information of different peak-points. So me new methods are also put forward to improve optimization performance of genet ic algorithm, such as point-cast method and neighborhood search strategy around peak-points. The methods are used to deal with genetic operation besides of cr ossover and mutation, in order to obtain a global optimum solution and avoid GA ’s premature convergence. By means of many control rules and a peak-depot, the new algorithm carries out optimum search surrounding several peak-points. Alon g with evolution of individuals of population, the fitness of peak-points of pe ak-depot increases continually, and a global optimum solution can be obtained. The new algorithm searches around several peak-points, which increases the prob ability to obtain the global optimum solution to the best. By using some example s to test the modified genetic algorithm, the results indicate what we have done makes the modified genetic algorithm effectively to solve both of linear optimi zation problems and nonlinear optimization problems with restrictive functions.
文摘This paper presents a new algorithm for solving unit commitment (UC) problems using a binary-real coded genetic algorithm based on k-means clustering technique. UC is a NP-hard nonlinear mixed-integer optimization problem, encountered as one of the toughest problems in power systems, in which some power generating units are to be scheduled in such a way that the forecasted demand is met at minimum production cost over a time horizon. In the proposed algorithm, the algorithm integrates the main features of a binary-real coded genetic algorithm (GA) and k-means clustering technique. The binary coded GA is used to obtain a feasible commitment schedule for each generating unit;while the power amounts generated by committed units are determined by using real coded GA for the feasible commitment obtained in each interval. k-means clustering algorithm divides population into a specific number of subpopulations with dynamic size. In this way, using k-means clustering algorithm allows the use of different GA operators with the whole population and avoids the local problem minima. The effectiveness of the proposed technique is validated on a test power system available in the literature. The proposed algorithm performance is found quite satisfactory in comparison with the previously reported results.
文摘With the exponential development of mobile communications and the miniaturization of radio frequency transceivers, the need for small and low profile antennas at mobile frequencies is constantly growing. Therefore, new antennas should be developed to provide larger bandwidth and at the same time small dimensions. Although the gain in bandwidth performances of an antenna are directly related to its dimensions in relation to the wavelength, the aim is to keep the overall size of the antenna constant and from there, find the geometry and structure that give the best performance. The design and bandwidth optimization of a Planar Inverted-F Antenna (PIFA) were introduced in order to achieve a larger bandwidth in the 2 GHz band, using two optimization techniques based upon genetic algorithms (GA), namely the Binary Coded GA (BCGA) and Real-Coded GA (RCGA). During the optimization process, the different PIFA models were evaluated using the finite-difference time domain (FDTD) method-a technique belonging to the general class of differential time domain numerical modeling methods.
基金the Open Fund(PLC201104)of State Key Laboratory of Oil and Gas Reservoir Geology and Exploitation (Chengdu University of Technology)the National Natural Science Foundation of China(No.61072073)the Key Project of Education Commission of Sichuan Province(No.10ZA072)
文摘Although the phase-shift seismic processing method has characteristics of high accuracy, good stability, high efficiency, and high-dip imaging, it is not able to adapt to strong lateral velocity variation. To overcome this defect, a finite-difference method in the frequency-space domain is introduced in the migration process, because it can adapt to strong lateral velocity variation and the coefficient is optimized by a hybrid genetic and simulated annealing algorithm. The two measures improve the precision of the approximation dispersion equation. Thus, the imaging effect is improved for areas of high-dip structure and strong lateral velocity variation. The migration imaging of a 2-D SEG/EAGE salt dome model proves that a better imaging effect in these areas is achieved by optimized phase-shift migration operator plus a finite-difference method based on a hybrid genetic and simulated annealing algorithm. The method proposed in this paper is better than conventional methods in imaging of areas of high-dip angle and strong lateral velocity variation.
基金This work was supported by 985 Education Development Plan of Tianjin University
文摘We present a global optimization method, called the genetic algorithms (GAs), for digital image/speckle correlation (DISC). The new algorithms do not involve reasonable initial guess of displacement and deformation gradient and the calculation of second-order spatial derivatives of the digital images, which are important challenges in practical implementation of DISC. The performance of a GA depends largely on the selection of the genetic operators. We test various operators and propose optimal operators. The algorithms are then verified using simulated images and experimental speckle images.
基金supported by the National Natural Science Foundation of China(Grant Nos.51379161&51509190)China Postdoctoral Science Foundation(Grant No.2015M572195)the Fundamental Research Funds for the Central Universities
文摘Parameters identification of rockfill materials is a crucial issue for high rockfill dams. Because of the scale effect, random sampling and sample disturbance, it is difficult to obtain the actual mechanical properties of rockfill from laboratory tests. Parameters inversion based on in situ monitoring data has been proven to be an efficient method for identifying the exact parameters of the rockfill. In this paper, we propose a modified genetic algorithm to solve the high-dimension multimodal and nonlinear optimal parameters inversion problem. A novel crossover operator based on the sum of differences in gene fragments(So DX) is proposed, inspired by the cloning of superior genes in genetic engineering. The crossover points are selected according to the difference in the gene fragments, defining the adaptive length. The crossover operator increases the speed and accuracy of algorithm convergence by reducing the inbreeding and enhancing the global search capability of the genetic algorithm. This algorithm is compared with two existing crossover operators. The modified genetic algorithm is then used in combination with radial basis function neural networks(RBFNN) to perform the parameters back analysis of a high central earth core rockfill dam. The settlements simulated using the identified parameters show good agreement with the monitoring data, illustrating that the back analysis is reasonable and accurate. The proposed genetic algorithm has considerable superiority for nonlinear multimodal parameter identification problems.
基金supported by the NSFC(Grant Nos.62176273,62271070,62441212)The Open Foundation of State Key Laboratory of Networking and Switching Technology(Beijing University of Posts and Telecommunications)under Grant SKLNST-2024-1-062025Major Project of the Natural Science Foundation of Inner Mongolia(2025ZD008).
文摘The Intrusion Detection System(IDS)is a security mechanism developed to observe network traffic and recognize suspicious or malicious activities.Clustering algorithms are often incorporated into IDS;however,conventional clustering-based methods face notable drawbacks,including poor scalability in handling high-dimensional datasets and a strong dependence of outcomes on initial conditions.To overcome the performance limitations of existing methods,this study proposes a novel quantum-inspired clustering algorithm that relies on a similarity coefficient-based quantum genetic algorithm(SC-QGA)and an improved quantum artificial bee colony algorithm hybrid K-means(IQABC-K).First,the SC-QGA algorithmis constructed based on quantum computing and integrates similarity coefficient theory to strengthen genetic diversity and feature extraction capabilities.For the subsequent clustering phase,the process based on the IQABC-K algorithm is enhanced with the core improvement of adaptive rotation gate and movement exploitation strategies to balance the exploration capabilities of global search and the exploitation capabilities of local search.Simultaneously,the acceleration of convergence toward the global optimum and a reduction in computational complexity are facilitated by means of the global optimum bootstrap strategy and a linear population reduction strategy.Through experimental evaluation with multiple algorithms and diverse performance metrics,the proposed algorithm confirms reliable accuracy on three datasets:KDD CUP99,NSL_KDD,and UNSW_NB15,achieving accuracy of 98.57%,98.81%,and 98.32%,respectively.These results affirm its potential as an effective solution for practical clustering applications.
基金This study was supported by a Grant-in-Aid for Challenging Research(Exploratory)(No.19K22004)the China Scholarship Council(No.201708430100).
文摘This study aimed to develop a neural network(NN)-based method to predict the long-term mean radiant temperature(MRT)around buildings by using meteorological parameters as training data.The MRT dramatically impacts building energy consumption and significantly affects outdoor thermal comfort.In NN-based long-term MRT prediction,two main restrictions must be overcome to achieve precise results:first,the difficulty of preparing numerous training datasets;second,the challenge of developing an accurate NN model.To overcome these restrictions,a combination of principal component analysis(PCA)and K-means clustering was employed to reduce the training data while maintaining high prediction accuracy.Second,three widely used NN models(feedforward NN(FFNN),backpropagation NN(BPNN),and BPNN optimized using a genetic algorithm(GA-BPNN))were compared to identify the NN with the best long-term MRT prediction performance.The performances of the tested NNs were evaluated using the mean absolute percentage error(MAPE),which was≤3%in each case.The findings indicate that the training dataset was reduced effectively by the PCA and K-means.Among the three NNs,the GA-BPNN produced the most accurate results,with its MAPE being below 1%.This study will contribute to the development of fast and feasible outdoor thermal environment prediction.
基金Supported by the National Natural Science Foundation of China (60473012)
文摘Multi-objective genetic algorithm is much suitable for solving multi-objective optimization problems. By use of Genetic algorithm, the optimization of S-boxes is explored in this paper. Results of the experiments show that, with heuristic mutation strategy, the algorithm has high searching efficiency and fast convergence speed. Meanwhile, we also have take the avalanche probability of S-boxes into account, besides nonlinearity and difference uniformity. Under this method, an effective genetic algorithm for 6×6 S-boxes is provided and a number of S-boxes with good cryptographic capability can be obtained.
基金supported by the Shanghai Leading Academic Discipline Project (Grant No.S30108)
文摘The micro-genetic algorithm (MGA) optimization combined with the finite-difference time-domain (FDTD) method is applied to design a band-notched ultra wide-band (UWB) antenna. A U-type slot on a stepped U-type UWB monopole is used to obtain the band-notched characteristic for 5 GHz wireless local area network (WLAN) band. The measured results show that voltage standing wave ration (VSWR) less than 2 covers 3.1-10.6 GHz operating band and VSWR more than 2 is within 5.150-5.825 GHz notched one with the highest value of 5.6. Agreement among the calculated, HFSS simulated and measured results validates the effiectiveness of this MGA-FDTD method, which is efficient for UWB antennas design.
基金supported by the National Natural Science Foundation of China(No.42277175)Guangxi Emergency Management Department 2024 Innovation and Technology Research Project,China(No.2024GXYJ006)+2 种基金Hunan Provincial Department of Natural Resources Geological Exploration Project,China(No.2023ZRBSHZ056)The First National Natural Disaster Comprehensive Risk Survey in Hunan Province,China(No.2022-70)Guizhou Provincial Major Scientific and Technological Program,China(No.2023-425).
文摘A method combining finite difference method(FDM)and k-means clustering algorithm which can determine the threshold of rock bridge generation is proposed.Jointed slope models with different joint coalescence coefficients(k)are constructed based on FDM.The rock bridge area was divided through k-means algorithm and the optimal number of clusters was determined by sum of squared errors(SSE)and elbow method.The influence of maximum principal stress and stress change rate as clustering indexes on the clustering results of rock bridges was compared by using Euclidean distance.The results show that using stress change rate as clustering index is more effective.When the joint coalescence coefficient is less than 0.6,there is no significant stress concentration in the middle area of adjacent joints,that is,no generation of rock bridge.In addition,the range of rock bridge is affected by the coalescence coefficient(k),the relative position of joints and the parameters of weak interlayer.
基金supported by the Natural Science Collaborating Foundation of Jiaying College and Meizhou Science and Techonolgy Bureau(No. 2009KJ08)
文摘Based on the rapid genetic algorithm(RGA),the band gap structures of square lattices with square scatters are optimized.In the optimizing process,gene codes are used to express square scatters and the fitting function adopts the relative values of the largest absolute photonic band gaps(PBGs).By changing the value of filling factor,three cell forms with large photonic band gaps are obtained.In addition,the comparison between the rapid genetic algorithm and the general genetic algorithm(GGA) is analyzed.
