An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems.
Eneko OsabaXin-She YangFernando DíazPedro López-GarcíaRoberto CarballedoPublished in: Eng. Appl. Artif. Intell. (2016)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- dynamic programming
- computational complexity
- ant colony optimization
- benchmark problems
- optimization algorithm
- simulated annealing
- objective function
- segmentation algorithm
- cost function
- search space
- expectation maximization
- particle swarm optimization
- state space
- clustering method
- evolutionary algorithm
- neural network