论文部分内容阅读
Metaheuristics are a type of approximate optimization algorithms for solving hard and complex problems in science and engineering[1].They can be defined as algorithm templates that can be easily adapted to solve specific optimization problems.Motivated by search behavior,most researchers divide metaheuristics into two classes:trajectory-based and population-based[1].Ant
Metaheuristics are a type of approximate optimization algorithms for solving hard and complex problems in science and engineering [1]. They can be defined as algorithm templates that can be easily adapted to solve specific optimization problems. Motivated by search behavior, most researchers divide metaheuristics into two classes: trajectory-based and population-based [1] .Ant