Intensity modulated beam radiation therapy dose optimization with multiobjective evolutionary algorithms

Lahanas, M; Schreibmann, E; Milickovic, N; Baltas, D

dc.contributor.author	Lahanas, M	en
dc.contributor.author	Schreibmann, E	en
dc.contributor.author	Milickovic, N	en
dc.contributor.author	Baltas, D	en
dc.date.accessioned	2014-03-01T01:19:04Z
dc.date.available	2014-03-01T01:19:04Z
dc.date.issued	2003	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/15355
dc.subject	Global Optimization	en
dc.subject	Intensity Modulation	en
dc.subject	multiobjective evolutionary algorithm	en
dc.subject	Optimal Method	en
dc.subject	Optimization Problem	en
dc.subject	Radiation Therapy	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	GENETIC ALGORITHMS	en
dc.subject.other	RADIOTHERAPY	en
dc.title	Intensity modulated beam radiation therapy dose optimization with multiobjective evolutionary algorithms	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/3-540-36970-8_46	en
heal.identifier.secondary	http://dx.doi.org/10.1007/3-540-36970-8_46	en
heal.language	English	en
heal.publicationDate	2003	en
heal.abstract	We apply the NSGA-II algorithm and its controlled elitist version NSGA-IIc for the intensity modulated beam radiotherapy dose optimization problem. We compare the performance of the algorithms with objectives for which deterministic optimization methods provide global optimal solutions. The number of parameters to be optimized can be up to a few thousands and the number of objectives varies from 3 to 6. We compare the results with and without supporting solutions. Optimization with constraints for the target dose variance value provides clinical acceptable solutions. © Springer-Verlag Berlin Heidelberg 2003.	en
heal.publisher	SPRINGER-VERLAG BERLIN	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
heal.bookName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.doi	10.1007/3-540-36970-8_46	en
dc.identifier.isi	ISI:000184815500046	en
dc.identifier.volume	2632	en
dc.identifier.spage	648	en
dc.identifier.epage	661	en