2010Machine Design and ResearchRequires access

Simulated Annealing Actual-parameter Genetic Algorithm and It's Engineering Application

Lan Zhou

Open publisher page 0 citations

Abstract

With its inheritance,genetic algorithm may spend much computation time in the encoding and decoding process.Also,since genetic algorithm lacks hill-climbing capacity,it easily fall in prematureness and local convergence.In this paper,a novel adaptive real-parameter simulated annealing algorithm(ARSAGA)that maintains the merits of genetic algorithm(GA)and simulated annealing(SA)is proposed.Adaptive mechanisms are also added to insure the solution quality and to improve the convergence speed.Apply this method to solve the helical spring constrained optimization design problem.The results indicate that the global searching ability and convergence speed of this novel hybrid algorithm is significantly improved,even though small population size is used for a complex and large problem.

About this research paper

What this paper is about

With its inheritance,genetic algorithm may spend much computation time in the encoding and decoding process.Also,since genetic algorithm lacks hill-climbing capacity,it easily fall in prematureness and local convergence.In this paper,a novel adaptive real-parameter simulated annealing algorithm(ARSAGA)that maintains the merits of genetic algorithm(GA)and simulated annealing(SA)is proposed.Adaptive mechanisms are also added to insure the solution quality and to improve the convergence speed.Apply this method to solve the helical spring constrained optimization design problem.The results indicate that the global searching ability and convergence speed of this novel hybrid algorithm is significantly improved,even though small population size is used for a complex and large problem.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

With its inheritance,genetic algorithm may spend much computation time in the encoding and decoding process.Also,since genetic algorithm lacks hill-climbing capacity,it easily fall in prematureness and local convergence.In this paper,a novel adaptive real-parameter simulated annealing algorithm(ARSAGA)that maintains the merits of genetic algorithm(GA)and simulated annealing(SA)is proposed.Adaptive mechanisms are also added to insure the solution quality and to improve the convergence speed.Apply this method to solve the helical spring constrained optimization design problem.The results indicate that the global searching ability and convergence speed of this novel hybrid algorithm is significantly improved,even though small population size is used for a complex and large problem.

Key concepts: Hill climbing, Simulated annealing, Adaptive simulated annealing, Algorithm, Computer science, Genetic algorithm, Computation, Convergence (economics)

Related papers

Back to paper searchBrowse research topicsOriginal source
Simulated Annealing Actual-parameter Genetic Algorithm and It's Engineering Application — Research Paper | ScholarLens