Predicting the difficulty of TSP instances using MST.
Lahari SenguptaPasi FräntiPublished in: INDIN (2019)
Keyphrases
- traveling salesman problem
- randomly generated
- minimal spanning tree
- ant colony optimization
- information systems
- search space
- genetic algorithm
- minimum spanning tree
- optimal solution
- artificial neural networks
- optimization problems
- combinatorial optimization
- training data
- case study
- spanning tree
- decision trees
- training instances
- timetabling problem
- predicting future
- neural network
- travelling salesman