title: Distributed approximation of Pareto surfaces in multicriteria radiation therapy treatment planning.
abstract: We consider multicriteria radiation therapy treatment planning by navigation over the Pareto surface, implemented by interpolation between discrete treatment plans. Current state of the art for calculation of a discrete representation of the Pareto surface is to sandwich this set between inner and outer approximations that are updated one point at a time. In this paper, we generalize this sequential method to an algorithm that permits parallelization. The principle of the generalization is to apply the sequential method to an approximation of an inexpensive model of the Pareto surface. The information gathered from the model is sub-sequently used for the calculation of points from the exact Pareto surface, which are processed in parallel. The model is constructed according to the current inner and outer approximations, and given a shape that is difficult to approximate, in order to avoid that parts of the Pareto surface are incorrectly disregarded. Approximations of comparable quality to those generated by the sequential method are demonstrated when the degree of parallelization is up to twice the number of dimensions of the objective space. For practical applications, the number of dimensions is typically at least five, so that a speed-up of one order of magnitude is obtained.
authors: Optimization and Systems Theory, Department of Mathematics, KTH Royal Institute of Technology, SE-100 44, Stockholm, Sweden. rasmus.bokrantz@raysearchlabs.com
authors: Rasmus
authors: R
authors: Bokrantz
mesh_terms: D000465:Algorithms; D006801:Humans; D008297:Male; D009369:Neoplasms / Q000532:radiotherapy; D011880:Radiotherapy Planning, Computer-Assisted / Q000379:methods*; D012984:Software