Performance Analysis of Cyclical Simulated Annealing Algorithms
Sheldon H. Jacobson (),
Shane N. Hall (),
Laura A. McLay () and
Jeffrey E. Orosz ()
Additional contact information
Sheldon H. Jacobson: University of Illinois at Urbana-Champaign
Shane N. Hall: University of Illinois at Urbana-Champaign
Laura A. McLay: University of Illinois at Urbana-Champaign
Jeffrey E. Orosz: Ritchie Capital Management
Methodology and Computing in Applied Probability, 2005, vol. 7, issue 2, 183-201
Abstract:
Abstract Generalized hill climbing (GHC) algorithms provide a framework for modeling local search algorithms for addressing intractable discrete optimization problems. Measures for assessing the finite-time performance of GHC algorithms have been developed using this framework, including the expected number of iterations to visit a predetermined objective function value level. This paper analyzes how the expected number of iterations to visit a predetermined objective function value level can be estimated for cyclical simulated annealing. Cyclical simulated annealing uses a cooling schedule that cycles through a set of temperature values. Computational results with traveling salesman problem instances taken from TSPLIB show how the expected number of iterations to visit solutions with predetermined objective function levels can be estimated for cyclical simulated annealing.
Keywords: local search algorithms; heuristics; simulated annealing; cooling schedules (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://link.springer.com/10.1007/s11009-005-1482-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:metcap:v:7:y:2005:i:2:d:10.1007_s11009-005-1482-2
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/11009
DOI: 10.1007/s11009-005-1482-2
Access Statistics for this article
Methodology and Computing in Applied Probability is currently edited by Joseph Glaz
More articles in Methodology and Computing in Applied Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().