Million city traveling salesman problem solution by divide and conquer clustering with adaptive resonance neural networks.
Samuel A. MulderDonald C. Wunsch IIPublished in: Neural Networks (2003)
Keyphrases
- traveling salesman problem
- discrete optimization problems
- neural network
- combinatorial optimization
- ant colony optimization
- neighborhood search
- ant colony optimization algorithm
- combinatorial problems
- traveling salesman
- variable neighborhood search
- clustering method
- hamiltonian cycle
- optimization problems
- information theoretic
- vehicle routing problem
- discrete particle swarm optimization
- genetic algorithm
- genetic local search
- valid inequalities
- aco algorithm
- combinatorial optimization problems
- solution quality
- sufficient conditions
- multi objective
- similarity function
- nature inspired
- data objects
- global optimization
- scheduling problem
- subtour elimination
- optimal solution