kth.sePublications
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.).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, Gothenburg, Sweden.
Department of Radiation Oncology, Iridium Netwerk, Antwerp, Belgium.
2023 (English)In: Operations Research Forum, E-ISSN 2662-2556, Vol. 4, no 4, article id 83Article in journal (Refereed) Published
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 arrivals of urgent patients 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.

Place, publisher, year, edition, pages
Springer Nature , 2023. Vol. 4, no 4, article id 83
Keywords [en]
Column generation, Constraint programming, Integer programming, Patient scheduling, Radiation therapy
National Category
Other Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-339035DOI: 10.1007/s43069-023-00251-2Scopus ID: 2-s2.0-85174851496OAI: oai:DiVA.org:kth-339035DiVA, id: diva2:1815525
Note

QC 20231129

Available from: 2023-11-29 Created: 2023-11-29 Last updated: 2023-11-30Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Frimodig, SaraEnqvist, Per

Search in DiVA

By author/editor
Frimodig, SaraEnqvist, Per
By organisation
Mathematics (Dept.)Optimization and Systems Theory
Other Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 97 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