TY - JOUR
T1 - Pareto local search algorithms for the multi-objective beam angle optimisation problem
AU - Cabrera-Guerrero, Guillermo
AU - Mason, Andrew J.
AU - Raith, Andrea
AU - Ehrgott, Matthias
N1 - Funding Information:
Acknowledgements The authors wish to acknowledge the contribution of NeSI high-performance computing facilities to the results of this research. NZ’s national facilities are provided by the NZ eScience Infrastructure and funded jointly by NeSI’s collaborator institutions and through the Ministry of Business, Innovation and Employment’s Research Infrastructure programme. URL https://www. nesi.org.nz. G. Cabrera-Guerrero wishes to thank both FONDECYT/INICIACION/11170456 and CONI-CYT/REDI170036 projects for partially support this research.
Publisher Copyright:
© 2018, Springer Science+Business Media, LLC, part of Springer Nature.
PY - 2018/4/1
Y1 - 2018/4/1
N2 - 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.
AB - 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.
KW - Beam angle configuration
KW - Intensity modulated radiation therapy
KW - Multi-objective beam angle optimisation
KW - Pareto local search
UR - http://www.scopus.com/inward/record.url?scp=85041517528&partnerID=8YFLogxK
U2 - 10.1007/s10732-018-9365-1
DO - 10.1007/s10732-018-9365-1
M3 - Article
AN - SCOPUS:85041517528
VL - 24
SP - 205
EP - 238
JO - Journal of Heuristics
JF - Journal of Heuristics
SN - 1381-1231
IS - 2
ER -