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.展开更多
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.展开更多
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.展开更多
Evolutionary computation techniques have mostly been used to solve various optimization problems, and it is well known that graph isomorphism problem （GIP） is a nondeterministic polynomial problem. A simulated annea...Evolutionary computation techniques have mostly been used to solve various optimization problems, and it is well known that graph isomorphism problem （GIP） is a nondeterministic polynomial problem. A simulated annealing （SA） algorithm for detecting graph isomorphism is proposed, and the proposed SA algorithm is well suited to deal with random graphs with large size. To verify the validity of the proposed SA algorithm, simulations are performed on three pairs of small graphs and four pairs of large random graphs with edge densities 0.5, 0.1, and 0.01, respectively. The simulation results show that the proposed SA algorithm can detect graph isomorphism with a high probability.展开更多
Taking the ratio of heat transfer area to net power and heat recovery efficiency into account, a multi-objective mathematical model was developed for organic Rankine cycle （ORC）. Working fluids considered were R123,...Taking the ratio of heat transfer area to net power and heat recovery efficiency into account, a multi-objective mathematical model was developed for organic Rankine cycle （ORC）. Working fluids considered were R123, R134a, R141b, R227ea and R245fa. Under the given conditions, the parameters including evaporating and condensing pressures, working fluid and cooling water velocities were optimized by simulated annealing algorithm. The results show that the optimal evaporating pressure increases with the heat source temperature increasing. Compared with other working fluids, R123 is the best choice for the temperature range of 100--180℃ and R141 b shows better performance when the temperature is higher than 180 ℃. Economic characteristic of system decreases rapidly with the decrease of heat source temperature. ORC system is uneconomical for the heat source temperature lower than 100℃.展开更多
Accurate forecasting of wind velocity can improve the economic dispatch and safe operation of the power system. Support vector machine (SVM) has been proved to be an efficient approach for forecasting. According to th...Accurate forecasting of wind velocity can improve the economic dispatch and safe operation of the power system. Support vector machine (SVM) has been proved to be an efficient approach for forecasting. According to the analysis with support vector machine method, the drawback of determining the parameters only by experts' experience should be improved. After a detailed description of the methodology of SVM and simulated annealing, an improved algorithm was proposed for the automatic optimization of parameters using SVM method. An example has proved that the proposed method can efficiently select the parameters of the SVM method. And by optimizing the parameters, the forecasting accuracy of the max wind velocity increases by 34.45%, which indicates that the new SASVM model improves the forecasting accuracy.展开更多
According to time-sharing valuation principle (TSVP) of power supply, the relationships of current density and current efficiency at different acidities are obtained based on the processed data of electrolytic deposit...According to time-sharing valuation principle (TSVP) of power supply, the relationships of current density and current efficiency at different acidities are obtained based on the processed data of electrolytic deposition process of zinc (EDPZ) with the least square method (LSM). Thus an optimal model of time-sharing power supply system for EDPZ is established, which has been optimized by use of an improved efficient simulated annealing algorithm (SAA). Practical results show that industrial and mining enterprises can obtain enormous economic benefits every year.展开更多
A new searching algorithm named the annealing-genetic algorithm(AGA) was proposed by skillfully merging GA with SAA. It draws on merits of both GA and SAA ,and offsets their shortcomings.The difference from GA is that...A new searching algorithm named the annealing-genetic algorithm(AGA) was proposed by skillfully merging GA with SAA. It draws on merits of both GA and SAA ,and offsets their shortcomings.The difference from GA is that AGA takes objective function as adaptability function directly,so it cuts down some unnecessary time expense because of float-point calculation of function conversion.The difference from SAA is that AGA need not execute a very long Markov chain iteration at each point of temperature, so it speeds up the convergence of solution and makes no assumption on the search space,so it is simple and easy to be implemented.It can be applied to a wide class of problems.The optimizing principle and the implementing steps of AGA were expounded. The example of the parameter optimization of a typical complex electromechanical system named temper mill shows that AGA is effective and superior to the conventional GA and SAA.The control system of temper mill optimized by AGA has the optimal performance in the adjustable ranges of its parameters.展开更多
The multi-objective genetic algorithm(MOGA) is proposed to calibrate the non-linear camera model of a space manipulator to improve its locational accuracy. This algorithm can optimize the camera model by dynamic balan...The multi-objective genetic algorithm(MOGA) is proposed to calibrate the non-linear camera model of a space manipulator to improve its locational accuracy. This algorithm can optimize the camera model by dynamic balancing its model weight and multi-parametric distributions to the required accuracy. A novel measuring instrument of space manipulator is designed to orbital simulative motion and locational accuracy test. The camera system of space manipulator, calibrated by MOGA algorithm, is used to locational accuracy test in this measuring instrument. The experimental result shows that the absolute errors are [0.07, 1.75] mm for MOGA calibrating model, [2.88, 5.95] mm for MN method, and [1.19, 4.83] mm for LM method. Besides, the composite errors both of LM method and MN method are approximately seven times higher that of MOGA calibrating model. It is suggested that the MOGA calibrating model is superior both to LM method and MN method.展开更多
First of all, this paper discusses the drawbacks of multilayer perceptron (MLP), which is trained by the traditional back propagation (BP) algorithm and used in a special classification problem. A new training algorit...First of all, this paper discusses the drawbacks of multilayer perceptron (MLP), which is trained by the traditional back propagation (BP) algorithm and used in a special classification problem. A new training algorithm for neural networks based on genetic algorithm and BP algorithm is developed. The difference between the new training algorithm and BP algorithm in the ability of nonlinear approaching is expressed through an example, and the application foreground is illustrated by an example.展开更多
This paper introduces a multi-agent system which i nt egrates process planning and production scheduling, in order to increase the fle xibility of manufacturing systems in coping with rapid changes in dynamic market a...This paper introduces a multi-agent system which i nt egrates process planning and production scheduling, in order to increase the fle xibility of manufacturing systems in coping with rapid changes in dynamic market and dealing with internal uncertainties such as machine breakdown or resources shortage. This system consists of various autonomous agents, each of which has t he capability of communicating with one another and making decisions based on it s knowledge and if necessary on information provided by other agents. Machine ag ents which represent the machines play an important role in the system in that t hey negotiate with each other to bid for jobs. An iterative bidding mechanism is proposed to facilitate the process of job assignment to machines and handle the negotiation between agents. This mechanism enables near optimal process plans a nd production schedules to be produced concurrently, so that dynamic changes in the market can be coped with at a minimum cost, and the utilisation of manufactu ring resources can be optimised. In addition, a currency scheme with currency-l ike metrics is proposed to encourage or prohibit machine agents to put forward t heir bids for the jobs announced. The values of the metrics are adjusted iterati vely so as to obtain an integrated plan and schedule which result in the minimum total production cost while satisfying products due dates. To deal with the optimisation problem, i.e. to what degree and how the currencies should be adj usted in each iteration, a genetic algorithm (GA) is developed. Comparisons are made between GA approach and simulated annealing (SA) optimisation technique.展开更多
Circles packing problem is an NP-hard problem and is di?cult to solve. In this paper, ahybrid search strategy for circles packing problem is discussed. A way of generating new configurationis presented by simulating t...Circles packing problem is an NP-hard problem and is di?cult to solve. In this paper, ahybrid search strategy for circles packing problem is discussed. A way of generating new configurationis presented by simulating the moving of elastic objects, which can avoid the blindness of simulatedannealing search and make iteration process converge fast. Inspired by the life experiences of people,an e?ective personified strategy to jump out of local minima is given. Based on the simulatedannealing idea and personification strategy, an e?ective personified annealing algorithm for circlespacking problem is developed. Numerical experiments on benchmark problem instances show thatthe proposed algorithm outperforms the best algorithm in the literature.展开更多
Identical parallel machine scheduling problem for minimizing the makespan is a very important production scheduling problem. When its scale is large, many difficulties will arise in the course of solving identical par...Identical parallel machine scheduling problem for minimizing the makespan is a very important production scheduling problem. When its scale is large, many difficulties will arise in the course of solving identical parallel machine scheduling problem. Ant system based optimization algorithm (ASBOA) has shown great advantages in solving the combinatorial optimization problem in view of its characteristics of high efficiency and suitability for practical applications. An ASBOA for minimizing the makespan in identical machine scheduling problem is presented. Two different scale numerical examples demonstrate that the ASBOA proposed is efficient and fit for large-scale identical parallel machine scheduling problem for minimizing the makespan, the quality of its solution has advantages over heuristic procedure and simulated annealing method, as well as genetic algorithm.展开更多
文摘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.
基金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.
基金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.
基金the National Natural Science Foundation of China (60373089, 60674106, and 60533010)the National High Technology Research and Development "863" Program (2006AA01Z104)
文摘Evolutionary computation techniques have mostly been used to solve various optimization problems, and it is well known that graph isomorphism problem （GIP） is a nondeterministic polynomial problem. A simulated annealing （SA） algorithm for detecting graph isomorphism is proposed, and the proposed SA algorithm is well suited to deal with random graphs with large size. To verify the validity of the proposed SA algorithm, simulations are performed on three pairs of small graphs and four pairs of large random graphs with edge densities 0.5, 0.1, and 0.01, respectively. The simulation results show that the proposed SA algorithm can detect graph isomorphism with a high probability.
基金Project(2009GK2009) supported by Science and Technology Department Funds of Hunan Province,ChinaProject(08C26224302178) supported by Innovation Fund for Technology Based Firms of China
文摘Taking the ratio of heat transfer area to net power and heat recovery efficiency into account, a multi-objective mathematical model was developed for organic Rankine cycle （ORC）. Working fluids considered were R123, R134a, R141b, R227ea and R245fa. Under the given conditions, the parameters including evaporating and condensing pressures, working fluid and cooling water velocities were optimized by simulated annealing algorithm. The results show that the optimal evaporating pressure increases with the heat source temperature increasing. Compared with other working fluids, R123 is the best choice for the temperature range of 100--180℃ and R141 b shows better performance when the temperature is higher than 180 ℃. Economic characteristic of system decreases rapidly with the decrease of heat source temperature. ORC system is uneconomical for the heat source temperature lower than 100℃.
基金Project(71071052) supported by the National Natural Science Foundation of ChinaProject(JB2011097) supported by the Fundamental Research Funds for the Central Universities of China
文摘Accurate forecasting of wind velocity can improve the economic dispatch and safe operation of the power system. Support vector machine (SVM) has been proved to be an efficient approach for forecasting. According to the analysis with support vector machine method, the drawback of determining the parameters only by experts' experience should be improved. After a detailed description of the methodology of SVM and simulated annealing, an improved algorithm was proposed for the automatic optimization of parameters using SVM method. An example has proved that the proposed method can efficiently select the parameters of the SVM method. And by optimizing the parameters, the forecasting accuracy of the max wind velocity increases by 34.45%, which indicates that the new SASVM model improves the forecasting accuracy.
文摘According to time-sharing valuation principle (TSVP) of power supply, the relationships of current density and current efficiency at different acidities are obtained based on the processed data of electrolytic deposition process of zinc (EDPZ) with the least square method (LSM). Thus an optimal model of time-sharing power supply system for EDPZ is established, which has been optimized by use of an improved efficient simulated annealing algorithm (SAA). Practical results show that industrial and mining enterprises can obtain enormous economic benefits every year.
文摘A new searching algorithm named the annealing-genetic algorithm(AGA) was proposed by skillfully merging GA with SAA. It draws on merits of both GA and SAA ,and offsets their shortcomings.The difference from GA is that AGA takes objective function as adaptability function directly,so it cuts down some unnecessary time expense because of float-point calculation of function conversion.The difference from SAA is that AGA need not execute a very long Markov chain iteration at each point of temperature, so it speeds up the convergence of solution and makes no assumption on the search space,so it is simple and easy to be implemented.It can be applied to a wide class of problems.The optimizing principle and the implementing steps of AGA were expounded. The example of the parameter optimization of a typical complex electromechanical system named temper mill shows that AGA is effective and superior to the conventional GA and SAA.The control system of temper mill optimized by AGA has the optimal performance in the adjustable ranges of its parameters.
基金Project(J132012C001)supported by Technological Foundation of ChinaProject(2011YQ04013606)supported by National Major Scientific Instrument & Equipment Developing Projects,China
文摘The multi-objective genetic algorithm(MOGA) is proposed to calibrate the non-linear camera model of a space manipulator to improve its locational accuracy. This algorithm can optimize the camera model by dynamic balancing its model weight and multi-parametric distributions to the required accuracy. A novel measuring instrument of space manipulator is designed to orbital simulative motion and locational accuracy test. The camera system of space manipulator, calibrated by MOGA algorithm, is used to locational accuracy test in this measuring instrument. The experimental result shows that the absolute errors are [0.07, 1.75] mm for MOGA calibrating model, [2.88, 5.95] mm for MN method, and [1.19, 4.83] mm for LM method. Besides, the composite errors both of LM method and MN method are approximately seven times higher that of MOGA calibrating model. It is suggested that the MOGA calibrating model is superior both to LM method and MN method.
基金This project was supported by Guangdong Natural Science Foundation.
文摘First of all, this paper discusses the drawbacks of multilayer perceptron (MLP), which is trained by the traditional back propagation (BP) algorithm and used in a special classification problem. A new training algorithm for neural networks based on genetic algorithm and BP algorithm is developed. The difference between the new training algorithm and BP algorithm in the ability of nonlinear approaching is expressed through an example, and the application foreground is illustrated by an example.
文摘This paper introduces a multi-agent system which i nt egrates process planning and production scheduling, in order to increase the fle xibility of manufacturing systems in coping with rapid changes in dynamic market and dealing with internal uncertainties such as machine breakdown or resources shortage. This system consists of various autonomous agents, each of which has t he capability of communicating with one another and making decisions based on it s knowledge and if necessary on information provided by other agents. Machine ag ents which represent the machines play an important role in the system in that t hey negotiate with each other to bid for jobs. An iterative bidding mechanism is proposed to facilitate the process of job assignment to machines and handle the negotiation between agents. This mechanism enables near optimal process plans a nd production schedules to be produced concurrently, so that dynamic changes in the market can be coped with at a minimum cost, and the utilisation of manufactu ring resources can be optimised. In addition, a currency scheme with currency-l ike metrics is proposed to encourage or prohibit machine agents to put forward t heir bids for the jobs announced. The values of the metrics are adjusted iterati vely so as to obtain an integrated plan and schedule which result in the minimum total production cost while satisfying products due dates. To deal with the optimisation problem, i.e. to what degree and how the currencies should be adj usted in each iteration, a genetic algorithm (GA) is developed. Comparisons are made between GA approach and simulated annealing (SA) optimisation technique.
文摘Circles packing problem is an NP-hard problem and is di?cult to solve. In this paper, ahybrid search strategy for circles packing problem is discussed. A way of generating new configurationis presented by simulating the moving of elastic objects, which can avoid the blindness of simulatedannealing search and make iteration process converge fast. Inspired by the life experiences of people,an e?ective personified strategy to jump out of local minima is given. Based on the simulatedannealing idea and personification strategy, an e?ective personified annealing algorithm for circlespacking problem is developed. Numerical experiments on benchmark problem instances show thatthe proposed algorithm outperforms the best algorithm in the literature.
基金ThisprojectwassupportedbytheNationalNaturalScienceFoundationofChina (No .5 9990 470 - 2 )andDoctoralProgramFoundationunderMinistryofEducation (No .2 0 0 10 4870 2 4)
文摘Identical parallel machine scheduling problem for minimizing the makespan is a very important production scheduling problem. When its scale is large, many difficulties will arise in the course of solving identical parallel machine scheduling problem. Ant system based optimization algorithm (ASBOA) has shown great advantages in solving the combinatorial optimization problem in view of its characteristics of high efficiency and suitability for practical applications. An ASBOA for minimizing the makespan in identical machine scheduling problem is presented. Two different scale numerical examples demonstrate that the ASBOA proposed is efficient and fit for large-scale identical parallel machine scheduling problem for minimizing the makespan, the quality of its solution has advantages over heuristic procedure and simulated annealing method, as well as genetic algorithm.
