Title of article
Adaptive schedules for ensemble-based thereshold accepting Original Research Article
Author/Authors
R. Tafelmayer، نويسنده , , K.H. Hoffmann، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
5
From page
131
To page
135
Abstract
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.
Keywords
Parallel computation , Simulated annealing , Adaptive control , Ensemble-based threshold accepting , Combinatorial optimization
Journal title
Applied Mathematics Letters
Serial Year
1999
Journal title
Applied Mathematics Letters
Record number
896875
Link To Document