DJAYA: A discrete Jaya algorithm for solving traveling salesman problem.
Mesut GündüzMurat AslanPublished in: Appl. Soft Comput. (2021)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- ant colony optimization
- dynamic programming
- hamiltonian cycle
- discrete particle swarm optimization
- computational complexity
- cost function
- optimal solution
- expectation maximization
- minimum spanning tree
- combinatorial optimization problems
- benchmark problems
- particle swarm optimization
- optimization problems
- simulated annealing
- objective function
- neural network
- linear programming
- lower and upper bounds