# Adaptive dynamic ϵ-simulated annealing algorithm for tumor immunotherapy

**Authors:** Xiaoyan Sun, Ying Jiang

PMC · DOI: 10.3389/fimmu.2025.1603551 · 2025-06-18

## TL;DR

A new optimization algorithm called ADϵSA is developed to find optimal cancer treatment schedules by simulating tumor-immune interactions.

## Contribution

The novel ADϵSA algorithm combines adaptive constraints and mutation mechanisms for optimizing complex, nonlinear cancer treatment models.

## Key findings

- ADϵSA reduced simulated tumor burden from ~1500 to below 500 cells while maintaining physiological limits.
- ADϵSA outperformed traditional metaheuristics like PSO and GA in convergence and feasibility for dynamic ODE-based systems.
- The algorithm successfully optimized schedules for chemotherapy, immunotherapy, and anti-angiogenic agents.

## Abstract

Personalized cancer treatment requires precise scheduling of multiple therapeutic agents under biological constraints. Optimizing such regimens is especially challenging due to the nonlinear dynamics of tumor-immune interactions and strict feasibility boundaries. This study aims to develop an intelligent optimization approach capable of handling these complexities within a mathematical tumor treatment model.

We propose an Adaptive Dynamic ϵ-Simulated Annealing (ADϵSA) algorithm that integrates a multi-population search framework, dynamic ϵ-constraint control, and boundary-aware mutation mechanisms. The algorithm is applied to an improved tumor immunotherapy model (ITIT), formulated using ordinary differential equations (ODEs) based on established experimental and clinical studies. The model incorporates tumor cells, immune effector cells, and three types of anti-tumor drugs: chemotherapy, immunotherapy, and anti-angiogenic agents.

Simulation experiments were conducted on twelve classical benchmark functions to evaluate the convergence performance and robustness of the algorithm. ADϵSA demonstrated strong global search capability, fast convergence, and solution stability. When applied to the ITIT model, the algorithm successfully identified optimal drug dosing schedules that significantly reduced simulated tumor burden—from ~1500 to below 500 cells—while maintaining treatment within physiologically acceptable limits.

Unlike traditional metaheuristics such as PSO or GA, which are less suited for constraint-rich, dynamic ODE-based systems, ADϵSA offers structural advantages in trajectory feasibility and adaptive convergence. This study highlights the potential of biologically informed optimization algorithms in personalized oncology and provides a computational basis for future closed-loop, patient-specific treatment strategies.

## Linked entities

- **Diseases:** cancer (MONDO:0004992)

## Full-text entities

- **Diseases:** cancer (MESH:D009369)
- **Species:** Homo sapiens (human, species) [taxon 9606]

## Figures

15 figures with captions in the complete paper: https://tomesphere.com/paper/PMC12213861/full.md

---
Source: https://tomesphere.com/paper/PMC12213861