Vol. 4,No. 7, July 2014
Author(s): Saeed Karimi, Farshad Kiyoumarsi
Abstract: In this paper, we address an metaheuristic approaches, a Variable Neighborhood Search (VNS), 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. VNS use the 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 this method to MDTWNPP.
International Association for Academians is an International institute with regional headquarters in Canada.