🤖 AI Summary
Evolutionary algorithms often struggle to gain practitioners’ trust in real-world physics-based optimization due to slow convergence and poor interpretability. This study systematically analyzes five representative physics-driven optimization problems to identify shared requirements concerning algorithmic performance and interpretability, thereby revealing critical gaps between current research and practical deployment. Building on these insights, we propose an evolutionary computation framework that integrates rapid convergence mechanisms with interpretability-enhancing techniques—such as search trajectory visualization and solution provenance tracing—to explicitly address key application needs. Our approach leverages underutilized yet readily available methodological pathways, substantially improving both the practical utility and credibility of evolutionary algorithms in physics-informed optimization contexts.
📝 Abstract
Evolutionary computation offers a variety of tools to solve complex real-world optimization problems. However, research often focuses on smaller, simplified problems and optimization algorithms that sometimes miss expectations in real-world scenarios. Additionally, trust in the applied algorithm and the solutions it provides is often essential in such settings, but requires an understanding of the search process itself. This leads to evolutionary computation often not being seriously considered by practitioners in many application contexts, among them physics-based modeling. In this article, techniques from evolutionary computation are detailed that can alleviate these problems. First, five real-world physics-based optimization problems are introduced and described by domain experts. For each of these, the requirements for the evolutionary algorithm regarding performance and explainability to increase trust and usability are presented. We found that all domain experts expect fast convergence to a good solution and want some explanations for how the results were formed, while other requirements strongly depend on the respective problem. Finally, we present existing approaches that can be leveraged to improve those aspects of evolutionary algorithms but have to our knowledge never been employed in complex real-world scenarios. This implies a gap between both domains that needs to be closed to exploit the full potential of evolutionary computation.