본문으로 건너뛰기
← 뒤로

Comparing variable neighbourhood search algorithms for the direct aperture optimisation in radiotherapy.

1/5 보강
PeerJ. Computer science 2025 Vol.11() p. e3094
Retraction 확인
출처

Moyano M, Meza-Vasquez K, Tello-Valenzuela G, Ojeda-Ortega N, Lagos C, Cabrera-Guerrero G

📝 환자 설명용 한 줄

Intensity modulated radiation therapy (IMRT) is a prevalent approach for administering radiation therapy in cancer treatment.

이 논문을 인용하기

↓ .bib ↓ .ris
APA Moyano M, Meza-Vasquez K, et al. (2025). Comparing variable neighbourhood search algorithms for the direct aperture optimisation in radiotherapy.. PeerJ. Computer science, 11, e3094. https://doi.org/10.7717/peerj-cs.3094
MLA Moyano M, et al.. "Comparing variable neighbourhood search algorithms for the direct aperture optimisation in radiotherapy.." PeerJ. Computer science, vol. 11, 2025, pp. e3094.
PMID 40989379 ↗

Abstract

Intensity modulated radiation therapy (IMRT) is a prevalent approach for administering radiation therapy in cancer treatment. The primary objective of IMRT is to devise a treatment strategy that eradicates cancer cells from the tumour while minimising damage to the surrounding organs at risk. Conventional IMRT planning entails a sequential procedure: optimising beam intensity for a certain set of angles, followed by sequencing. Unfortunately, treatment plans obtained in the optimisation stage are severely impaired after the sequencing stage due to physical and delivery constraints that are not considered during the optimisation stage. One method that tackles the issues above is the direct aperture optimisation (DAO) technique. The DAO problem seeks to generate a set of deliverable aperture configurations and a corresponding set of radiation intensities. This method accounts for physical and delivery time limitations, facilitating the creation of clinically appropriate treatment programs. In this article, we propose and compare two variable neighbourhood search (VNS) based algorithms, called variable neighbourhood descent (VND) and reduced variable neighbourhood search (rVNS). The VND algorithm is a deterministic variant of VNS that systematically explores different neighbourhood structures. This approach allows for a more thorough solution for space exploration while maintaining computational efficiency. The rVNS, unlike traditional VNS algorithms, does not require any transition rule, as it integrates a set of predefined neighbourhood moves at each iteration. We apply our proposed algorithms to prostate cancer cases, achieving highly competitive results for both algorithms. In particular, the proposed rVNS requires 62.75% fewer apertures and achieved a 63.93% reduction in beam-on time compared to the sequential approach's best case, which means treatment plans that can be delivered in less time. Additionally, we evaluate the clinical quality of the treatment plans using established dosimetric indicators, comparing our results against those produced by matRad's tool for DAO to assess target coverage and organ-at-risk sparing.

🏷️ 키워드 / MeSH 📖 같은 키워드 OA만

🏷️ 같은 키워드 · 무료전문 — 이 논문 MeSH/keyword 기반

🟢 PMC 전문 열기