Hybrid Max-Min ant system with four vertices and three lines inequality for traveling salesman problem.
Wang YongPublished in: Soft Comput. (2015)
Keyphrases
- traveling salesman problem
- hamiltonian cycle
- combinatorial optimization
- ant colony optimization
- optimization problems
- vehicle routing problem
- transportation networks
- ant colony optimization algorithm
- combinatorial optimization problems
- nature inspired
- path relinking
- discrete particle swarm optimization
- discrete optimization problems
- traveling salesman
- combinatorial problems
- crossover operator
- minimum spanning tree
- valid inequalities
- neural network