Pareto local search algorithms for the multi-objective beam angle optimisation problem

Guillermo Cabrera-Guerrero, Andrew J. Mason, Andrea Raith, Matthias Ehrgott

Producción científica: Contribución a una revistaArtículorevisión exhaustiva

20 Citas (Scopus)


Due to inherent trade-offs between tumour control and sparing of organs at risk, optimisation problems arising in intensity modulated radiation therapy planning are naturally modelled as multi-objective optimisation problems. Nevertheless, the vast majority of studies in the literature consider single objective approaches to these problems. The beam angle optimisation problem, that we address ion this paper, is one of these problems. It attempts to identify “good” beam angle configurations that allow the delivery of efficient treatment plans. In this paper two bi-objective local search algorithms are developed for the bi-objective beam angle optimisation problem, namely Pareto local search (PLS) and a variation of PLS we call adaptive PLS (aPLS). Both algorithms are able to find a set of (approximately) efficient beam angle configurations. While the PLS algorithm aims to find a set of efficient BACs by performing a very focused search over a specific region of the objective space, the aPLS algorithm aims to produce a set of efficient BACs that are well-distributed over the objective space. We test both algorithms on two prostate cancer cases and compare them to our previously proposed single objective local search algorithm.

Idioma originalInglés
Páginas (desde-hasta)205-238
Número de páginas34
PublicaciónJournal of Heuristics
EstadoPublicada - 1 abr. 2018


Profundice en los temas de investigación de 'Pareto local search algorithms for the multi-objective beam angle optimisation problem'. En conjunto forman una huella única.

Citar esto