Discrete greedy flower pollination algorithm for spherical traveling salesman problem.
Yongquan ZhouRui WangChengyan ZhaoQifang LuoMohamed A. MetwallyPublished in: Neural Comput. Appl. (2019)
Keyphrases
- traveling salesman problem
- expectation maximization
- np hard
- combinatorial optimization
- dynamic programming
- discrete particle swarm optimization
- cost function
- ant colony optimization
- objective function
- computational complexity
- ant colony optimization algorithm
- hamiltonian cycle
- search space
- linear programming
- distance metric
- minimum spanning tree
- neural network
- scheduling problem
- optimization problems
- reinforcement learning
- benchmark problems
- hill climbing