2009
DOI: 10.1007/978-3-642-02976-9_14
|View full text |Cite
|
Sign up to set email alerts
|

Genetic Algorithm Based Scheduling of Radiotherapy Treatments for Cancer Patients

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
24
0
1

Year Published

2011
2011
2023
2023

Publication Types

Select...
6
3

Relationship

1
8

Authors

Journals

citations
Cited by 20 publications
(25 citation statements)
references
References 3 publications
0
24
0
1
Order By: Relevance
“…Optimizing the overall RT chain using both constructive heuristics and metaheuristics, Petrovic et al [32] achieved considerable reductions in waiting times for palliative (34%) and radical patients (41%). Focusing on the pre-treatment stage, Petrovic et al [33] explored similarities between radiotherapy and job-shop scheduling problems commonly encountered in industrial processes, using genetic algorithms to minimize both the average waiting times and the average delays in the start of treatment. Results showed that these indicators were reduced by 35% and 20%, respectively.…”
Section: Resultsmentioning
confidence: 99%
“…Optimizing the overall RT chain using both constructive heuristics and metaheuristics, Petrovic et al [32] achieved considerable reductions in waiting times for palliative (34%) and radical patients (41%). Focusing on the pre-treatment stage, Petrovic et al [33] explored similarities between radiotherapy and job-shop scheduling problems commonly encountered in industrial processes, using genetic algorithms to minimize both the average waiting times and the average delays in the start of treatment. Results showed that these indicators were reduced by 35% and 20%, respectively.…”
Section: Resultsmentioning
confidence: 99%
“…Several further heuristic as well as exact approaches followed. Heuristic techniques range from a greedy randomized adaptive search procedure (GRASP) (Petrovic and Leite‐Rocha, ) and steepest hill climbing methods (Kapamara and Petrovic, ; Riff et al., ) to more advanced techniques using genetic algorithms (GAs) (Petrovic et al., , ). Exact methods are based on mixed integer linear programming (MILP) models and consider different levels of granularity (Conforti et al., ; Burke et al., ).…”
Section: Related Workmentioning
confidence: 99%
“…Optimizing the overall RT chain using both constructive heuristics and metaheuristics, Petrovic et al [32] achieved considerable reductions in waiting times for palliative (34%) and radical patients (41%). Focusing on the pre-treatment stage, Petrovic et al [33] explored similarities between radiotherapy and jobshop scheduling problems commonly encountered in industrial processes, using genetic algorithms to minimize both the average waiting times and the average delays in the start of treatment. Results showed that these indicators were reduced by 35% and 20%, respectively.…”
Section: Schedulingmentioning
confidence: 99%