Using the Expanded IWO Algorithm to Solve the Traveling Salesman Problem.
Daniel KostrzewaHenryk JosinskiPublished in: ICAART (2) (2013)
Keyphrases
- traveling salesman problem
- ant colony optimization
- combinatorial optimization
- dynamic programming
- optimization algorithm
- objective function
- np hard
- computational complexity
- optimal solution
- knapsack problem
- hamiltonian cycle
- discrete particle swarm optimization
- simulated annealing
- benchmark problems
- search space
- convex hull
- reinforcement learning
- global optimization
- traveling salesman