Multi-Way Number Partitioning

The number partitioning problem is to divide a given set of integers into a collection of subsets, so that the sum of the numbers in each subset are as nearly equal as possible. While a very efficient algorithm exists for optimal two-way partitioning, it is not nearly as effective for multi-way partitioning. We develop two new linear-space algorithms for multi-way partitioning, and demonstrate their performance on three, four, and five-way partitioning. In each case, our algorithms outperform the previous state of the art by orders of magnitude, in one case by over six orders of magnitude. Empirical analysis of the running times of our algorithms strongly suggest that their asymptotic growth is less than that of previous algorithms. The key insight behind both our new algorithms is that if an optimal k-way partition includes a particular subset, then optimally partitioning the numbers not in that set k-1 ways results in an optimal k-way partition.

[1]  K.A. De Jong,et al.  Analyzing cooperative coevolution with evolutionary game theory , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[2]  Richard M. Karp,et al.  The Differencing Method of Set Partitioning , 1983 .

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  M. Vose.  The Simple Genetic Algorithm , 1999 .

[5]  D. E. Matthews.  Evolution and the Theory of Games , 1977 .

[6]  Kenneth A. De Jong,et al.  Modeling Variation in Cooperative Coevolution Using Evolutionary Game Theory , 2002, FOGA.

[7]  Craig Boutilier,et al.  The Dynamics of Reinforcement Learning in Cooperative Multiagent Systems , 1998, AAAI/IAAI.

[8]  S. Mertens.  Phase Transition in the Number Partitioning Problem , 1998, cond-mat/9807077.

[9]  J M Smith,et al.  Evolution and the theory of games , 1976 .

[10]  Richard E. Korf,et al.  A Complete Anytime Algorithm for Number Partitioning , 1998, Artif. Intell..

[11]  Larry Bull,et al.  Evolutionary computing in multi-agent environments: Partners , 1997 .

[12]  R. Paul Wiegand,et al.  An empirical analysis of collaboration methods in cooperative coevolutionary algorithms , 2001 .

[13]  James A. Hendler,et al.  Co-evolving Soccer Softbot Team Coordination with Genetic Programming , 1997, RoboCup.

[14]  Hitoshi Iba.  Emergent Cooperation for Multiple Agents Using Genetic Programming , 1996, PPSN.

[15]  Mitchell A. Potter,et al.  The design and analysis of a computational model of cooperative coevolution , 1997 .

[16]  J. Davenport.  Editor , 1960 .

[17]  Kenneth A. De Jong,et al.  Evolving Behaviors for Cooperating Agents , 2000, ISMIS.

[18]  Larry Bull,et al.  Evolution in Multi-agent Systems: Evolving Communicating Classifier Systems for Gait in a Quadrupedal Robot , 1995, ICGA.

[19]  Richard E. Korf,et al.  From Approximate to Optimal Solutions: A Case Study of Number Partitioning , 1995, IJCAI.

[20]  Josef Hofbauer,et al.  Evolutionary Games and Population Dynamics , 1998 .

[21]  Richard K. Belew,et al.  New Methods for Competitive Coevolution , 1997, Evolutionary Computation.

[22]  Martin Lauer,et al.  An Algorithm for Distributed Reinforcement Learning in Cooperative Multi-Agent Systems , 2000, ICML.

[23]  Jordan B. Pollack,et al.  A Game-Theoretic Approach to the Simple Coevolutionary Algorithm , 2000, PPSN.

[24]  Annie S. Wu,et al.  Evolving control for distributed micro air vehicles , 1999, Proceedings 1999 IEEE International Symposium on Computational Intelligence in Robotics and Automation. CIRA'99 (Cat. No.99EX375).