In this research,an integrated classification method based on principal component analysis-simulated annealing genetic algorithm-fuzzy cluster means(PCA-SAGA-FCM)was proposed for the unsupervised classification of tig...In this research,an integrated classification method based on principal component analysis-simulated annealing genetic algorithm-fuzzy cluster means(PCA-SAGA-FCM)was proposed for the unsupervised classification of tight sandstone reservoirs which lack the prior information and core experiments.A variety of evaluation parameters were selected,including lithology characteristic parameters,poro-permeability quality characteristic parameters,engineering quality characteristic parameters,and pore structure characteristic parameters.The PCA was used to reduce the dimension of the evaluation pa-rameters,and the low-dimensional data was used as input.The unsupervised reservoir classification of tight sandstone reservoir was carried out by the SAGA-FCM,the characteristics of reservoir at different categories were analyzed and compared with the lithological profiles.The analysis results of numerical simulation and actual logging data show that:1)compared with FCM algorithm,SAGA-FCM has stronger stability and higher accuracy;2)the proposed method can cluster the reservoir flexibly and effectively according to the degree of membership;3)the results of reservoir integrated classification match well with the lithologic profle,which demonstrates the reliability of the classification method.展开更多
A hybrid feature selection and classification strategy was proposed based on the simulated annealing genetic algonthrn and multiple instance learning (MIL). The band selection method was proposed from subspace decom...A hybrid feature selection and classification strategy was proposed based on the simulated annealing genetic algonthrn and multiple instance learning (MIL). The band selection method was proposed from subspace decomposition, which combines the simulated annealing algorithm with the genetic algorithm in choosing different cross-over and mutation probabilities, as well as mutation individuals. Then MIL was combined with image segmentation, clustering and support vector machine algorithms to classify hyperspectral image. The experimental results show that this proposed method can get high classification accuracy of 93.13% at small training samples and the weaknesses of the conventional methods are overcome.展开更多
Under the condition of the designated collection ratio and the interfused ratio of mullock, to ensure the least energy consumption, the parameters of collecting head (the feed speed, the axes height of collecting hea...Under the condition of the designated collection ratio and the interfused ratio of mullock, to ensure the least energy consumption, the parameters of collecting head (the feed speed, the axes height of collecting head, and the rotate speed) are chosen as the optimized parameters. According to the force on the cutting pick, the collecting size of the cobalt crust and bedrock and the optimized energy consumption of the collecting head, the optimized design model of collecting head is built. Taking two hundred groups seabed microtopography for grand in the range of depth displacement from 4.5 to 5.5 era, then making use of the improved simulated annealing genetic algorithm (SAGA), the corresponding optimized result can be obtained. At the same time, in order to speed up the controlling of collecting head, the optimization results are analyzed using the regression analysis method, and the conclusion of the second parameter of the seabed microtopography is drawn.展开更多
The genetic algorithm and marching method are integrated into a novel algorithm to solve the surface intersection problem. By combining genetic algorithm with local searching method the efficiency of evolution is grea...The genetic algorithm and marching method are integrated into a novel algorithm to solve the surface intersection problem. By combining genetic algorithm with local searching method the efficiency of evolution is greatly improved. By fully utilizing the global searching ability and instinct attribute for parallel computation of genetic algorithm and the local rapid convergency of marching method, the algorithm can compute the intersection robustly and generate correct topology of intersection curves. The details of the new algorithm are discussed here.展开更多
A method of spectrum estimation based on the genetic simulated annealing(GSA)algorithm is proposed,which is applied to retrieve the three-dimensional wind field of typhoon Nangka observed by our research group.Compare...A method of spectrum estimation based on the genetic simulated annealing(GSA)algorithm is proposed,which is applied to retrieve the three-dimensional wind field of typhoon Nangka observed by our research group.Compared to the genetic algorithm(GA),the GSA algorithm not only extends the detection range and guarantees the accuracy of retrieval results but also demonstrates a faster retrieval speed.Experimental results indicate that both the GA and GSA algorithms can enhance the detection range by 35%more than the least squares method.However,the convergence speed of the GSA algorithm is 17 times faster than that of the GA,which is more beneficial for real-time data processing.展开更多
The premise and basis of load modeling are substation load composition inquiries and cluster analyses.However,the traditional kernel fuzzy C-means(KFCM)algorithm is limited by artificial clustering number selection an...The premise and basis of load modeling are substation load composition inquiries and cluster analyses.However,the traditional kernel fuzzy C-means(KFCM)algorithm is limited by artificial clustering number selection and its convergence to local optimal solutions.To overcome these limitations,an improved KFCM algorithm with adaptive optimal clustering number selection is proposed in this paper.This algorithm optimizes the KFCM algorithm by combining the powerful global search ability of genetic algorithm and the robust local search ability of simulated annealing algorithm.The improved KFCM algorithm adaptively determines the ideal number of clusters using the clustering evaluation index ratio.Compared with the traditional KFCM algorithm,the enhanced KFCM algorithm has robust clustering and comprehensive abilities,enabling the efficient convergence to the global optimal solution.展开更多
The test selection and optimization (TSO) can improve the abilities of fault diagnosis, prognosis and health-state evalua- tion for prognostics and health management (PHM) systems. Traditionally, TSO mainly focuse...The test selection and optimization (TSO) can improve the abilities of fault diagnosis, prognosis and health-state evalua- tion for prognostics and health management (PHM) systems. Traditionally, TSO mainly focuses on fault detection and isolation, but they cannot provide an effective guide for the design for testability (DFT) to improve the PHM performance level. To solve the problem, a model of TSO for PHM systems is proposed. Firstly, through integrating the characteristics of fault severity and propa- gation time, and analyzing the test timing and sensitivity, a testability model based on failure evolution mechanism model (FEMM) for PHM systems is built up. This model describes the fault evolution- test dependency using the fault-symptom parameter matrix and symptom parameter-test matrix. Secondly, a novel method of in- herent testability analysis for PHM systems is developed based on the above information. Having completed the analysis, a TSO model, whose objective is to maximize fault trackability and mini- mize the test cost, is proposed through inherent testability analysis results, and an adaptive simulated annealing genetic algorithm (ASAGA) is introduced to solve the TSO problem. Finally, a case of a centrifugal pump system is used to verify the feasibility and effectiveness of the proposed models and methods. The results show that the proposed technology is important for PHM systems to select and optimize the test set in order to improve their performance level.展开更多
Purpose–Flexible job-shop scheduling is significant for different manufacturing industries nowadays.Moreover,consideration of transportation time during scheduling makes it more practical and useful.The purpose of th...Purpose–Flexible job-shop scheduling is significant for different manufacturing industries nowadays.Moreover,consideration of transportation time during scheduling makes it more practical and useful.The purpose of this paper is to investigate multi-objective flexible job-shop scheduling problem(MOFJSP)considering transportation time.Design/methodology/approach–A hybrid genetic algorithm(GA)approach is integrated with simulated annealing to solve the MOFJSP considering transportation time,and an external elitism memory library is employed as a knowledge library to direct GA search into the region of better performance.Findings–The performance of the proposed algorithm is tested on different MOFJSP taken from literature.Experimental results show that proposed algorithm performs better than the original GA in terms of quality of solution and distribution of the solution,especially when the number of jobs and the flexibility of the machine increase.Originality/value–Most of existing studies have not considered the transportation time during scheduling of jobs.The transportation time is significantly desired to be included in the FJSP when the time of transportation of jobs has significant impact on the completion time of jobs.Meanwhile,GA is one of primary algorithms extensively used to address MOFJSP in literature.However,to solve the MOFJSP,the original GA has a possibility to get a premature convergence and it has a slow convergence speed.To overcome these problems,a new hybrid GA is developed in this paper.展开更多
The paper presents a procedure to design water network. First of all, water reuse system, water regeneration reuse system (including regeneration recycle) and wastewater treatment system are designed separately. But t...The paper presents a procedure to design water network. First of all, water reuse system, water regeneration reuse system (including regeneration recycle) and wastewater treatment system are designed separately. But the interaction between different parts demands that each part is designed iteratively to optimize the whole water network. Therefore, on the basis of the separated design a water netvrork superstructure including reuse, regeneration and wastewater treatment is established from the system engineering point of view. And a multi-objective adaptive simulated annealing genetic algorithm is adopted to simultaneously integrate the overall water netvrork to balance the economic and environmental effects. The algorithm overcomes the defect of local optimum of simulated annealing (SA), avoids the pre-maturation of genetic algorithm (GA) and finds a set of solutions (pareto front) in acceptable computer time. Prom the pareto front, a point with minimum fresh water consumption will be extended to zero discharge as our ultimate goal.展开更多
As an essential lifeline engineering system,water distribution network should provide enough water to maintain people's life after earthquake in addition to working under daily operation.However,the design of wate...As an essential lifeline engineering system,water distribution network should provide enough water to maintain people's life after earthquake in addition to working under daily operation.However,the design of water distribution network usually ignores the influence of earthquake,resulting in water stoppage in large area during many recent strong earthquakes.This study introduced a seismic design approach of water distribution network,i.e.,topology optimization design.With network topology as the optimization goal and seismic reliability as the constraint,a topology optimization model for designing water distribution network under earthquake is established.Meanwhile,two element investment importance indexes,a pipeline investment importance index and a diameter investment importance index,are introduced to evaluate the importance of pipelines in water distribution network.Then,four combinational optimization algorithms,a genetic algorithm,a simulated annealing genetic algorithm,an ant colony algorithm and a particle swarm algorithm,are introduced to solve this optimization model.Moreover,these optimization algorithms are used to optimize a network with 19 nodes and 27 pipelines.The optimization results of these algorithms are compared with each other.展开更多
基金funded by the National Natural Science Foundation of China(42174131)the Strategic Cooperation Technology Projects of CNPC and CUPB(ZLZX2020-03).
文摘In this research,an integrated classification method based on principal component analysis-simulated annealing genetic algorithm-fuzzy cluster means(PCA-SAGA-FCM)was proposed for the unsupervised classification of tight sandstone reservoirs which lack the prior information and core experiments.A variety of evaluation parameters were selected,including lithology characteristic parameters,poro-permeability quality characteristic parameters,engineering quality characteristic parameters,and pore structure characteristic parameters.The PCA was used to reduce the dimension of the evaluation pa-rameters,and the low-dimensional data was used as input.The unsupervised reservoir classification of tight sandstone reservoir was carried out by the SAGA-FCM,the characteristics of reservoir at different categories were analyzed and compared with the lithological profiles.The analysis results of numerical simulation and actual logging data show that:1)compared with FCM algorithm,SAGA-FCM has stronger stability and higher accuracy;2)the proposed method can cluster the reservoir flexibly and effectively according to the degree of membership;3)the results of reservoir integrated classification match well with the lithologic profle,which demonstrates the reliability of the classification method.
文摘A hybrid feature selection and classification strategy was proposed based on the simulated annealing genetic algonthrn and multiple instance learning (MIL). The band selection method was proposed from subspace decomposition, which combines the simulated annealing algorithm with the genetic algorithm in choosing different cross-over and mutation probabilities, as well as mutation individuals. Then MIL was combined with image segmentation, clustering and support vector machine algorithms to classify hyperspectral image. The experimental results show that this proposed method can get high classification accuracy of 93.13% at small training samples and the weaknesses of the conventional methods are overcome.
基金Project(50875265) supported by the National Natural Science Foundation of ChinaProject(20080440992) supported by the Postdoctoral Science Foundation of ChinaProject(2009SK3159) supported by the Technology Support Plan of Hunan Province,China
文摘Under the condition of the designated collection ratio and the interfused ratio of mullock, to ensure the least energy consumption, the parameters of collecting head (the feed speed, the axes height of collecting head, and the rotate speed) are chosen as the optimized parameters. According to the force on the cutting pick, the collecting size of the cobalt crust and bedrock and the optimized energy consumption of the collecting head, the optimized design model of collecting head is built. Taking two hundred groups seabed microtopography for grand in the range of depth displacement from 4.5 to 5.5 era, then making use of the improved simulated annealing genetic algorithm (SAGA), the corresponding optimized result can be obtained. At the same time, in order to speed up the controlling of collecting head, the optimization results are analyzed using the regression analysis method, and the conclusion of the second parameter of the seabed microtopography is drawn.
文摘The genetic algorithm and marching method are integrated into a novel algorithm to solve the surface intersection problem. By combining genetic algorithm with local searching method the efficiency of evolution is greatly improved. By fully utilizing the global searching ability and instinct attribute for parallel computation of genetic algorithm and the local rapid convergency of marching method, the algorithm can compute the intersection robustly and generate correct topology of intersection curves. The details of the new algorithm are discussed here.
基金supported by the Pre-research Project of Civilian Space(No.D040103)the Joint Project of National Natural Science Foundation of China(No.U23A20379)。
文摘A method of spectrum estimation based on the genetic simulated annealing(GSA)algorithm is proposed,which is applied to retrieve the three-dimensional wind field of typhoon Nangka observed by our research group.Compared to the genetic algorithm(GA),the GSA algorithm not only extends the detection range and guarantees the accuracy of retrieval results but also demonstrates a faster retrieval speed.Experimental results indicate that both the GA and GSA algorithms can enhance the detection range by 35%more than the least squares method.However,the convergence speed of the GSA algorithm is 17 times faster than that of the GA,which is more beneficial for real-time data processing.
基金supported by the Planning Special Project of Guangdong Power Grid Co.,Ltd.:“Study on load modeling based on total measurement and discrimination method suitable for system characteristic analysis and calculation during the implementation of target grid in Guangdong power grid”(0319002022030203JF00023).
文摘The premise and basis of load modeling are substation load composition inquiries and cluster analyses.However,the traditional kernel fuzzy C-means(KFCM)algorithm is limited by artificial clustering number selection and its convergence to local optimal solutions.To overcome these limitations,an improved KFCM algorithm with adaptive optimal clustering number selection is proposed in this paper.This algorithm optimizes the KFCM algorithm by combining the powerful global search ability of genetic algorithm and the robust local search ability of simulated annealing algorithm.The improved KFCM algorithm adaptively determines the ideal number of clusters using the clustering evaluation index ratio.Compared with the traditional KFCM algorithm,the enhanced KFCM algorithm has robust clustering and comprehensive abilities,enabling the efficient convergence to the global optimal solution.
基金supported by the National Natural Science Foundation of China(51175502)
文摘The test selection and optimization (TSO) can improve the abilities of fault diagnosis, prognosis and health-state evalua- tion for prognostics and health management (PHM) systems. Traditionally, TSO mainly focuses on fault detection and isolation, but they cannot provide an effective guide for the design for testability (DFT) to improve the PHM performance level. To solve the problem, a model of TSO for PHM systems is proposed. Firstly, through integrating the characteristics of fault severity and propa- gation time, and analyzing the test timing and sensitivity, a testability model based on failure evolution mechanism model (FEMM) for PHM systems is built up. This model describes the fault evolution- test dependency using the fault-symptom parameter matrix and symptom parameter-test matrix. Secondly, a novel method of in- herent testability analysis for PHM systems is developed based on the above information. Having completed the analysis, a TSO model, whose objective is to maximize fault trackability and mini- mize the test cost, is proposed through inherent testability analysis results, and an adaptive simulated annealing genetic algorithm (ASAGA) is introduced to solve the TSO problem. Finally, a case of a centrifugal pump system is used to verify the feasibility and effectiveness of the proposed models and methods. The results show that the proposed technology is important for PHM systems to select and optimize the test set in order to improve their performance level.
基金supported by National Social Science Foundation of China under the project of 18BGL003.
文摘Purpose–Flexible job-shop scheduling is significant for different manufacturing industries nowadays.Moreover,consideration of transportation time during scheduling makes it more practical and useful.The purpose of this paper is to investigate multi-objective flexible job-shop scheduling problem(MOFJSP)considering transportation time.Design/methodology/approach–A hybrid genetic algorithm(GA)approach is integrated with simulated annealing to solve the MOFJSP considering transportation time,and an external elitism memory library is employed as a knowledge library to direct GA search into the region of better performance.Findings–The performance of the proposed algorithm is tested on different MOFJSP taken from literature.Experimental results show that proposed algorithm performs better than the original GA in terms of quality of solution and distribution of the solution,especially when the number of jobs and the flexibility of the machine increase.Originality/value–Most of existing studies have not considered the transportation time during scheduling of jobs.The transportation time is significantly desired to be included in the FJSP when the time of transportation of jobs has significant impact on the completion time of jobs.Meanwhile,GA is one of primary algorithms extensively used to address MOFJSP in literature.However,to solve the MOFJSP,the original GA has a possibility to get a premature convergence and it has a slow convergence speed.To overcome these problems,a new hybrid GA is developed in this paper.
文摘The paper presents a procedure to design water network. First of all, water reuse system, water regeneration reuse system (including regeneration recycle) and wastewater treatment system are designed separately. But the interaction between different parts demands that each part is designed iteratively to optimize the whole water network. Therefore, on the basis of the separated design a water netvrork superstructure including reuse, regeneration and wastewater treatment is established from the system engineering point of view. And a multi-objective adaptive simulated annealing genetic algorithm is adopted to simultaneously integrate the overall water netvrork to balance the economic and environmental effects. The algorithm overcomes the defect of local optimum of simulated annealing (SA), avoids the pre-maturation of genetic algorithm (GA) and finds a set of solutions (pareto front) in acceptable computer time. Prom the pareto front, a point with minimum fresh water consumption will be extended to zero discharge as our ultimate goal.
基金supported by the Ministry of Science and Technology of China (Grant No. SLDRCE09-B-12)the Natural Science Funds for Young Scholars of China (Grant No.50808144)
文摘As an essential lifeline engineering system,water distribution network should provide enough water to maintain people's life after earthquake in addition to working under daily operation.However,the design of water distribution network usually ignores the influence of earthquake,resulting in water stoppage in large area during many recent strong earthquakes.This study introduced a seismic design approach of water distribution network,i.e.,topology optimization design.With network topology as the optimization goal and seismic reliability as the constraint,a topology optimization model for designing water distribution network under earthquake is established.Meanwhile,two element investment importance indexes,a pipeline investment importance index and a diameter investment importance index,are introduced to evaluate the importance of pipelines in water distribution network.Then,four combinational optimization algorithms,a genetic algorithm,a simulated annealing genetic algorithm,an ant colony algorithm and a particle swarm algorithm,are introduced to solve this optimization model.Moreover,these optimization algorithms are used to optimize a network with 19 nodes and 27 pipelines.The optimization results of these algorithms are compared with each other.