Comparing Optimization Models for Radiotherapy Scheduling

• URL: http://arxiv.org/abs/2607.22539v1
• Date: Thu, 23 Apr 2026 09:21:16 GMT
• Title: Comparing Optimization Models for Radiotherapy Scheduling
• Abstract summary: The Radiotherapy Scheduling Problem (RTSP) involves determining an optimal schedule for patients undergoing radiation treatments.<n>Here, we develop two novel greedys (named RTSP First Fit and RTSP Best Fit) and use them as constructives for a Simulated Annealing (SA) approach to optimize the scheduling.<n>The results show that the novels achieve solutions close to those of exact methods, while dramatically reducing memory usage.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The Radiotherapy Scheduling Problem (RTSP) involves determining an optimal schedule for patients undergoing radiation treatments, a task that has a massive impact on clinical outcomes given the central role of radiotherapy in cancer care. The daily batch approach--which consists of scheduling all the newly arrived patients together at the end of each day--modelled with Integer Linear Programming, is currently one of the most effective methods for the RTSP. However, this kind of formulation requires substantial computational resources in terms of time and memory. Here, we address these limitations by developing two novel greedy heuristics (named RTSP First Fit and RTSP Best Fit) and use them as constructive heuristics for a Simulated Annealing (SA) approach to optimize the scheduling. The proposed methods--the heuristics alone and their combination with SA--are evaluated on a publicly available dataset against an integer linear program formulation solved with two different state-of-the-art exact solvers. Evaluation metrics include six scheduling objectives capturing patient waiting times, preference satisfaction, and changes in linear accelerator assignment (aggregated in four different weight configurations), solving time, and memory consumption. The results show that the novel heuristics achieve solutions close to those of exact methods, while dramatically reducing runtime and memory usage; furthermore, when combined with SA, they further improve the solution quality while maintaining low runtime and memory usage.

Related papers

• A learning-driven automatic planning framework for proton PBS treatments of H&N cancers [2.0765076553348316]
  Inverse parameter is a learning-to-optimize (L2O) method that predicts update steps by learning from task-specific data distributions.<n>In experiments, total 97 patients with bilateral or ipsilateral H&N cancers are collected for training and testing.
  arXiv  Detail & Related papers  (2025-08-14T21:50:31Z)
• Random-Key Algorithms for Optimizing Integrated Operating Room Scheduling [0.16385815610837165]
  This study introduces a novel concept of Random-Key (RKO), rigorously tested on literature and new real-world inspired instances.<n>Our literature optimization problem incorporates multi-room scheduling, equipment scheduling, and complex availability constraints.<n>The RKO approach represents solutions as points in a continuous space, which are then mapped in the problem solution space via a deterministic function known as a decoder.
  arXiv  Detail & Related papers  (2025-01-17T15:11:30Z)
• Uplift modeling with continuous treatments: A predict-then-optimize approach [4.132346971686944]
  The goal of uplift modeling is to recommend actions that optimize specific outcomes by determining which entities should receive treatment.<n>While uplift modeling typically focuses on binary treatments, many real-world applications are characterized by continuousvalued treatments.<n>This paper presents a predictthenoptimize framework to allow for continuous treatments in uplift modeling.
  arXiv  Detail & Related papers  (2024-12-12T12:43:42Z)
• Biomimicry in Radiation Therapy: Optimizing Patient Scheduling for Improved Treatment Outcomes [0.0]
  This study delves into the integration of biomimicry principles within the domain of Radiation Therapy (RT) to optimize patient scheduling. Three bio-inspired algorithms are employed for optimization to tackle the complex online scheduling problem. The results of this study unveil the effectiveness of applied bio-inspired algorithms in optimizing patient scheduling for RT.
  arXiv  Detail & Related papers  (2024-01-16T15:37:23Z)
• Maximize to Explore: One Objective Function Fusing Estimation, Planning, and Exploration [87.53543137162488]
  We propose an easy-to-implement online reinforcement learning (online RL) framework called textttMEX. textttMEX integrates estimation and planning components while balancing exploration exploitation automatically. It can outperform baselines by a stable margin in various MuJoCo environments with sparse rewards.
  arXiv  Detail & Related papers  (2023-05-29T17:25:26Z)
• TCFimt: Temporal Counterfactual Forecasting from Individual Multiple Treatment Perspective [50.675845725806724]
  We propose a comprehensive framework of temporal counterfactual forecasting from an individual multiple treatment perspective (TCFimt) TCFimt constructs adversarial tasks in a seq2seq framework to alleviate selection and time-varying bias and designs a contrastive learning-based block to decouple a mixed treatment effect into separated main treatment effects and causal interactions. The proposed method shows satisfactory performance in predicting future outcomes with specific treatments and in choosing optimal treatment type and timing than state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-12-17T15:01:05Z)
• A feasibility study of a hyperparameter tuning approach to automated inverse planning in radiotherapy [68.8204255655161]
  The purpose of this study is to automate the inverse planning process to reduce active planning time while maintaining plan quality. We investigated the impact of the choice of dose parameters, random and Bayesian search methods, and utility function form on planning time and plan quality. Using 100 samples was found to produce satisfactory plan quality, and the average planning time was 2.3 hours.
  arXiv  Detail & Related papers  (2021-05-14T18:37:00Z)
• A Two-stage Framework and Reinforcement Learning-based Optimization Algorithms for Complex Scheduling Problems [54.61091936472494]
  We develop a two-stage framework, in which reinforcement learning (RL) and traditional operations research (OR) algorithms are combined together. The scheduling problem is solved in two stages, including a finite Markov decision process (MDP) and a mixed-integer programming process, respectively. Results show that the proposed algorithms could stably and efficiently obtain satisfactory scheduling schemes for agile Earth observation satellite scheduling problems.
  arXiv  Detail & Related papers  (2021-03-10T03:16:12Z)
• Combining Deep Learning and Optimization for Security-Constrained Optimal Power Flow [94.24763814458686]
  Security-constrained optimal power flow (SCOPF) is fundamental in power systems. Modeling of APR within the SCOPF problem results in complex large-scale mixed-integer programs. This paper proposes a novel approach that combines deep learning and robust optimization techniques.
  arXiv  Detail & Related papers  (2020-07-14T12:38:21Z)
• DTR Bandit: Learning to Make Response-Adaptive Decisions With Low Regret [59.81290762273153]
  Dynamic treatment regimes (DTRs) are personalized, adaptive, multi-stage treatment plans that adapt treatment decisions to an individual's initial features and to intermediate outcomes and features at each subsequent stage. We propose a novel algorithm that, by carefully balancing exploration and exploitation, is guaranteed to achieve rate-optimal regret when the transition and reward models are linear.
  arXiv  Detail & Related papers  (2020-05-06T13:03:42Z)
• Multicategory Angle-based Learning for Estimating Optimal Dynamic Treatment Regimes with Censored Data [12.499787110182632]
  An optimal treatment regime (DTR) consists of a sequence of decision rules in maximizing long-term benefits. In this paper, we develop a novel angle-based approach to target the optimal DTR under a multicategory treatment framework. Our numerical studies show that the proposed method outperforms competing methods in terms of maximizing the conditional survival function.
  arXiv  Detail & Related papers  (2020-01-14T05:19:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.