Abstract
Several inverse problems exist in the atmospheric sciences that are computationally costly when using traditional gradient based methods. Unfortunately, many standard evolutionary algorithms do not perform well on these problems. This paper investigates why the temperature inversion problem is so difficult for heuristic search. We show that algorithms imposing smoothness constraints find more competitive solutions. Additionally, a new algorithm is presented that rapidly finds approximate solutions. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Lunacek, M., Whitley, D., Gabriel, P., & Stephens, G. (2004). Comparing search algorithms for the temperature inversion problem. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. https://doi.org/10.1007/978-3-540-24854-5_128
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
