An iterative algorithm to eliminate edges for traveling salesman problem based on a new binomial distribution - Eliminating edges for TSP.
Yong WangJeffrey B. RemmelPublished in: Appl. Intell. (2018)
Keyphrases
- traveling salesman problem
- ant colony optimization
- combinatorial optimization
- discrete particle swarm optimization
- hamiltonian cycle
- minimum spanning tree
- ant colony optimization algorithm
- dynamic programming
- search space
- simulated annealing
- optimization problems
- spanning tree
- genetic local search
- np hard
- computational complexity
- linear programming
- cost function
- discrete optimization problems
- energy function
- crossover operator
- undirected graph
- evolutionary algorithm
- lin kernighan
- subtour elimination
- genetic algorithm