A real adjacency matrix-coded evolution algorithm for highly linkage-based routing problems.
Hang WeiHan HuangZhifeng HaoQin-Qun ChenWitold PedryczGang LiPublished in: Int. J. Bio Inspired Comput. (2021)
Keyphrases
- routing problem
- adjacency matrix
- np hard
- matching algorithm
- ant colony optimization
- particle swarm optimization
- graph structure
- worst case
- search space
- pattern recognition
- objective function
- dynamic programming
- similarity measure
- computational complexity
- combinatorial optimization
- global optimization
- benchmark problems
- graph model
- optimal solution