SciPost logo

Codebase release 1.0 for evortran

Thomas Biekötter

SciPost Phys. Codebases 64-r1.0 (2026) · published 27 January 2026

This Publication is part of a bundle

When citing, cite all relevant items (e.g. for a Codebase, cite both the article and the release you used).

DOI Type Published on
10.21468/SciPostPhysCodeb.64 Article 2026-01-27
10.21468/SciPostPhysCodeb.64-r1.0 Codebase release 2026-01-27

Abstract

evortran is a modern Fortran library designed for high-performance genetic algorithms and evolutionary optimization. evortran can be used to tackle a wide range of problems in high-energy physics and beyond, such as derivative-free parameter optimization, complex search taks, parameter scans and fitting experimental data under the presence of instrumental noise. The library is built as an fpm package with flexibility and efficiency in mind, while also offering a simple installation process, user interface and integration into existing Fortran (or Python) programs. evortran offers a variety of selection, crossover, mutation and elitism strategies, with which users can tailor an evolutionary algorithm to their specific needs. evortran supports different abstraction levels: from operating directly on individuals and populations, to running full evolutionary cycles, and even enabling migration between independently evolving populations to enhance convergence and maintain diversity. In this paper, we present the functionality of the evortran library, demonstrate its capabilities with example benchmark applications, and compare its performance with existing genetic algorithm frameworks. As physics-motivated applications, we use evortran to confront extended Higgs sectors with LHC data and to reconstruct gravitational wave spectra and the underlying physical parameters from LISA mock data, demonstrating its effectiveness in realistic, data-driven scenarios.


Ontology / Topics

See full Ontology or Topics database.

Machine learning (ML)

Author / Affiliations: mappings to Contributors and Organizations

See all Organizations.
Funders for the research work leading to this publication