Efficient multiple unmanned aerial vehicles(UAVs)path planning is crucial for improving mission completion efficiency in UAV operations.However,during the actual flight of UAVs,the flight time between nodes is always ...Efficient multiple unmanned aerial vehicles(UAVs)path planning is crucial for improving mission completion efficiency in UAV operations.However,during the actual flight of UAVs,the flight time between nodes is always influenced by external factors,making the original path planning solution ineffective.In this paper,the multi-depot multi-UAV path planning problem with uncertain flight time is modeled as a robust optimization model with a budget uncertainty set.Then,the robust optimization model is transformed into a mixed integer linear programming model by the strong duality theorem,which makes the problem easy to solve.To effectively solve large-scale instances,a simulated annealing algorithm with a robust feasibility check(SA-RFC)is developed.The numerical experiment shows that the SA-RFC can find high-quality solutions within a few seconds.Moreover,the effect of the task location distribution,depot counts,and variations in robustness parameters on the robust optimization solution is analyzed by using Monte Carlo experiments.The results demonstrate that the proposed robust model can effectively reduce the risk of the UAV failing to return to the depot without significantly compromising the profit.展开更多
Agile earth observation satellites(AEOSs)represent a new generation of satellites with three degrees of freedom(pitch,roll,and yaw);they possess a long visible time window(VTW)for ground targets and support imaging at...Agile earth observation satellites(AEOSs)represent a new generation of satellites with three degrees of freedom(pitch,roll,and yaw);they possess a long visible time window(VTW)for ground targets and support imaging at any moment within the VTW.However,different observation times demonstrate different cloud cover distributions,which exhibit different effects on the AEOS observation.Previous studies ignored pitch angles,discretized VTWs,or fixed cloud cover for every VTW,which led to the loss of intermediate observation states,thus these studies are not suitable for AEOS scheduling considering cloud cover distribution.In this study,a relationship formula between the cloud cover and observation time is proposed to calculate the cloud cover for every observation time,and a relationship formula between the observation time and pitch angle is designed to calculate the pitch angle for every observation time in the VTW.A refined model including the pitch angle,roll angle,and cloud cover distribution is established,which can make the scheme closer to the actual application of AEOSs.A hybrid genetic simulated annealing(HGSA)algorithm for AEOS scheduling is proposed,which integrates the advantages of genetic and simulated annealing algorithms and can effectively avoid falling into a local optimal solution.The experiments are conducted to compare the proposed algorithm with the traditional algorithms,the results verify that the proposed model and algorithm are efficient and effective for AEOS scheduling considering cloud cover distribution.展开更多
In order to enable quality-aware web services selection in the process of service composition,this paper first describes the non-functional requirements of service consumers and the quality of elementary service or co...In order to enable quality-aware web services selection in the process of service composition,this paper first describes the non-functional requirements of service consumers and the quality of elementary service or composite service as a quality vector,and then models the QoS（quality of service）-aware composition as a multiple criteria optimization problem in extending directed graph.A novel simulated annealing algorithm for QoS-aware web services composition is presented.A normalizing for composite service QoS values is made,and a secondary iterative optimization is used in the algorithm.Experimental results show that the simulated annealing algorithm can satisfy the multiple criteria and global QoS requirements of service consumers.The algorithm produces near optimum solution with much less computation cost.展开更多
The multi-stream heat exchanger network synthesis (HENS) problem can be formulated as a mixed integer nonlinear programming model according to Yee et al. Its nonconvexity nature leads to existence of more than one opt...The multi-stream heat exchanger network synthesis (HENS) problem can be formulated as a mixed integer nonlinear programming model according to Yee et al. Its nonconvexity nature leads to existence of more than one optimum and computational difficulty for traditional algorithms to find the global optimum. Compared with deterministic algorithms, evolutionary computation provides a promising approach to tackle this problem. In this paper, a mathematical model of multi-stream heat exchangers network synthesis problem is setup. Different from the assumption of isothermal mixing of stream splits and thus linearity constraints of Yee et al., non-isothermal mixing is supported. As a consequence, nonlinear constraints are resulted and nonconvexity of the objective function is added. To solve the mathematical model, an algorithm named GA/SA (parallel genetic/simulated annealing algorithm) is detailed for application to the multi-stream heat exchanger network synthesis problem. The performance of the proposed approach is demonstrated with three examples and the obtained solutions indicate the presented approach is effective for multi-stream HENS.展开更多
This article presents a simulated annealing-based approach to the optimal synthesis of distillation column considering intermediate heat exchangers arrangements. T-he number of intermediate condensers and/or intermedi...This article presents a simulated annealing-based approach to the optimal synthesis of distillation column considering intermediate heat exchangers arrangements. T-he number of intermediate condensers and/or intermediate reboilers, the placement locations, the.operating pressure of column, and the heat duties of intermediate heat exchangers are treated as optimization variables. A novel coding procedure making use of an integer number series is proposed to represent and manipulate the structure of system and a stage-to-stage method is used for column design and cost calculation. With the representation procedure, the synthesis problem is formulated as a mixed integer nonlinear programming （MINLP） problem, which can then be solved with an improved simulated annealing algorithm. Two examples are illustrated to show the effectiveness of the suggested approach.展开更多
In this paper combined with the advantages of genetic algorithm and simulated annealing, brings forward a parallel genetic simulated annealing hybrid algorithm （PGSAHA） and applied to solve task scheduling problem i...In this paper combined with the advantages of genetic algorithm and simulated annealing, brings forward a parallel genetic simulated annealing hybrid algorithm （PGSAHA） and applied to solve task scheduling problem in grid computing. It first generates a new group of individuals through genetic operation such as reproduction, crossover, mutation, etc, and than simulated anneals independently all the generated individuals respectively. When the temperature in the process of cooling no longer falls, the result is the optimal solution on the whole. From the analysis and experiment result, it is concluded that this algorithm is superior to genetic algorithm and simulated annealing.展开更多
In rough communication, because each agent has a different language and cannot provide precise communication to each other, the concept translated among multi-agents will loss some information and this results in a le...In rough communication, because each agent has a different language and cannot provide precise communication to each other, the concept translated among multi-agents will loss some information and this results in a less or rougher concept. With different translation sequences, the problem of information loss is varied. To get the translation sequence, in which the jth agent taking part in rough communication gets maximum information, a simulated annealing algorithm is used. Analysis and simulation of this algorithm demonstrate its effectiveness.展开更多
Disassembly sequence planning （DSP） plays a significant role in maintenance planning of the aircraft. It is used during the design stage for the analysis of maintainability of the aircraft. To solve product disassem...Disassembly sequence planning （DSP） plays a significant role in maintenance planning of the aircraft. It is used during the design stage for the analysis of maintainability of the aircraft. To solve product disassembly sequence planning problems efficiently, a product disassembly hybrid graph model, which describes the connection, non-connection and precedence relationships between the product parts, is established based on the characteristic of disassembly. Farther, the optimization model is provided to optimize disassembly sequence. And the solution methodology based on the genetic/simulated annealing algorithm with binaxy-tree algorithm is given. Finally, an example is analyzed in detail, and the result shows that the model is correct and efficient.展开更多
This paper establishes a mathematical model of multi-objective optimization with behavior constraints in solid space based on the problem of optimal design of hydraulic manifold blocks （HMB）. Due to the limitation o...This paper establishes a mathematical model of multi-objective optimization with behavior constraints in solid space based on the problem of optimal design of hydraulic manifold blocks （HMB）. Due to the limitation of its local search ability of genetic algorithm （GA） in solving a massive combinatorial optimization problem, simulated annealing （SA） is combined, the multi-parameter concatenated coding is adopted, and the memory function is added. Thus a hybrid genetic-simulated annealing with memory function is formed. Examples show that the modified algorithm can improve the local search ability in the solution space, and the solution quality.展开更多
At present,simultaneous localization and mapping(SLAM) for an autonomous underwater vehicle(AUV)is a research hotspot.Aiming at the problem of non-linear model and non-Gaussian noise in AUV motion,an improved method o...At present,simultaneous localization and mapping(SLAM) for an autonomous underwater vehicle(AUV)is a research hotspot.Aiming at the problem of non-linear model and non-Gaussian noise in AUV motion,an improved method of variance reduction fast simultaneous localization and mapping(FastSLAM) with simulated annealing is proposed to solve the problems of particle degradation,particle depletion and particle loss in traditional FastSLAM,which lead to the reduction of AUV location estimation accuracy.The adaptive exponential fading factor is generated by the anneal function of simulated annealing algorithm to improve the effective particle number and replace resampling.By increasing the weight of small particles and decreasing the weight of large particles,the variance of particle weight can be reduced,the number of effective particles can be increased,and the accuracy of AUV location and feature location estimation can be improved to some extent by retaining more information carried by particles.The experimental results based on trial data show that the proposed simulated annealing variance reduction FastSLAM method avoids particle degradation,maintains the diversity of particles,weakened the degeneracy and improves the accuracy and stability of AUV navigation and localization system.展开更多
In recent years, sinmlated annealing algo-rithms have been extensively developed and uti-lized to solve nmlti-objective optimization problems. In order to obtain better optimization perfonmnce, this paper proposes a N...In recent years, sinmlated annealing algo-rithms have been extensively developed and uti-lized to solve nmlti-objective optimization problems. In order to obtain better optimization perfonmnce, this paper proposes a Novel Adaptive Simulated Annealing （NASA） algorithm for constrained multi-objective optimization based on Archived Multi-objective Simulated Annealing （AMOSA）. For han-dling multi-objective, NASA makes improverrents in three aspects： sub-iteration search, sub-archive and adaptive search, which effectively strengthen the stability and efficiency of the algorithnm For handling constraints, NASA introduces corresponding solution acceptance criterion. Furtherrrore, NASA has also been applied to optimize TD-LTE network perform-ance by adjusting antenna paranleters; it can achieve better extension and convergence than AMOSA, NS-GAII and MOPSO. Analytical studies and simulations indicate that the proposed NASA algorithm can play an important role in improving multi-objective optimi-zation performance.展开更多
Surface wave methods are becoming increasingly popular in many geotechnical applications and in earthquake seismology due to their noninvasive characteristics.Inverse surface wave dispersion curves are a crucial step ...Surface wave methods are becoming increasingly popular in many geotechnical applications and in earthquake seismology due to their noninvasive characteristics.Inverse surface wave dispersion curves are a crucial step in most surface wave methods.Many inversion methods have been applied to surface wave dispersion curve inversion,including linearized inversion and nonlinearized inversion methods.In this study,a hybrid inversion method of Damped Least Squares(DLS) with Very Fast Simulated Annealing(VFSA) is developed for multi-mode Rayleigh wave dispersion curve inversion.Both synthetic and in situ fi eld data were used to verify the validity of the proposed method.The results show that the proposed method is superior to the conventional VFSA method in aiming at global minimum,especially when parameter searching space is adjacent to real values of the parameters.The advantage of the new method is that it retains both the merits of VFSA for global search and DLS for local search.At high temperatures,the global search dominates the runs,while at a low temperatures,the local search dominates the runs.Thus,at low temperatures,the proposed method can almost directly approach the actual model.展开更多
The research effort outlined the application of a computer aided design(CAD)-centric technique to the design and optimization of solid rocket motor Finocyl(fin in cylinder) grain using simulated annealing.The proper m...The research effort outlined the application of a computer aided design(CAD)-centric technique to the design and optimization of solid rocket motor Finocyl(fin in cylinder) grain using simulated annealing.The proper method for constructing the grain configuration model,ballistic performance and optimizer integration for analysis was presented.Finocyl is a complex grain configuration,requiring thirteen variables to define the geometry.The large number of variables not only complicates the geometrical construction but also optimization process.CAD representation encapsulates all of the geometric entities pertinent to the grain design in a parametric way,allowing manipulation of grain entity(web),performing regression and automating geometrical data calculations.Robustness to avoid local minima and efficient capacity to explore design space makes simulated annealing an attractive choice as optimizer.It is demonstrated with a constrained optimization of Finocyl grain geometry for homogeneous,isotropic propellant,uniform regression,and a quasi-steady,bulk mode internal ballistics model that maximizes average thrust for required deviations from neutrality.展开更多
Genetic Algorithm (GA) is a biologically inspired technique and widely used to solve numerous combinational optimization problems. It works on a population of individuals, not just one single solution. As a result, it...Genetic Algorithm (GA) is a biologically inspired technique and widely used to solve numerous combinational optimization problems. It works on a population of individuals, not just one single solution. As a result, it avoids converging to the local optimum. However, it takes too much CPU time in the late process of GA. On the other hand, in the late process Simulated Annealing (SA) converges faster than GA but it is easily trapped to local optimum. In this letter, a useful method that unifies GA and SA is introduced, which utilizes the advantage of the global search ability of GA and fast convergence of SA. The experimental results show that the proposed algorithm outperforms GA in terms of CPU time without degradation of performance. It also achieves highly comparable placement cost compared to the state-of-the-art results obtained by Versatile Place and Route (VPR) Tool.展开更多
In large loop transient electromagnetic method(TEM),the late time apparent resistivity formula cannot truly reflect the geoelectric model,thus it needs to define the all-time apparent resistivity with the position inf...In large loop transient electromagnetic method(TEM),the late time apparent resistivity formula cannot truly reflect the geoelectric model,thus it needs to define the all-time apparent resistivity with the position information of measuring point.Utilizing very fast simulated annealing(VFSA) to fit the theoretical electromagnetic force(EMF) and measured EMF could obtain the all-time apparent resistivity of the measuring points in rectangular transmitting loop.The selective cope of initial model of VFSA could be confirmed by taking the late time apparent resistivity of transient electromagnetic method as the prior information.For verifying the correctness,the all-time apparent resistivities of the geoelectric models were calculated by VFSA and dichotomy,respectively.The results indicate that the relative differences of apparent resistivities calculated by these two methods are within 3%.The change of measuring point position has little influence on the tracing pattern of all-time apparent resistivity.The first branch of the curve of all-time apparent resistivity is close to the resistivity of the first layer medium and the last branch is close to the resistivity of the last layer medium,which proves the correctness of the arithmetics proposed.展开更多
Imbalanced data classification is one of the major problems in machine learning.This imbalanced dataset typically has significant differences in the number of data samples between its classes.In most cases,the perform...Imbalanced data classification is one of the major problems in machine learning.This imbalanced dataset typically has significant differences in the number of data samples between its classes.In most cases,the performance of the machine learning algorithm such as Support Vector Machine(SVM)is affected when dealing with an imbalanced dataset.The classification accuracy is mostly skewed toward the majority class and poor results are exhibited in the prediction of minority-class samples.In this paper,a hybrid approach combining data pre-processing technique andSVMalgorithm based on improved Simulated Annealing(SA)was proposed.Firstly,the data preprocessing technique which primarily aims at solving the resampling strategy of handling imbalanced datasets was proposed.In this technique,the data were first synthetically generated to equalize the number of samples between classes and followed by a reduction step to remove redundancy and duplicated data.Next is the training of a balanced dataset using SVM.Since this algorithm requires an iterative process to search for the best penalty parameter during training,an improved SA algorithm was proposed for this task.In this proposed improvement,a new acceptance criterion for the solution to be accepted in the SA algorithm was introduced to enhance the accuracy of the optimization process.Experimental works based on ten publicly available imbalanced datasets have demonstrated higher accuracy in the classification tasks using the proposed approach in comparison with the conventional implementation of SVM.Registering at an average of 89.65%of accuracy for the binary class classification has demonstrated the good performance of the proposed works.展开更多
Cascade refrigeration system(CRS)can meet a wider range of refrigeration temperature requirements and is more energy efficient than single-refrigerant refrigeration system,making it more widely used in low-temperature...Cascade refrigeration system(CRS)can meet a wider range of refrigeration temperature requirements and is more energy efficient than single-refrigerant refrigeration system,making it more widely used in low-temperature industry processes.The synthesis of a CRS with simultaneous consideration of heat integration between refrigerant and process streams is challenging but promising for significant cost saving and reduction of carbon emission.This study presented a stochastic optimization method for the synthesis of CRS.An MINLP model was formulated based on the superstructure developed for the CRS,and an optimization framework was proposed,where simulated annealing algorithm was used to evolve the numbers of pressure/temperature levels for all sub-refrigeration systems,and particle swarm optimization algorithm was employed to optimize the continuous variables.The effectiveness of the proposed methodology was verified by a case study of CRS optimization in an ethylene plant with 21.89%the total annual cost saving.展开更多
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.展开更多
The minimum-energy configurations and energetic properties of the ArN-CO2 （N=1-19） van der Waals clusters were investigated by a simulated annealing algorithm. A newly developed Ar-CO2 potential energy surface toget...The minimum-energy configurations and energetic properties of the ArN-CO2 （N=1-19） van der Waals clusters were investigated by a simulated annealing algorithm. A newly developed Ar-CO2 potential energy surface together with the Aziz Ar-Ar interaction potential was employed to construct the high dimensional potential functions by pairwise additive approximation. The global minimal conformations were optimized by sampling the glassy phase space with a circumspectively formulated annealing schedule. Unlike the lighter agg-CO2 clusters, the size-dependent structural and energetic characteristics of ArN-CO2 exhibit a different behavior. The dramatically variations with number of solvent were found for small clusters. After the completion of the first solvation shell at N=17, the clusters were evolved more smoothly.展开更多
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.展开更多
基金supported by the National Natural Science Foundation of China(72571094,72271076,71871079)。
文摘Efficient multiple unmanned aerial vehicles(UAVs)path planning is crucial for improving mission completion efficiency in UAV operations.However,during the actual flight of UAVs,the flight time between nodes is always influenced by external factors,making the original path planning solution ineffective.In this paper,the multi-depot multi-UAV path planning problem with uncertain flight time is modeled as a robust optimization model with a budget uncertainty set.Then,the robust optimization model is transformed into a mixed integer linear programming model by the strong duality theorem,which makes the problem easy to solve.To effectively solve large-scale instances,a simulated annealing algorithm with a robust feasibility check(SA-RFC)is developed.The numerical experiment shows that the SA-RFC can find high-quality solutions within a few seconds.Moreover,the effect of the task location distribution,depot counts,and variations in robustness parameters on the robust optimization solution is analyzed by using Monte Carlo experiments.The results demonstrate that the proposed robust model can effectively reduce the risk of the UAV failing to return to the depot without significantly compromising the profit.
基金supported by the National Natural Science Foundation of China(72071064,72271074,72001004)the Anhui Provincial Natural Science Foundation(2408085QG221).
文摘Agile earth observation satellites(AEOSs)represent a new generation of satellites with three degrees of freedom(pitch,roll,and yaw);they possess a long visible time window(VTW)for ground targets and support imaging at any moment within the VTW.However,different observation times demonstrate different cloud cover distributions,which exhibit different effects on the AEOS observation.Previous studies ignored pitch angles,discretized VTWs,or fixed cloud cover for every VTW,which led to the loss of intermediate observation states,thus these studies are not suitable for AEOS scheduling considering cloud cover distribution.In this study,a relationship formula between the cloud cover and observation time is proposed to calculate the cloud cover for every observation time,and a relationship formula between the observation time and pitch angle is designed to calculate the pitch angle for every observation time in the VTW.A refined model including the pitch angle,roll angle,and cloud cover distribution is established,which can make the scheme closer to the actual application of AEOSs.A hybrid genetic simulated annealing(HGSA)algorithm for AEOS scheduling is proposed,which integrates the advantages of genetic and simulated annealing algorithms and can effectively avoid falling into a local optimal solution.The experiments are conducted to compare the proposed algorithm with the traditional algorithms,the results verify that the proposed model and algorithm are efficient and effective for AEOS scheduling considering cloud cover distribution.
基金The National Natural Science Foundation of China(No.60773217)Free Exploration Project(985 Project of Renmin University of China)(No.21361231)
文摘In order to enable quality-aware web services selection in the process of service composition,this paper first describes the non-functional requirements of service consumers and the quality of elementary service or composite service as a quality vector,and then models the QoS（quality of service）-aware composition as a multiple criteria optimization problem in extending directed graph.A novel simulated annealing algorithm for QoS-aware web services composition is presented.A normalizing for composite service QoS values is made,and a secondary iterative optimization is used in the algorithm.Experimental results show that the simulated annealing algorithm can satisfy the multiple criteria and global QoS requirements of service consumers.The algorithm produces near optimum solution with much less computation cost.
基金Supported by the Deutsche Forschungsgemeinschaft (DFG No. RO294/9).
文摘The multi-stream heat exchanger network synthesis (HENS) problem can be formulated as a mixed integer nonlinear programming model according to Yee et al. Its nonconvexity nature leads to existence of more than one optimum and computational difficulty for traditional algorithms to find the global optimum. Compared with deterministic algorithms, evolutionary computation provides a promising approach to tackle this problem. In this paper, a mathematical model of multi-stream heat exchangers network synthesis problem is setup. Different from the assumption of isothermal mixing of stream splits and thus linearity constraints of Yee et al., non-isothermal mixing is supported. As a consequence, nonlinear constraints are resulted and nonconvexity of the objective function is added. To solve the mathematical model, an algorithm named GA/SA (parallel genetic/simulated annealing algorithm) is detailed for application to the multi-stream heat exchanger network synthesis problem. The performance of the proposed approach is demonstrated with three examples and the obtained solutions indicate the presented approach is effective for multi-stream HENS.
文摘This article presents a simulated annealing-based approach to the optimal synthesis of distillation column considering intermediate heat exchangers arrangements. T-he number of intermediate condensers and/or intermediate reboilers, the placement locations, the.operating pressure of column, and the heat duties of intermediate heat exchangers are treated as optimization variables. A novel coding procedure making use of an integer number series is proposed to represent and manipulate the structure of system and a stage-to-stage method is used for column design and cost calculation. With the representation procedure, the synthesis problem is formulated as a mixed integer nonlinear programming （MINLP） problem, which can then be solved with an improved simulated annealing algorithm. Two examples are illustrated to show the effectiveness of the suggested approach.
基金Supported by the National Basic ResearchProgramof China (973 Program2003CB314804)
文摘In this paper combined with the advantages of genetic algorithm and simulated annealing, brings forward a parallel genetic simulated annealing hybrid algorithm （PGSAHA） and applied to solve task scheduling problem in grid computing. It first generates a new group of individuals through genetic operation such as reproduction, crossover, mutation, etc, and than simulated anneals independently all the generated individuals respectively. When the temperature in the process of cooling no longer falls, the result is the optimal solution on the whole. From the analysis and experiment result, it is concluded that this algorithm is superior to genetic algorithm and simulated annealing.
基金the Natural Science Foundation of Shandong Province (Y2006A12)the Scientific ResearchDevelopment Project of Shandong Provincial Education Department(J06P01)the Doctoral Foundation of University of Jinan(B0633).
文摘In rough communication, because each agent has a different language and cannot provide precise communication to each other, the concept translated among multi-agents will loss some information and this results in a less or rougher concept. With different translation sequences, the problem of information loss is varied. To get the translation sequence, in which the jth agent taking part in rough communication gets maximum information, a simulated annealing algorithm is used. Analysis and simulation of this algorithm demonstrate its effectiveness.
基金supported by the National High Technology Research and Development Program of China(2006AA04Z427).
文摘Disassembly sequence planning （DSP） plays a significant role in maintenance planning of the aircraft. It is used during the design stage for the analysis of maintainability of the aircraft. To solve product disassembly sequence planning problems efficiently, a product disassembly hybrid graph model, which describes the connection, non-connection and precedence relationships between the product parts, is established based on the characteristic of disassembly. Farther, the optimization model is provided to optimize disassembly sequence. And the solution methodology based on the genetic/simulated annealing algorithm with binaxy-tree algorithm is given. Finally, an example is analyzed in detail, and the result shows that the model is correct and efficient.
基金Project supported by the National Natural Science Foundation of China （Grant No.50375023）
文摘This paper establishes a mathematical model of multi-objective optimization with behavior constraints in solid space based on the problem of optimal design of hydraulic manifold blocks （HMB）. Due to the limitation of its local search ability of genetic algorithm （GA） in solving a massive combinatorial optimization problem, simulated annealing （SA） is combined, the multi-parameter concatenated coding is adopted, and the memory function is added. Thus a hybrid genetic-simulated annealing with memory function is formed. Examples show that the modified algorithm can improve the local search ability in the solution space, and the solution quality.
基金supported by the National Science Fund of China under Grants 61603034China Postdoctoral Science Foundation under Grant 2019M653870XB+1 种基金Beijing Municipal Natural Science Foundation (3182027)Fundamental Research Funds for the Central Universities,China,FRF-GF-17-B44,and XJS191315
文摘At present,simultaneous localization and mapping(SLAM) for an autonomous underwater vehicle(AUV)is a research hotspot.Aiming at the problem of non-linear model and non-Gaussian noise in AUV motion,an improved method of variance reduction fast simultaneous localization and mapping(FastSLAM) with simulated annealing is proposed to solve the problems of particle degradation,particle depletion and particle loss in traditional FastSLAM,which lead to the reduction of AUV location estimation accuracy.The adaptive exponential fading factor is generated by the anneal function of simulated annealing algorithm to improve the effective particle number and replace resampling.By increasing the weight of small particles and decreasing the weight of large particles,the variance of particle weight can be reduced,the number of effective particles can be increased,and the accuracy of AUV location and feature location estimation can be improved to some extent by retaining more information carried by particles.The experimental results based on trial data show that the proposed simulated annealing variance reduction FastSLAM method avoids particle degradation,maintains the diversity of particles,weakened the degeneracy and improves the accuracy and stability of AUV navigation and localization system.
基金supported by the Major National Science & Technology Specific Project of China under Grants No.2010ZX03002-007-02,No.2009ZX03002-002,No.2010ZX03002-002-03
文摘In recent years, sinmlated annealing algo-rithms have been extensively developed and uti-lized to solve nmlti-objective optimization problems. In order to obtain better optimization perfonmnce, this paper proposes a Novel Adaptive Simulated Annealing （NASA） algorithm for constrained multi-objective optimization based on Archived Multi-objective Simulated Annealing （AMOSA）. For han-dling multi-objective, NASA makes improverrents in three aspects： sub-iteration search, sub-archive and adaptive search, which effectively strengthen the stability and efficiency of the algorithnm For handling constraints, NASA introduces corresponding solution acceptance criterion. Furtherrrore, NASA has also been applied to optimize TD-LTE network perform-ance by adjusting antenna paranleters; it can achieve better extension and convergence than AMOSA, NS-GAII and MOPSO. Analytical studies and simulations indicate that the proposed NASA algorithm can play an important role in improving multi-objective optimi-zation performance.
基金International Science&Technology Cooperation Program of China under Grant No.2011DFA71100the National Key Technology R&D Program under Grant No.2014BAK03B01the National Basic Research Program of China(973 Program)under Grant No.2007CB714201
文摘Surface wave methods are becoming increasingly popular in many geotechnical applications and in earthquake seismology due to their noninvasive characteristics.Inverse surface wave dispersion curves are a crucial step in most surface wave methods.Many inversion methods have been applied to surface wave dispersion curve inversion,including linearized inversion and nonlinearized inversion methods.In this study,a hybrid inversion method of Damped Least Squares(DLS) with Very Fast Simulated Annealing(VFSA) is developed for multi-mode Rayleigh wave dispersion curve inversion.Both synthetic and in situ fi eld data were used to verify the validity of the proposed method.The results show that the proposed method is superior to the conventional VFSA method in aiming at global minimum,especially when parameter searching space is adjacent to real values of the parameters.The advantage of the new method is that it retains both the merits of VFSA for global search and DLS for local search.At high temperatures,the global search dominates the runs,while at a low temperatures,the local search dominates the runs.Thus,at low temperatures,the proposed method can almost directly approach the actual model.
文摘The research effort outlined the application of a computer aided design(CAD)-centric technique to the design and optimization of solid rocket motor Finocyl(fin in cylinder) grain using simulated annealing.The proper method for constructing the grain configuration model,ballistic performance and optimizer integration for analysis was presented.Finocyl is a complex grain configuration,requiring thirteen variables to define the geometry.The large number of variables not only complicates the geometrical construction but also optimization process.CAD representation encapsulates all of the geometric entities pertinent to the grain design in a parametric way,allowing manipulation of grain entity(web),performing regression and automating geometrical data calculations.Robustness to avoid local minima and efficient capacity to explore design space makes simulated annealing an attractive choice as optimizer.It is demonstrated with a constrained optimization of Finocyl grain geometry for homogeneous,isotropic propellant,uniform regression,and a quasi-steady,bulk mode internal ballistics model that maximizes average thrust for required deviations from neutrality.
基金Supported by School of Engineering, Napier University, United Kingdom, and partially supported by the National Natural Science Foundation of China (No.60273093).
文摘Genetic Algorithm (GA) is a biologically inspired technique and widely used to solve numerous combinational optimization problems. It works on a population of individuals, not just one single solution. As a result, it avoids converging to the local optimum. However, it takes too much CPU time in the late process of GA. On the other hand, in the late process Simulated Annealing (SA) converges faster than GA but it is easily trapped to local optimum. In this letter, a useful method that unifies GA and SA is introduced, which utilizes the advantage of the global search ability of GA and fast convergence of SA. The experimental results show that the proposed algorithm outperforms GA in terms of CPU time without degradation of performance. It also achieves highly comparable placement cost compared to the state-of-the-art results obtained by Versatile Place and Route (VPR) Tool.
基金Projects(40804027,41074085) supported by the National Natural Science Foundation of ChinaProject(09JJ3048) supported by the Natural Science Foundation of Hunan Province,ChinaProject(200805331082) supported by the Research Fund for the Doctoral Program of Higher Education,China
文摘In large loop transient electromagnetic method(TEM),the late time apparent resistivity formula cannot truly reflect the geoelectric model,thus it needs to define the all-time apparent resistivity with the position information of measuring point.Utilizing very fast simulated annealing(VFSA) to fit the theoretical electromagnetic force(EMF) and measured EMF could obtain the all-time apparent resistivity of the measuring points in rectangular transmitting loop.The selective cope of initial model of VFSA could be confirmed by taking the late time apparent resistivity of transient electromagnetic method as the prior information.For verifying the correctness,the all-time apparent resistivities of the geoelectric models were calculated by VFSA and dichotomy,respectively.The results indicate that the relative differences of apparent resistivities calculated by these two methods are within 3%.The change of measuring point position has little influence on the tracing pattern of all-time apparent resistivity.The first branch of the curve of all-time apparent resistivity is close to the resistivity of the first layer medium and the last branch is close to the resistivity of the last layer medium,which proves the correctness of the arithmetics proposed.
文摘Imbalanced data classification is one of the major problems in machine learning.This imbalanced dataset typically has significant differences in the number of data samples between its classes.In most cases,the performance of the machine learning algorithm such as Support Vector Machine(SVM)is affected when dealing with an imbalanced dataset.The classification accuracy is mostly skewed toward the majority class and poor results are exhibited in the prediction of minority-class samples.In this paper,a hybrid approach combining data pre-processing technique andSVMalgorithm based on improved Simulated Annealing(SA)was proposed.Firstly,the data preprocessing technique which primarily aims at solving the resampling strategy of handling imbalanced datasets was proposed.In this technique,the data were first synthetically generated to equalize the number of samples between classes and followed by a reduction step to remove redundancy and duplicated data.Next is the training of a balanced dataset using SVM.Since this algorithm requires an iterative process to search for the best penalty parameter during training,an improved SA algorithm was proposed for this task.In this proposed improvement,a new acceptance criterion for the solution to be accepted in the SA algorithm was introduced to enhance the accuracy of the optimization process.Experimental works based on ten publicly available imbalanced datasets have demonstrated higher accuracy in the classification tasks using the proposed approach in comparison with the conventional implementation of SVM.Registering at an average of 89.65%of accuracy for the binary class classification has demonstrated the good performance of the proposed works.
基金supported by the National Natural Science Foundation of China(21978203)the Natural Science Foundation of Tianjin City(19JCYBJC20300)。
文摘Cascade refrigeration system(CRS)can meet a wider range of refrigeration temperature requirements and is more energy efficient than single-refrigerant refrigeration system,making it more widely used in low-temperature industry processes.The synthesis of a CRS with simultaneous consideration of heat integration between refrigerant and process streams is challenging but promising for significant cost saving and reduction of carbon emission.This study presented a stochastic optimization method for the synthesis of CRS.An MINLP model was formulated based on the superstructure developed for the CRS,and an optimization framework was proposed,where simulated annealing algorithm was used to evolve the numbers of pressure/temperature levels for all sub-refrigeration systems,and particle swarm optimization algorithm was employed to optimize the continuous variables.The effectiveness of the proposed methodology was verified by a case study of CRS optimization in an ethylene plant with 21.89%the total annual cost saving.
基金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.
基金This work was supported by the National Natural Science Foundation of China （No.21133006, No.91021010, and No.20725312）.
文摘The minimum-energy configurations and energetic properties of the ArN-CO2 （N=1-19） van der Waals clusters were investigated by a simulated annealing algorithm. A newly developed Ar-CO2 potential energy surface together with the Aziz Ar-Ar interaction potential was employed to construct the high dimensional potential functions by pairwise additive approximation. The global minimal conformations were optimized by sampling the glassy phase space with a circumspectively formulated annealing schedule. Unlike the lighter agg-CO2 clusters, the size-dependent structural and energetic characteristics of ArN-CO2 exhibit a different behavior. The dramatically variations with number of solvent were found for small clusters. After the completion of the first solvation shell at N=17, the clusters were evolved more smoothly.
文摘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.
