IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v4y2002i3d10.1023_a1022596700741.html
   My bibliography  Save this article

Scale Invariance Properties in the Simulated Annealing Algorithm

Author

Listed:
  • M. A. Fleischer

    (University of Maryland)

  • S. H. Jacobson

    (University of Illinois at Urbana-Champaign)

Abstract

The Boltzmann distribution used in the steady-state analysis of the simulated annealing algorithm gives rise to several scale invariant properties. Scale invariance is first presented in the context of parallel independent processors and then extended to an abstract form based on lumping states together to form new aggregate states. These lumped or aggregate states possess all of the mathematical characteristics, forms and relationships of states (solutions) in the original problem in both first and second moments. These scale invariance properties therefore permit new ways of relating objective function values, conditional expectation values, stationary probabilities, rates of change of stationary probabilities and conditional variances. Such properties therefore provide potential applications in analysis, statistical inference and optimization. Directions for future research that take advantage of scale invariance are also discussed.

Suggested Citation

  • M. A. Fleischer & S. H. Jacobson, 2002. "Scale Invariance Properties in the Simulated Annealing Algorithm," Methodology and Computing in Applied Probability, Springer, vol. 4(3), pages 219-241, September.
    • Handle: RePEc:spr:metcap:v:4:y:2002:i:3:d:10.1023_a:1022596700741
    DOI: 10.1023/A:1022596700741
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1022596700741
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1022596700741?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. James P. Hobert, 2002. "On the applicability of regenerative simulation in Markov chain Monte Carlo," Biometrika, Biometrika Trust, vol. 89(4), pages 731-743, December.
    2. Leyuan Shi & Sigurdur Ólafsson, 2000. "Nested Partitions Method for Global Optimization," Operations Research, INFORMS, vol. 48(3), pages 390-407, June.
    3. Mark Fleischer & Sheldon H. Jacobson, 1999. "Information Theory and the Finite-Time Behavior of the Simulated Annealing Algorithm: Experimental Results," INFORMS Journal on Computing, INFORMS, vol. 11(1), pages 35-43, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chang, Kuo-Hao & Kuo, Po-Yi, 2018. "An efficient simulation optimization method for the generalized redundancy allocation problem," European Journal of Operational Research, Elsevier, vol. 265(3), pages 1094-1101.
    2. Johnson, Alicia A. & Jones, Galin L., 2015. "Geometric ergodicity of random scan Gibbs samplers for hierarchical one-way random effects models," Journal of Multivariate Analysis, Elsevier, vol. 140(C), pages 325-342.
    3. Lee, Loo Hay & Chew, Ek Peng & Manikam, Puvaneswari, 2006. "A general framework on the simulation-based optimization under fixed computing budget," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1828-1841, November.
    4. David R. Morrison & Jason J. Sauppe & Wenda Zhang & Sheldon H. Jacobson & Edward C. Sewell, 2017. "Cyclic best first search: Using contours to guide branch‐and‐bound algorithms," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(1), pages 64-82, February.
    5. Tahir Ekin & Stephen Walker & Paul Damien, 2023. "Augmented simulation methods for discrete stochastic optimization with recourse," Annals of Operations Research, Springer, vol. 320(2), pages 771-793, January.
    6. Bertail, Patrice & Clemencon, Stephan, 2008. "Approximate regenerative-block bootstrap for Markov chains," Computational Statistics & Data Analysis, Elsevier, vol. 52(5), pages 2739-2756, January.
    7. Armstrong, Derek E. & Jacobson, Sheldon H., 2008. "An analysis of neighborhood functions on generic solution spaces," European Journal of Operational Research, Elsevier, vol. 186(2), pages 529-541, April.
    8. Lingxuan Liu & Leyuan Shi, 2019. "Simulation Optimization on Complex Job Shop Scheduling with Non-Identical Job Sizes," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(05), pages 1-26, October.
    9. Choi, Hyunhong & Koo, Yoonmo, 2018. "Using Contingent Valuation and Numerical Methods to Determine Optimal Locations for Environmental Facilities: Public Arboretums in South Korea," Ecological Economics, Elsevier, vol. 149(C), pages 184-201.
    10. Gino Lim & Laleh Kardar & Wenhua Cao, 2014. "A hybrid framework for optimizing beam angles in radiation therapy planning," Annals of Operations Research, Springer, vol. 217(1), pages 357-383, June.
    11. Michael Macgregor Perry, 2021. "Fisheries Management in Congested Waters: A Game-Theoretic Assessment of the East China Sea," Papers 2110.13966, arXiv.org, revised Feb 2022.
    12. Jeffrey D. Camm & James J. Cochran & David J. Curry & Sriram Kannan, 2006. "Conjoint Optimization: An Exact Branch-and-Bound Algorithm for the Share-of-Choice Problem," Management Science, INFORMS, vol. 52(3), pages 435-447, March.
    13. Bhattacharya, Sourabh, 2008. "Consistent estimation of the accuracy of importance sampling using regenerative simulation," Statistics & Probability Letters, Elsevier, vol. 78(15), pages 2522-2527, October.
    14. Zhenyuan Liu & Lei Xiao & Jing Tian, 2016. "An activity-list-based nested partitions algorithm for resource-constrained project scheduling," International Journal of Production Research, Taylor & Francis Journals, vol. 54(16), pages 4744-4758, August.
    15. Weiwei Chen & Jie Song & Leyuan Shi & Liang Pi & Peter Sun, 2013. "Data mining-based dispatching system for solving the local pickup and delivery problem," Annals of Operations Research, Springer, vol. 203(1), pages 351-370, March.
    16. K. Gokbayrak & C.G. Cassandras, 2002. "Generalized Surrogate Problem Methodology for Online Stochastic Discrete Optimization," Journal of Optimization Theory and Applications, Springer, vol. 114(1), pages 97-132, July.
    17. K. Gokbayrak & C. G. Cassandras, 2001. "Online Surrogate Problem Methodology for Stochastic Discrete Resource Allocation Problems," Journal of Optimization Theory and Applications, Springer, vol. 108(2), pages 349-376, February.
    18. Sheldon H. Jacobson & Shane N. Hall & Laura A. McLay & Jeffrey E. Orosz, 2005. "Performance Analysis of Cyclical Simulated Annealing Algorithms," Methodology and Computing in Applied Probability, Springer, vol. 7(2), pages 183-201, June.
    19. Lihua Sun & L. Jeff Hong & Zhaolin Hu, 2014. "Balancing Exploitation and Exploration in Discrete Optimization via Simulation Through a Gaussian Process-Based Search," Operations Research, INFORMS, vol. 62(6), pages 1416-1438, December.
    20. Pieter-Tjerk de Boer & Dirk Kroese & Shie Mannor & Reuven Rubinstein, 2005. "A Tutorial on the Cross-Entropy Method," Annals of Operations Research, Springer, vol. 134(1), pages 19-67, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:metcap:v:4:y:2002:i:3:d:10.1023_a:1022596700741. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.