Article1891: Unterschied zwischen den Versionen
K (Added from ontology) |
Uri (Diskussion | Beiträge) |
||
Zeile 21: | Zeile 21: | ||
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
− | |Abstract=In many practical optimization problems, evaluation of a solution is subject to noise, e.g., due to stochastic simulations or measuring errors. Therefore, heuristics are needed that are capable of handling such noise. This paper first reviews the state-of-the-art in applying simulated annealing to noisy optimization problems. Then, two new algorithmic variants are proposed: an improved version of stochastic annealing that allows for arbitrary annealing schedules, and a new approach called simulated annealing in noisy environments (SANE). The latter integrates ideas from statistical sequential selection in order to reduce the number of samples required for making an acceptance decision with sufficient statistical confidence. Finally, SANE is shown to significantly outperform other state-of-the-art simulated annealing techniques on a stochastic travelling salesperson problem. | + | |Abstract=In many practical optimization problems, evaluation of a solution is subject to noise, e.g., due to stochastic simulations or measuring errors. Therefore, heuristics are needed that are capable of handling such noise. This paper first reviews the state-of-the-art in applying simulated annealing to noisy optimization problems. Then, two new algorithmic variants are proposed: an improved version of stochastic annealing that allows for arbitrary annealing schedules, and a new approach called simulated annealing in noisy environments (SANE). The latter integrates ideas from statistical sequential selection in order to reduce the number of samples required for making an acceptance decision with sufficient statistical confidence. Finally, SANE is shown to significantly outperform other state-of-the-art simulated annealing techniques on a stochastic travelling salesperson problem. |
− | + | |Forschungsgruppe=Effiziente Algorithmen | |
− | |||
− | |||
− | |Forschungsgruppe= | ||
}} | }} |
Aktuelle Version vom 24. September 2009, 20:58 Uhr
Simulated annealing in the presence of noise
Simulated annealing in the presence of noise
Veröffentlicht: 2008
Journal: Journal of Heuristics
Nummer: 14
Seiten: 627-654
Verlag: Kluwer
Referierte Veröffentlichung
Kurzfassung
In many practical optimization problems, evaluation of a solution is subject to noise, e.g., due to stochastic simulations or measuring errors. Therefore, heuristics are needed that are capable of handling such noise. This paper first reviews the state-of-the-art in applying simulated annealing to noisy optimization problems. Then, two new algorithmic variants are proposed: an improved version of stochastic annealing that allows for arbitrary annealing schedules, and a new approach called simulated annealing in noisy environments (SANE). The latter integrates ideas from statistical sequential selection in order to reduce the number of samples required for making an acceptance decision with sufficient statistical confidence. Finally, SANE is shown to significantly outperform other state-of-the-art simulated annealing techniques on a stochastic travelling salesperson problem.