Paper
8 November 2023 Adaptive genetic simulated annealing algorithm for project demonstration scheduling problem
Hao Li, Xiangsheng Feng, Yifeng Shi, Jiang Liu
Author Affiliations +
Proceedings Volume 12923, Third International Conference on Artificial Intelligence, Virtual Reality, and Visualization (AIVRV 2023); 129230F (2023) https://doi.org/10.1117/12.3011347
Event: 3rd International Conference on Artificial Intelligence, Virtual Reality and Visualization (AIVRV 2023), 2023, Chongqing, China
Abstract
In view of the premature convergence of genetic algorithm, poor local search ability and the strong local search ability and resistance to falling into local optimal solutions of simulated annealing algorithm, this paper combines the two algorithms and introduces adaptive crossover and mutation operators, and designs an adaptive genetic-simulated annealing algorithm. The algorithm adopts matrix encoding and through selection, crossover, and mutation operations, high fitness individuals undergo simulated annealing operations, and four different neighborhood schemes are used to obtain the optimal solution. This algorithm is applied to the project demonstration scheduling problem, and the experiment shows that the algorithm has significant advantages over other algorithms.
(2023) Published by SPIE. Downloading of the abstract is permitted for personal use only.
Hao Li, Xiangsheng Feng, Yifeng Shi, and Jiang Liu "Adaptive genetic simulated annealing algorithm for project demonstration scheduling problem", Proc. SPIE 12923, Third International Conference on Artificial Intelligence, Virtual Reality, and Visualization (AIVRV 2023), 129230F (8 November 2023); https://doi.org/10.1117/12.3011347
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Genetic algorithms

Algorithms

Matrices

Genetics

Chemical elements

Annealing

Organisms

Back to Top