Adaptive schedules for ensemble-based thereshold accepting Original Research Article

We study numerically an adaptive schedule in the ensemble approach of threshold accepting by considering a traveling salesman problem. We find that the probability for finding low lying minima is higher than in the widely used conventional exponential schedules. The algorithm is well suited for parallel implementations.