Shortest Path Optimisation of the CyberKnife treatment in Radiotherapy

Title

Shortest Path Optimisation of the CyberKnife treatment in Radiotherapy

 Author

Mühlsteff, Joris (TU Delft Electrical Engineering, Mathematics and Computer Science)

Contributor

Keijzer, Marleen (mentor)
Breedveld, S (mentor)

Degree granting institution

Delft University of Technology

 Programme

Applied Mathematics

 Date

2017-07-06

 Abstract

In the history of medicine, different treatments for cancer have been developed, such as radiotherapy, surgery and chemotherapy. However, nowadays more than 50% of the people diagnosed with cancer, undergo a radiotherapy treatment. One of the devices used for the treatment is the CyberKnife: a robotic radiodurgery system that can move around the patient using 102 virtually placed nodes. For the treatment of a patient, usually around 25 nodes are used, which result in a certain plan quality for the patient. The aim of this project is to find shorter paths than the existing ones, without significantly degrading the plan quality. This is done by using Dijkstra’s Algorithm, as well as incorporating Hamiltonian paths and the Traveling Salesman Problem. With these techniques, we developed the OPA (Optimal Path Algorithm): an algorithm that finds Hamiltonian paths through the nodes, combined with the iterated process of interchanging nodes with adjacent ones. With OPA, the traveltimes for the CyberKnife have been brought down by 38.6% on average without degrading the plan quality.

 Subject

Radiotherapy
Optimisation
CyberKnife
shortest path
Hamiltonian paths
Traveling Salesman Problem

 To reference this document use:

http://resolver.tudelft.nl/uuid:ca6d9fce-6c92-4ff2-a829-12e52e900506

 Embargo date

2019-07-06

 Part of collection

Student theses

 Document type

bachelor thesis

 Rights

© 2017 Joris Mühlsteff
Files
PDF BEP_verslag.pdf 1.94 MB
Close viewer