In order to meet the needs of warehouse cooperative scheduling and the problems of slow convergence and prematurity of existing genetic algorithms, we propose a warehouse genetic scheduling algorithm based on leader selection operator. Firstly, the population was divided into male subgroups and female subgroups, and the optimal solution was selected as the female leader and the male leader respectively in two subgroups. Secondly, female leader and male subgroup, male leader and female subgroup are staggered to form a waiting crossover sequence. Finally, an example simulation of the storage genetic scheduling algorithm is designed. The simulation results show that the leader selection operator proposed in this paper is superior to the roulette selection operator and the traversal selection operator in terms of convergence speed and global optimization ability, and improves the efficiency of coordinated storage scheduling.
Storage Genetic Scheduling Algorithm Based on Leader Selection Operator
Lect. Notes Electrical Eng.
International Workshop of Advanced Manufacturing and Automation ; 2020 ; Zhanjiang, China October 12, 2020 - October 13, 2020
23.01.2021
8 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Genetic algorithm based gain scheduling
Tema Archiv | 2002
|OPTIMAL SELECTION AND SCHEDULING OF ROAD PROJECTS BY GENETIC ALGORITHM
British Library Conference Proceedings | 2003
|A New Selection Operator to Improve the Genotype Diversity in Genetic Algorithm
British Library Online Contents | 2003
|Directional Evolution Operator Applied to Genetic Algorithm
British Library Online Contents | 1999
|