1994
DOI: 10.1007/bf02065876
|View full text |Cite
|
Sign up to set email alerts
|

Practical considerations in the application of simulated annealing to stochastic simulation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
64
0

Year Published

1999
1999
2021
2021

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 112 publications
(64 citation statements)
references
References 7 publications
0
64
0
Order By: Relevance
“…In this study, initial random images, which reproduce the variogram, were disturbed by the change of Z values in two randomly selected sites. The preestablished contrast was the reproduction of the variogram, and the correspondent function was minimized using a standard annealing procedure (Deutsch & Cockerham, 1994).…”
Section: Methodsmentioning
confidence: 99%
“…In this study, initial random images, which reproduce the variogram, were disturbed by the change of Z values in two randomly selected sites. The preestablished contrast was the reproduction of the variogram, and the correspondent function was minimized using a standard annealing procedure (Deutsch & Cockerham, 1994).…”
Section: Methodsmentioning
confidence: 99%
“…Continuous Markov chain models (MCM) are used to represent the model of spatial variability (Krumbein and Dacey, 1969;Carle and Fogg, 1997;Ritzi, 2000). TProGS allows for the simulation of multiple realizations by utilizing a sequential indicator simulation (SIS) (Seifert and Jensen, 1999) and by performing simulated quenching (Deutsch and Cockerham, 1994;Carle, 1997). These two steps are mutually dependent and they make sure that the realizations honor local conditioning data as well as the defined model of spatial variability.…”
Section: Tprogs -Transition Probability Geostatistical Softwarementioning
confidence: 99%
“…An initial configuration of facies distribution is produced by the SIS algorithm (Deutsch and Journel, 1992). Secondly, the initial configuration is reshuffled by the simulation quenching optimization algorithm (Deutsch and Cockerham, 1994). The TProGS simulation domain of this study is discretized into 20 m × 20 m × 2 m cells on a 450 ×600 × 40 cell grid.…”
Section: Tprogs -Transition Probability Geostatistical Softwarementioning
confidence: 99%
“…To reduce the computational effort, Deutsch and Cockerham (1994) proposed an efilcient method of updating y '(h,).…”
Section: ! mentioning
confidence: 99%
“…c c Conditioning data is then read in (if available) and assigned to the nearest node if within the grid network. ',Iagfl tite(*,*y****** ***************************************r ead(1in,*,er&7) isas write(*,111) isas write(ldbg,l 11) isas 111 forrnat(flAnnealing schedule: ',i2/, +' ( &user, l:defarrl~2fas~3:very fast )') read(lin,*,err=97) (sas(i),i=I,6) read(Iin,*,en=97) part read(1in,*,err=97) seed read(lin,*,es-r=97) nsim read(lin,*,err=97) nx,xnm,xsiz read(lin,*,err=97) ny,yrnn,ysiz read(lin,*,err=97) nz,zrnn,zsiz rcad(Iin, (Deutsch and Cockerham, 1994) c sas(3)=sas(3)*dble(nx*ny*nz) sas(4)=sas(4)*dbIe(nx*ny*nz) if(isas.eq.1) then Sas(l) = I.odo sas(2) = O.ldO sas(3) = 100.dO*dble(nx*ny*nz) 555(4)= 10.dO*dble(nx*ny*nz) sas(5) = 3.dO sas(6) = 0.001dO elseif(isas.eq.2) then 555(I)= l.odo sas(2) =0.05d0 SSS(3)= 50.dO*dble(nx*ny *nz) sas(4) = 5.dO*dble(nx*ny*nz) sas(5) = 3.dO SSS(6)= 0.001dO elseif(isas.eq.3) then sa.s(l) = 0.5d0 sas(2) = O.OldO sas(3) = 10.dO*dble(nx*ny*nz) SSS(4)= 2.dO*dbIe(nx*ny*nz) sas(5) = 3.dO sas(6) = 0.001dO endif write(*,112)(sas(i),i=l,6),part write(ldbg,112)(sas(i),i=l ,6),part 112 forrnat('User set schedule:'/ + 'To = ',f5.lj + 'T factor= ',f5.1J + ' Knrax = ',e7.lj + ' Kaccept = ',e7.l/ + 's =',f5.lJ + 'Ornirs = ',e7.1J + 'Part = ',i2) write(*,*~*********************************************q read(lin,*,en=97) nst,cO,isiIl sill = CO wnte(*, 100) isill,nst,cO if(nst.Ie.0) then write(*,9997) nst 9997 forrnat('nst must beat least 1, it has been set to ',i4J, + 'The c or a values can be set to zero') stop endif + '#of neighborhood = ',i4) write(*,*~*********************************************' read(lbr,*)ymean,ystd,itrans read(lin,*) peut,aspcut,xcrr~ptarget c c Read which annealing algorithm should be used: …”
Section: ------------------------------------------------------------mentioning
confidence: 99%