An Algorithm for Mapping the Asymmetric Multiple Traveling Salesman Problem onto Colored Petri Nets.
Furqan Hussain EssaniSajjad HaiderPublished in: Algorithms (2018)
Keyphrases
- traveling salesman problem
- hamiltonian cycle
- ant colony optimization
- dynamic programming
- simulated annealing
- combinatorial optimization
- cost function
- optimal solution
- computational complexity
- expectation maximization
- minimum spanning tree
- distance metric
- energy function
- discrete particle swarm optimization
- benchmark problems
- linear program
- markov decision processes
- neural network
- distance function
- search space
- objective function