Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Models for Radiation Therapy Patient Scheduling
KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Optimeringslära och systemteori.
KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Programvaruteknik och datorsystem, SCS.ORCID-id: 0000-0002-6283-7004
2019 (engelsk)Inngår i: 25th International Conference on Principles and Practice of Constraint Programming, CP 2019, Springer, 2019, Vol. 11802, s. 421-437Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

In Europe, around half of all patients diagnosed with cancer are treated with radiation therapy. To reduce waiting times, optimizing the use of linear accelerators for treatment is crucial. This paper introduces an Integer Programming (IP) and two Constraint Programming (CP) models for the non-block radiotherapy patient scheduling problem. Patients are scheduled considering priority, pattern, duration, and start day of their treatment. The models include expected future patient arrivals. Treatment time of the day is included in the models as time windows which enable more realistic objectives and constraints. The models are thoroughly evaluated for multiple different scenarios, altering: planning day, machine availability, arrival rates, patient backlog, and the number of time windows in a day. The results demonstrate that the CP models find feasible solutions earlier, while the IP model reaches optimality considerably faster.

sted, utgiver, år, opplag, sider
Springer, 2019. Vol. 11802, s. 421-437
Serie
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743 ; 11802
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-265123DOI: 10.1007/978-3-030-30048-7_25Scopus ID: 2-s2.0-85075737127ISBN: 9783030300470 (tryckt)OAI: oai:DiVA.org:kth-265123DiVA, id: diva2:1377367
Konferanse
25th International Conference on Principles and Practice of Constraint Programming, CP 2019; Stamford; United States; 30 September 2019 through 4 October 2019
Merknad

QC 20191211

Tilgjengelig fra: 2019-12-11 Laget: 2019-12-11 Sist oppdatert: 2020-01-29bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Schulte, Christian

Søk i DiVA

Av forfatter/redaktør
Frimodig, SaraSchulte, Christian
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 71 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf