kth.sePublications KTH
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Comparing Optimization Methods for Radiation Therapy Patient Scheduling using Different Objectives
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. RaySearch Laboratories, Stockholm, Sweden.ORCID iD: 0000-0002-7012-5015
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.ORCID iD: 0000-0002-4635-3202
Department of Computer Science, RISE Research Institutes of Sweden.
Department of Radiation Oncology, Iridium Netwerk, Antwerp, Belgium.
(English)Manuscript (preprint) (Other academic)
Abstract [en]

Radiation therapy (RT) is a medical treatment to kill cancer cells or shrink tumors. To manually schedule patients for RT is a time-consuming and challenging task. By the use of optimization, patient schedules for RT can be created automatically. This paper presents a study of different optimization methods for modeling and solving the RT patient scheduling problem, which can be used as decision support when implementing an automatic scheduling algorithm in practice. We introduce an Integer Programming (IP) model, a column generation IP model (CG-IP), and a Constraint Programming model. Patients are scheduled on multiple machine types considering their priority for treatment, session duration and allowed machines. Expected future patient arrivals are included in the models as placeholder patients. Since different cancer centers can have different scheduling objectives, the models are compared using multiple objective functions, including minimizing waiting times, and maximizing the fulfillment of patients’ preferences for treatment times. The test data is generated from historical data from Iridium Netwerk, Belgium’s largest cancer center with 10 linear accelerators. The results demonstrate that the CG-IP model can solve all the different problem instances to a mean optimality gap of less than 1% within one hour. The proposed methodology provides a tool for automated scheduling of RT treatments and can be generally applied to RT centers.

Keywords [en]
Patient scheduling, Radiation therapy, Integer programming, Constraint programming, Column generation
National Category
Other Mathematics
Research subject
Applied and Computational Mathematics, Optimization and Systems Theory
Identifiers
URN: urn:nbn:se:kth:diva-326203OAI: oai:DiVA.org:kth-326203DiVA, id: diva2:1753282
Note

QC 20230428

Available from: 2023-04-26 Created: 2023-04-26 Last updated: 2023-04-28Bibliographically approved
In thesis
1. Radiation Therapy Patient Scheduling: An Operations Research Approach
Open this publication in new window or tab >>Radiation Therapy Patient Scheduling: An Operations Research Approach
2023 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

The manual scheduling of patients for radiation therapy is difficult and labor-intensive. With the increase in cancer patient numbers, efficient resource planning is an important tool to achieve short waiting times and equal right to care. This thesis studies an operations research approach to the radiation therapy scheduling problem. The four appended papers each provide incremental steps towards a clinical implementation of an automated scheduling algorithm.

In Paper A, three models for the radiation therapy scheduling problem in a simplified clinical setup are proposed. It is shown that the two constraint programming models find feasible solutions more quickly, while the integer programming model proves optimality faster. However, none of the models can solve large problem instances in sufficient time. In Paper B a collaboration with a large cancer center with ten linear accelerators is initiated. The previous models are refined and adapted to a more realistic clinical setup. Moreover, a column generation approach is introduced. The models are compared using different objective function combinations designed to mimic the scheduling objectives at different cancer centers. The column generation approach outperforms the other methods on all problem instances, regardless of what objective is optimized. In Paper C the column generation approach is further developed to include additional medical and technical constraints. Different methods to ensure that there are available resources for high priority patients at arrival are compared. Finally, in Paper D the potential for clinical implementation of the column generation approach is evaluated. The schedules generated by the column generation model are clinically validated. Compared to manually constructed, historical schedules for a time period of one year, the automatically generated schedules are shown to decrease the average patient waiting time by 80%, improve the consistency in treatment times between appointments by 80%, and increase the number of treatments scheduled the machine best suited for the treatment by more than 90%, without loss of performance in other quality metrics. 

Since the constraints between radiotherapy centers are similar and multiple objective functions are presented, the column generation approach can be generally used for automated patient scheduling in radiation therapy. This would allow radiotherapy centers to save time during the scheduling process and improve the quality of the schedules. 

Abstract [sv]

Att för hand schemalägga patienter för strålterapi är svårt och tidskrävande. Antalet cancerfall ökar i världen, vilket har gjort effektiv  resursplanering till ett viktigt verktyg för att uppnå korta väntetider och patienters lika rätt till vård. Denna avhandling studerar användandet av operationsanalys för schemaläggning av patienter för strålterapi. Var och en av de fyra bifogade artiklarna gör inkrementella steg mot en klinisk implementation av en automatiserad schemaläggningsalgoritm. 

Artikel A presenterar tre modeller för att schemalägga patienter för strålterapi. Resultaten visar att de två villkorsprogrammeringsmodellerna tidigare hittar tillåtna lösningar, medan heltalsprogrammeringsmodellen snabbare kan bevisa optimalitet. Ingen av modellerna kan dock lösa större problem inom en rimlig tidsram. I artikel B förbättras och utvecklas modellerna för att återspegla en mer realistisk cancerklinik. Utöver det introduceras en ny kolumngenereringsmetod. Olika målfunktioner utformas för att efterlikna målen med schemaläggningen på olika cancerkliniker, och de olika modellerna jämförs med hjälp av dessa målfunktioner.  Resultaten visar att kolumngenereringsmetoden överträffar de andra modellerna på alla probleminstanser, oavsett vilken målfunktion som används. I artikel C utökas kolumngenereringsmodellen med fler bivillkor för ytterligare medicinska och tekniska krav på schemana inom ett kliniskt samarbete med en stor cancerklinik med tio linjäracceleratorer. Därtill jämförs olika sätt att säkerställa att det finns resurser för akuta patienter direkt vid ankomst. I artikel D utvärderas slutligen vilken potential kolumngenereringsalgoritmen har för klinisk implementation. Automatiskt genererade scheman valideras kliniskt och jämförs med ett kliniskt schema som lagts manuellt för en tidsperiod av ett år. Det automatiskt genererade schemat minskar den genomsnittliga väntetiden för behandlingsstart med 80%, förbättrar den genomsnittliga jämnheten i tidsbokningarna med 80%, och ökar antalet fraktioner schemalagda på de maskiner som är bäst lämpade för behandlingen med över 90% jämfört med de manuellt konstruerade schemana, utan att försämra kvaliteten i övrigt. 

Kraven på scheman liknar varandra mellan olika cancerkliniker. Eftersom flera olika målfunktioner presenteras innebär det att kolumngenereringsmetoden går att applicera på olika kliniker för att automatiskt schemalägga patienter för strålterapi. Detta skulle göra det möjligt för strålterapikliniker att spara tid under schemaläggningsprocessen, och samtidigt förbättra kvaliteten på schemana och därmed vården.

Place, publisher, year, edition, pages
Stockholm, Sweden: KTH Royal Institute of Technology, 2023. p. vii, 57
Series
TRITA-SCI-FOU ; 2023;10
Keywords
Radiation therapy scheduling, patient scheduling, multi-appointment scheduling, operations research, integer programming, constraint programming, column generation, Schemaläggning, strålterapi, operationsanalys, heltalsprogrammering, villkorsprogrammering, kolumngenerering
National Category
Other Mathematics
Research subject
Applied and Computational Mathematics, Optimization and Systems Theory
Identifiers
urn:nbn:se:kth:diva-326208 (URN)978-91-8040-535-5 (ISBN)
Public defence
2023-05-26, F3, Lindstedtsvägen 26, Stockholm, Sweden, 10:00 (English)
Opponent
Supervisors
Note

QC 20230427

Available from: 2023-04-27 Created: 2023-04-26 Last updated: 2025-10-29Bibliographically approved

Open Access in DiVA

No full text in DiVA

Authority records

Enqvist, Per

Search in DiVA

By author/editor
Frimodig, SaraEnqvist, Per
By organisation
Optimization and Systems Theory
Other Mathematics

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 186 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf