美国数学建模竞赛特等奖论文——1997 B O An Assignment Model for Fruitful Discussions【数学建模】.pdfVIP

An Assignment Model 297 An Assignment Model for Fruitful Discussions Han Cao Hui Yang Zheng Shi East China University of Science and Technology Shanghai, China 200237 Advisor: Lu Xiwen Introduction We present a boolean programming model to solve a practical problem of giving assignments for a meeting. Because the objective function of the model is nonlinear and because there are too many variables in the model, the problem is quite difficult to solve by means of general methods from integer programming. We use a greedy algorithm to get an initial feasible solution, then we optimize locally and iterate to approach the optimal solution. We believe that our algorithm solves the given problem quite well. For the possibility that some board members will cancel at the last minute or that some not scheduled will show up, we give an adjustment method that makes the fewest necessary changes in assignments. Our ideas admit of generalization. The parameters, such as the number of members, the number of types of attendees, and the number of different levels of participation can be varied, and the model and the algorithm always give a good solution. The model has the following advantages: It solves the given problem successfully, and it can generate a group of quite optimized solutions quickly. The model is general; it can give quite good solutions for different parameter values. It has lots of applications. c The UMAP Journal 18 (3) (1997) 297–306. Copyright 1997 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 without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice. Abstracting with credit is permitted, but