{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T00:09:09Z","timestamp":1758672549956,"version":"3.44.0"},"reference-count":0,"publisher":"Advances in Artificial Intelligence and Machine Learning","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAIML"],"published-print":{"date-parts":[[2025]]},"abstract":"<jats:p>Radiation Therapy (RT) plays a pivotal role in the treatment of cancer, offering the potential to effectively target and eliminate tumor cells while minimizing harm to surrounding healthy tissues. However, the success of RT heavily depends on meticulous treatment planning that ensures the optimal balance between delivering a sufficiently high dose to the tumor and sparing nearby critical organs. This critical process demands a multidisciplinary approach that combines medical expertise, advanced imaging techniques, and computational tools. Optimization techniques have emerged as indispensable tools in refining RT planning, enabling the precise adjustment of radiation beam arrangements and intensities to achieve treatment objectives while adhering to strict dose constraints. This study focuses on constrained optimization within RT Treatment Planning, utilizing metaheuristic algorithms to improve this process. The research compares three widely-used optimization techniques: Bat Search Optimization (BSO), Bacterial Foraging Algorithm (BFA), and Artificial Bee Colony (ABC). These metaheuristic approaches are evaluated against traditional methods, with evaluation metrics including execution time, convergence, and Dose-Volume Histogram (DVH) outcomes. The experimental results demonstrate that the metaheuristic techniques significantly outperform traditional methods. Among them, BFA delivers the most favorable results, offering minimal convergence time and superior DVH performance. For the unconstrained case (\ud835\udc64\ud835\udc45 = 0, \ud835\udc64\ud835\udc35 = 0), BFA achieved superior tumor coverage with \ud835\udc37 \ud835\udc43\ud835\udc47\ud835\udc49 95 = 65.7Gy, while maintaining rectum and bladder doses at 72.8Gy and 71.6Gy, respectively. Under constrained conditions (\ud835\udc64\ud835\udc45 = 10, \ud835\udc64\ud835\udc35 = 10), BFA effectively reduced rectum and bladder doses to 67.2Gy and 60.7Gy, with an acceptable \ud835\udc37 \ud835\udc43\ud835\udc47\ud835\udc49 95 = 59.5Gy \u2014outperforming traditional IMRT, ABC, and BSO in both dose sparing and target coverage. Moreover<\/jats:p>","DOI":"10.54364\/aaiml.2025.53227","type":"journal-article","created":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T07:13:27Z","timestamp":1758611607000},"page":"4034-4052","source":"Crossref","is-referenced-by-count":0,"title":["Metaheuristic Algorithm for Constrained Optimization in Radiation Therapy Treatment Planning: Design and Performance Comparison"],"prefix":"10.54364","volume":"05","author":[{"given":"Keshav","family":"Kumar K.","sequence":"first","affiliation":[]},{"given":"Dr. NVSL","family":"Narasimham","sequence":"additional","affiliation":[]},{"given":"Dr. A Ramakrishna","family":"Prasad","sequence":"additional","affiliation":[]}],"member":"32807","published-online":{"date-parts":[[2025]]},"container-title":["Advances in Artificial Intelligence and Machine Learning"],"original-title":[],"link":[{"URL":"https:\/\/www.oajaiml.com\/uploads\/archivepdf\/375053227.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T07:13:29Z","timestamp":1758611609000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.oajaiml.com\/uploads\/archivepdf\/375053227.pdf"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":0,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2025]]},"published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.54364\/aaiml.2025.53227","relation":{},"ISSN":["2582-9793"],"issn-type":[{"value":"2582-9793","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}