Two metaheuristic approaches for solving multidimensional two-way number partitioning problem

In this paper, we address two metaheuristic approaches, a Variable Neighborhood Search (VNS) and an Electromagnetism-like metaheuristic (EM), on an NP-hard optimization problem: Multi-dimensional Two-way Number Partitioning Problem (MDTWNPP). MDTWNPP is a generalization of a Two-way Number Partitioning Problem (TWNPP), where a set of vectors is partitioned rather than a set of numbers. The simple k-swap neighborhoods allow an effective shaking procedure in the VNS search. The attraction-repulsion mechanism of EM is extended with a scaling procedure, which additionally moves EM points closer to local optima. Both VNS and EM use the same local search procedure based on 1-swap improvements. Computational results were obtained on 210 standard instances. Direct comparison with results from the literature confirm the significance of applying these methods to MDTWNPP.

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

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

[3]  Shu-Cherng Fang,et al.  An Electromagnetism-like Mechanism for Global Optimization , 2003, J. Glob. Optim..

[4]  Nenad Mladenovic,et al.  Variable neighborhood search for the Vertex Separation Problem , 2012, Comput. Oper. Res..

[5]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[6]  P. Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

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

[8]  V. Filipović,et al.  An Electromagnetism Metaheuristic for the Uncapacitated Multiple Allocation Hub Location Problem , 2011, Serdica Journal of Computing.

[9]  Reza Tavakkoli-Moghaddam,et al.  A hybridization of simulated annealing and electromagnetism-like mechanism for a periodic job shop scheduling problem , 2011, Expert Syst. Appl..

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

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

[12]  Pierre Hansen,et al.  Variable Neighbourhood Search , 2003 .

[13]  Stephan Mertens.  The Easiest Hard Problem: Number Partitioning , 2006, Computational Complexity and Statistical Physics.

[14]  Chao-Ton Su,et al.  Applying electromagnetism-like mechanism for feature selection , 2011, Inf. Sci..

[15]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[16]  J. Fontanari,et al.  PROBABILISTIC ANALYSIS OF THE NUMBER PARTITIONING PROBLEM , 1998, adap-org/9801002.

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

[18]  Alexandre Xavier Martins,et al.  Variable neighborhood descent with iterated local search for routing and wavelength assignment , 2012, Comput. Oper. Res..

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

[20]  Jozef Kratica.  AN ELECTROMAGNETISM-LIKE METHOD FOR THE MAXIMUM SET SPLITTING PROBLEM , 2013 .

[21]  Nenad Mladenovic,et al.  Gaussian variable neighborhood search for continuous optimization , 2011, Comput. Oper. Res..

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

[23]  Ceyda Oguz,et al.  A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine , 2012, Comput. Oper. Res..

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

[25]  Oliviu Matei,et al.  A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem , 2013 .