PENGOPTIMASIAN QUERY MENGGUNAKAN SIMULATED ANNEALING
Total View This Week0
Total View This Week0
Institusion
Universitas Komputer Indonesia
Author
Muliawati, Vani
Subject
2007
Datestamp
2016-11-16 07:46:46
Abstract :
algorithm of simulated annealing is common algorithm ( general) to finish the problem of kombinatorial optimasi. Algorithm process of simulated annealing have ability to replace solution in this time ( solution current) with better solution (solution inferior) with global optimum certain positive probability so that expected can be obtained by after passing a large amount of iterasi. Reached result with algorithm of simulated annealing can reach optimum solution. Ever greater of temperature value ( T ) hence its result will be accurate progressively. On the contrary assess T needn't too big because will make end result less accurate. But that way, result of examination hereinafter just earn differ because algorithm component of simulated annealing base on at function of random.
algorithm of simulated annealing is common algorithm ( general) to finish the problem of kombinatorial optimasi. Algorithm process of simulated annealing have ability to replace solution in this time ( solution current) with better solution (solution inferior) with global optimum certain positive probability so that expected can be obtained by after passing a large amount of iterasi. Reached result with algorithm of simulated annealing can reach optimum solution. Ever greater of temperature value ( T ) hence its result will be accurate progressively. On the contrary assess T needn't too big because will make end result less accurate. But that way, result of examination hereinafter just earn differ because algorithm component of simulated annealing base on at function of random.
Download
book
BibTex
Latex, Jabref
cloud_download
Original Resource
url resource Institution
