An Empirical Study of the Multi-fragment Tour Construction Algorithm for the Travelling Salesman Problem.
Mehdi El KrariBelaïd AhiodBouazza El BenaniPublished in: HIS (2016)
Keyphrases
- learning algorithm
- computational cost
- computational complexity
- benchmark problems
- dynamic programming
- optimal solution
- worst case
- estimation algorithm
- recognition algorithm
- computationally efficient
- k means
- search space
- preprocessing
- np hard
- high accuracy
- simulated annealing
- significant improvement
- optimization algorithm
- matching algorithm
- combinatorial optimization
- convex hull
- selection algorithm