A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem