Simulated annealing implementation with shorter Markov chain length to reduce computational burden and its application to the analysis of pulmonary airway architecture

Authors:
Dongyoub Lee;Anthony S. Wexler
Affiliations:
Department of Mechanical and Aerospace Engineering, One Shields Ave., University of California, Davis, CA 95616, USA;Department of Mechanical and Aerospace Engineering, One Shields Ave., University of California, Davis, CA 95616, USA and Department of Civil and Environmental Engineering, University of California ...
Venue:
Computers in Biology and Medicine
Year:
2011

Citing 6
Cited 0

Convergence of an annealing algorithm

Mathematical Programming: Series A and B
Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm: Corrigenda for this article is available here

ACM Transactions on Mathematical Software (TOMS)
Parallel simulated annealing techniques

CNLS '89 Proceedings of the ninth annual international conference of the Center for Nonlinear Studies on Self-organizing, Collective, and Cooperative Phenomena in Natural and Artificial Computing Networks on Emergent computation
Performance of a new annealing schedule

DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Simulated annealing with advanced adaptive neighborhood

Second international workshop on Intelligent systems design and application
ANDYMARK: an analytical method to establish dynamically the length of the markov chain in simulated annealing for the satisfiability problem

SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new way to implement the Simulated Annealing (SA) algorithm was developed and tested that improves computation performance by using shorter Markov chain length (inner iterations) and repeating the entire SA process until the final function value meets the solution criterion. The new approach coupled with the adaptive neighborhood method was tested on the Rosenbrock function in 4 and 13 dimensions. This implementation significantly improved the computation speed without degrading solution quality. The proposed implementation was used to characterize pulmonary architecture from micro CT image data demonstrating the algorithm's effectiveness especially for problems with high computational demand and when the solution quality requirement can be pre-specified. Using this implementation, detailed statistics of the morphometry of conducting airways from 12 male Sprague Dawley rats were obtained for each lobe.