Optimizing functionals using Differential Evolution

Abstract

Abstract Metaheuristic algorithms are typically used for optimizing a function f : A → R , where A is a subset of R N . Nevertheless, many real-life problems require A to be a set of functions which makes f a functional. In this paper, we present a methodology to address the optimization of functionals by using the evolutionary algorithm known as Differential Evolution. Unlike traditional techniques where continuity and differentiability assumptions are required to solve some associated differential equations—like calculus of variations, Pontryagin’s principle or dynamic programming, the optimization is carried out directly on the functional without the need of any of the assumptions mentioned before. Lagrangians involving derivatives are considered, these derivatives are computed implementing Automatic Differentiation with dual numbers. To the best of our knowledge, this is the first time that a metaheuristic optimization approach has been applied to directly optimize a broad variety of functionals. The effectiveness of our methodology is validated by solving two problems. The first problem is related to the implementation of quarantine and isolation in SARS epidemics and the second validation problem deals with the well-known brachistochrone curve problem. The results of both validation problems are in outstanding agreement with those obtained with the application of traditional techniques, specifically with the Forward–Backward-Sweep method in the first problem, and with the calculus of variations for the latter problem. We also found that interpolation may be employed to solve the large scale global optimization problems arisen in the optimization of functionals.