Neurodynamic programming: a case study of the traveling salesman problem.
Jia MaTao YangZeng-Guang HouMin TanDerong LiuPublished in: Neural Comput. Appl. (2008)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- ant colony optimization
- optimization problems
- combinatorial problems
- combinatorial optimization problems
- transportation networks
- traveling salesman
- discrete particle swarm optimization
- valid inequalities
- ant colony optimization algorithm
- discrete optimization problems
- vehicle routing problem
- crossover operator
- hamiltonian cycle
- directed graph
- np hard
- satisfy the triangle inequality