A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem

Abstract In this paper, we describe a generalization of the multidimensional two-way number partitioning problem (MDTWNPP) where a set of vectors has to be partitioned into p sets (parts) such that the sums per every coordinate should be exactly or approximately equal. We will call this generalization the multidimensional multi-way number partitioning problem (MDMWNPP). Also, an efficient memetic algorithm (MA) heuristic is developed to solve the multidimensional multi-way number partitioning problem obtained by combining a genetic algorithm (GA) with a powerful local search (LS) procedure. The performances of our memetic algorithm have been compared with the existing numerical results obtained by CPLEX based on an integer linear programming formulation of the problem. The solution reveals that our proposed methodology performs very well in terms of both quality of the solutions obtained and the computational time compared with the previous method of solving the multidimensional two-way number partitioning problem.

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

[2]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[3]  Edward G. Coffman,et al.  Probabilistic analysis of packing and partitioning algorithms , 1991, Wiley-Interscience series in discrete mathematics and optimization.

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

[5]  Mark W. Lewis,et al.  A new modeling and solution approach for the set-partitioning problem , 2008, Comput. Oper. Res..

[6]  Fred W. Glover,et al.  A new modeling and solution approach for the number partitioning problem , 2005, Adv. Decis. Sci..

[7]  Jelena Kojic.  Integer linear programming model for multidimensional two-way number partitioning problem , 2010, Comput. Math. Appl..

[8]  Richard E. Korf,et al.  A Hybrid Recursive Multi-Way Number Partitioning Algorithm , 2011, IJCAI.

[9]  J. Marks,et al.  Easily searched encodings for number partitioning , 1996 .

[10]  Nubia Velasco,et al.  A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands , 2008, Comput. Oper. Res..

[11]  Brian Hayes,et al.  The Easiest Hard Problem , 2002, American Scientist.

[12]  Ellis Horowitz,et al.  Computing Partitions with Applications to the Knapsack Problem , 1974, JACM.

[13]  Christian Prins,et al.  An effective memetic algorithm for the cumulative capacitated vehicle routing problem , 2010, Comput. Oper. Res..

[14]  Christian Prins,et al.  A Memetic Algorithm Solving the VRP, the CARP and General Routing Problems with Nodes, Edges and Arcs , 2005 .

[15]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

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

[17]  Christian Artigues,et al.  A Memetic Algorithm with a large neighborhood crossover operator for the Generalized Traveling Salesman Problem , 2008, Comput. Oper. Res..

[18]  Thomas A. Feo,et al.  Randomized methods for the number partitioning problem , 1996, Comput. Oper. Res..