Comparing Local Search Algorithms for the Beam Angles Selection in Radiotherapy

One important problem in radiation therapy for cancer treatment is the selection of the set of beam angles radiation will be delivered from. A primary goal of this problem is to find a beam angle configuration (BAC) that leads to a clinically acceptable treatment plan. Further, this process must be...

Full description

Bibliographic Details
Main Authors: Guillermo Cabrera-Guerrero, Carolina Lagos, Enrique Cabrera, Franklin Johnson, Jose M. Rubio, Fernando Paredes
Format: Article
Language:English
Published: IEEE 2018-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8349957/
id doaj-77bde37bb914402d91f29379509d53d9
record_format Article
spelling doaj-77bde37bb914402d91f29379509d53d92021-03-29T20:44:00ZengIEEEIEEE Access2169-35362018-01-016237012371010.1109/ACCESS.2018.28306468349957Comparing Local Search Algorithms for the Beam Angles Selection in RadiotherapyGuillermo Cabrera-Guerrero0https://orcid.org/0000-0002-8238-7426Carolina Lagos1Enrique Cabrera2Franklin Johnson3Jose M. Rubio4Fernando Paredes5Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Valparaíso, ChileEscuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Valparaíso, ChileCIMFAV, Universidad de Valparaíso, Valparaíso, ChileDepartamento de Computación e Informática, Universidad de Playa Ancha, Valparaíso, ChileUniversidad Tecnológica de Chile INACAP, Santiago, ChileDepartamento de Ingeniería Industrial, Universidad Diego Portales, Santiago, ChileOne important problem in radiation therapy for cancer treatment is the selection of the set of beam angles radiation will be delivered from. A primary goal of this problem is to find a beam angle configuration (BAC) that leads to a clinically acceptable treatment plan. Further, this process must be done within clinically acceptable times. Since the problem of selecting beam angles in radiation therapy is known to be extremely hard-to-solve as well as time-consuming, both exact algorithms and populationbased heuristics might not be suitable to solve this problem. In this paper, we compare three matheuristic methods based on local search algorithms, namely, steepest descent (SD), next descent (ND), and tabu search (TS) to approximately solve the beam angle optimisation problem (BAO). Although the SD algorithm is able to find locally optimal BACs for the BAO problem, it takes too long before convergence. For this reason, we try the ND algorithm as it has been shown to converge quickly to good quality solutions, although no (local) optimality guarantee is given. Finally, the well-known tabu search is also applied to the BAO problem in order to evaluate its performance. A prostate case which considers two organs at risk, namely the rectum and the bladder is considered in this paper. Results show that the ND finds solutions as good as the ones found by the SD algorithm. TS outperforms both the SD and the ND algorithms. Convergence curves for the all three algorithms are studied.https://ieeexplore.ieee.org/document/8349957/Beam angle optimisationlocal searchtabu searchmathematical programmingintensity modulated radiation therapymatheuristics
collection DOAJ
language English
format Article
sources DOAJ
author Guillermo Cabrera-Guerrero
Carolina Lagos
Enrique Cabrera
Franklin Johnson
Jose M. Rubio
Fernando Paredes
spellingShingle Guillermo Cabrera-Guerrero
Carolina Lagos
Enrique Cabrera
Franklin Johnson
Jose M. Rubio
Fernando Paredes
Comparing Local Search Algorithms for the Beam Angles Selection in Radiotherapy
IEEE Access
Beam angle optimisation
local search
tabu search
mathematical programming
intensity modulated radiation therapy
matheuristics
author_facet Guillermo Cabrera-Guerrero
Carolina Lagos
Enrique Cabrera
Franklin Johnson
Jose M. Rubio
Fernando Paredes
author_sort Guillermo Cabrera-Guerrero
title Comparing Local Search Algorithms for the Beam Angles Selection in Radiotherapy
title_short Comparing Local Search Algorithms for the Beam Angles Selection in Radiotherapy
title_full Comparing Local Search Algorithms for the Beam Angles Selection in Radiotherapy
title_fullStr Comparing Local Search Algorithms for the Beam Angles Selection in Radiotherapy
title_full_unstemmed Comparing Local Search Algorithms for the Beam Angles Selection in Radiotherapy
title_sort comparing local search algorithms for the beam angles selection in radiotherapy
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2018-01-01
description One important problem in radiation therapy for cancer treatment is the selection of the set of beam angles radiation will be delivered from. A primary goal of this problem is to find a beam angle configuration (BAC) that leads to a clinically acceptable treatment plan. Further, this process must be done within clinically acceptable times. Since the problem of selecting beam angles in radiation therapy is known to be extremely hard-to-solve as well as time-consuming, both exact algorithms and populationbased heuristics might not be suitable to solve this problem. In this paper, we compare three matheuristic methods based on local search algorithms, namely, steepest descent (SD), next descent (ND), and tabu search (TS) to approximately solve the beam angle optimisation problem (BAO). Although the SD algorithm is able to find locally optimal BACs for the BAO problem, it takes too long before convergence. For this reason, we try the ND algorithm as it has been shown to converge quickly to good quality solutions, although no (local) optimality guarantee is given. Finally, the well-known tabu search is also applied to the BAO problem in order to evaluate its performance. A prostate case which considers two organs at risk, namely the rectum and the bladder is considered in this paper. Results show that the ND finds solutions as good as the ones found by the SD algorithm. TS outperforms both the SD and the ND algorithms. Convergence curves for the all three algorithms are studied.
topic Beam angle optimisation
local search
tabu search
mathematical programming
intensity modulated radiation therapy
matheuristics
url https://ieeexplore.ieee.org/document/8349957/
work_keys_str_mv AT guillermocabreraguerrero comparinglocalsearchalgorithmsforthebeamanglesselectioninradiotherapy
AT carolinalagos comparinglocalsearchalgorithmsforthebeamanglesselectioninradiotherapy
AT enriquecabrera comparinglocalsearchalgorithmsforthebeamanglesselectioninradiotherapy
AT franklinjohnson comparinglocalsearchalgorithmsforthebeamanglesselectioninradiotherapy
AT josemrubio comparinglocalsearchalgorithmsforthebeamanglesselectioninradiotherapy
AT fernandoparedes comparinglocalsearchalgorithmsforthebeamanglesselectioninradiotherapy
_version_ 1724194259254378496