An Improved Discrete Bat Algorithm for Symmetric and Asymmetric Traveling Salesman Problems.
Eneko OsabaXin-She YangFernando DíazPedro López-GarcíaRoberto CarballedoPublished in: CoRR (2016)
Keyphrases
- optimal solution
- computational complexity
- dynamic programming
- mathematical model
- traveling salesman problem
- combinatorial optimization
- optimization algorithm
- cost function
- search space
- benchmark problems
- undirected graph
- objective function
- linear program
- distance metric
- expectation maximization
- simulated annealing
- scheduling problem
- np hard