A new modeling and solution approach for the number partitioning problem.pdfVIP

下载本文档

4
0
约3.66万字
约 10页
2016-02-06 发布于湖北
举报
版权申诉

A new modeling and solution approach for the number partitioning problem.pdf

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

A new modeling and solution approach for the number partitioning problem.pdf

A NEW MODELING AND SOLUTION APPROACH FOR THE NUMBER PARTITIONING PROBLEM BAHRAM ALIDAEE, FRED GLOVER, GARY A. KOCHENBERGER, AND CESAR REGO Received 24 November 2003 and in revised form 9 May 2004 The number partitioning problem has proven to be a challenging problem for both exact and heuristic solution methods. We present a new modeling and solution approach that consists of recasting the problem as an unconstrained quadratic binary program that can be solved by eﬃcient metaheuristic methods. Our approach readily accommodates both the common two-subset partition case as well as the more general case of multiple subsets. Preliminary computational experience is presented illustrating the attractiveness of the method. 1. Introduction The number partitioning problem (NPP), being one of Garey and Johnson’s [3] six basic NP complete problems, has been the subject of considerable research in recent years. In the simplest case, the problem consists of partitioning a set of numbers into two subsets such that the sums of the numbers in each subset are as close as possible. The more general case of NPP seeks to partition the original set into n subsets (n 2) such that the sums for each set are as close to each other as possible. Most of the work reported in the literature has been directed to the two-subset case. This problem is known to be computationally challenging and, except for small instances, is most productively approached by heuristic means. The literature contains several papers describing methods for solving NPP. One of the most widely referenced methods is the diﬀ erencing method (DM) of Karmarkar and Karp [11] which is O(nlog n) for the two-subset case. Several computational studies, including those of Johnson et al. [ 10] and Arguello et al. [1], report that DM outperforms, in terms of both solution quality and computation time, alternative methods such as simulated annealing and GRASP. Due to it’s eﬀectiveness, Korf [13] employs