A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
This paper presents hierarchical improvements to the combinatorial stochastic annealing algorithm using a new and efficient sampling technique. The Hammersley sequence sampling technique is used for updating discrete combinations, reducing the Markov chain length, determining the number of samples automatically, and embedding better confidence intervals of the samples. The improved algorithm, Hammersley stochastic annealing, can significantly improve computational efficiency over traditionaldoi:10.1021/ie0101689 fatcat:4s5lmj53mvgpjadmclfmx6h6s4