At present, evolutionary and swarm algorithms for solving combinatorial optimization problems mainly include genetic algorithm (GA)[11,16,17,18,19], simulated annealing (SA)[12,22], particle swarm optimization (PSO)[13,21] and ant colony algorithm [14,15,20,21]. Among them, GA and SA have some disadvantages, such as time-consuming calculation, need to adjust many parameters, high memory consumption and a large number of constraints.
正在翻译中..