美国数学建模竞赛特等奖论文——2003 B O A Sphere-Packing Model for the Optimal Treatment Plan【数学建模】.pdfVIP

A Sphere-Packing Model 339 A Sphere-Packing Model for the Optimal Treatment Plan Long Yun Ye Yungqing Wei Zhen Peking University Beijing, China Advisor: Liu Xufeng Abstract We develop a sphere-packing model for gamma knife treatment planning to determine the number of shots of each diameter and their positions in an optimal plan. We use a heuristic approach to solve the packing problem, which is refined by simulated annealing. The criteria for an optimal plan are efficiency, conformity, fitness, and avoidance. We construct a penalty function to judge whether one packing strategy is better than the other. The number of spheres of each size is fixed, the total number of spheres has an upper bound, and critical tissue near the target is avoided. Computer simulation shows that our algorithm fits the four requirements well and runs faster than the traditional nonlinear approach. After detailed evaluation, we not only demonstrate the flexibility and robustness of our algorithm but also show its wide applicability. Introduction We develop an effective sphere-packing algorithm for gamma-knife treat- ment planning using a heuristic approach, optimized by simulated annealing. In our model, we take into consideration the following basic requirements: 1. At least 90% shot coverage of the target volume is guaranteed. This re- quirement is the main standard for evaluating our algorithm, or an efficiency requirement. 2. Minimize the non-target volume that is covered by a shot or by a series of delivered shots. This requirement is a conformity requirement. c The UMAP Journal 24 (3) (2003) 339–350. Copyright 2003 by COMAP, Inc. All rights reserved. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted withou