- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Using Simulated Annealing 307
Using Simulated Annealing to Solve
the Discussion Groups Problem
David Castro
John Renze
Nicholas Weininger
Macalester College
St. Paul, MN 55105
Advisor: Karla V. Ballman
Introduction
Our task is to assign 29 corporate board members to a sequence of discussion
groups organized into seven sessions, of which three are morning sessions led
by senior officers and four are afternoon sessions not led by senior officers.
We wish to find a combination of group assignments that best satisfies the
following objectives:
In the morning sessions, no board member should be in the same senior
officer’s discussion group twice.
No group should have too many in-house members (there are nine in-house
corporate employees among the 29 members).
The number of times any two board members are in the same group should
vary as little as possible.
No two groups should have a large number of common members.
The specific case given assumes that all members will participate in all ses-
sions and that there will be six discussion groups for each morning session and
four for each afternoon session. Our model ought to be capable of produc-
ing good answers quickly under these assumptions and of adjusting to more
general configurations of board members. In particular, it should be able to
adjust to small changes, such as individual additions or subtractions of board
members, without recalculating all assignments from scratch.
c
The UMAP Journal 18 (3) (1997) 307–320. 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 p
您可能关注的文档
- 千年藏帖——颜柳欧赵书法合集·欧阳询卷.pdf
- 千年藏帖——颜柳欧赵书法合集·柳公权卷.pdf
- Dijkstra算法在企业物流运输网络中的应用【数学建模】.pdf
- Floyd最短路径算法在配送中心选址中的应用【数学建模】.pdf
- GATBXA1【数学建模】.PDF
- GA算法(中文)【数学建模】.PPT
- guohe问题【数学建模】.ppt
- Hill密码【数学建模】.ppt
- kc1【数学建模】.ppt
- SAS基本教程【数学建模】.pdf
- 美国数学建模竞赛特等奖论文——1997 B P The Outstanding Discussion Groups Papers【数学建模】.pdf
- 美国数学建模竞赛特等奖论文——1998 A M A Quick Algorithm for MRI Problem【数学建模】.pdf
- 美国数学建模竞赛特等奖论文——1998 A M Image Reconstruction in MRI【数学建模】.pdf
- 美国数学建模竞赛特等奖论文——1998 A O A Method for Taking Cross Sections of Three-Dimensional Gridded Data【数学建模】.pdf
- 美国数学建模竞赛特等奖论文——2002 A O Simulating a Fountain【数学建模】.pdf
- 美国数学建模竞赛特等奖论文——1998 A O A Tricubic Interpolation Algorithm for MRI Image Cross Sections【数学建模】.pdf
- 美国数学建模竞赛特等奖论文——2002 A O The Fountain That Math Built【数学建模】.pdf
- 美国数学建模竞赛特等奖论文——2002 A O Wind and Waterspray【数学建模】.pdf
- 美国数学建模竞赛特等奖论文——1998 A O MRI Slice Picturing【数学建模】.pdf
- 美国数学建模竞赛特等奖论文——2002 B O ACE is High【数学建模】.pdf
文档评论(0)