[历年数学建模优秀论文]m03.pdfVIP

Such a Difficult “Sphere-Packing Problem”! ∼ Team # 171 page 1 of 15 Such a Difficult “Sphere-Packing Problem”! Advisor: Zhengmin Duan Abstract This paper is about how to make the best treatment planning of Gamma Knife with the methods of optimization. We consider this Problem B as a sphere-packing problem, which we try to put the different kinds of spheres (shots) into the target volumes (tumors) for that maximizing the sum of sphere volumes, and minimizing the number of spheres. First, we have developed a method to solve this problem by dealing with the target volume as a sphere, and then we generalize the method to various target volumes. To a global tumor we develop four models and give four algorithms. Then to ellipsoidal tumor we also develop a model and design an algorithm. In the first model we discuss the case that there is a small sphere at the center of target volume. We use Greedy Algorithm to get the solution of this problem. In the second model we design a modified version of algorithm to improve the initial algorithm, by moving those spheres which have been put into the target volume, so as to maximum the right space, then changing the small spheres at the right side into larger ones. In the third and fourth model we fill in the target with small spheres from the left to the right. We discuss the case that only use two small spheres on the X-axis in the third model, discuss the case that put three small spheres on the X-axis in the fourth model. In the fifth model we discuss the case that the target volume is ellipsoidal and other cases. Assumptions The 201 beams from the 201 cobalt-