A Multi-objective Genetic Algorithm Based on Simulated Annealing
Xinhua Tang, Chang Xu, Fang Zhifeng
Abstract
Xinhua Tang, Chang Xu, Fang Zhifeng
Abstract
Combined the characteristic of simulated annealing, we propose a multi-objective genetic algorithm based on simulated annealing. We take the advantage of simulated annealing, improve the traditional multi-objective genetic algorithm, and avoid the premature convergence of the algorithm. Experimental results show that the improved algorithm improve the solution efficiency of the traditional multi-objective genetic algorithm, and avoid the premature convergence of the algorithm effectively.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Combined the characteristic of simulated annealing, we propose a multi-objective genetic algorithm based on simulated annealing. We take the advantage of simulated annealing, improve the traditional multi-objective genetic algorithm, and avoid the premature convergence of the algorithm. Experimental results show that the improved algorithm improve the solution efficiency of the traditional multi-objective genetic algorithm, and avoid the premature convergence of the algorithm effectively.
Key concepts: Simulated annealing, Premature convergence, Adaptive simulated annealing, Genetic algorithm, Computer science, Algorithm, Mathematical optimization, Convergence (economics)