Imperial competitive algorithm with policy learning for the traveling salesman problem.
Meng-Hui ChenShih-Hsin ChenPei-Chann ChangPublished in: Soft Comput. (2017)
Keyphrases
- learning algorithm
- traveling salesman problem
- combinatorial optimization
- ant colony optimization
- discrete particle swarm optimization
- computational complexity
- hamiltonian cycle
- cost function
- dynamic programming
- ant colony optimization algorithm
- optimal solution
- np hard
- minimum spanning tree
- genetic local search
- expectation maximization
- scheduling problem
- objective function
- knapsack problem
- vehicle routing problem
- combinatorial optimization problems
- nearest neighbor
- search space