iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/978-3-642-44973-4_10
A Genetic Algorithm Approach for the Multidimensional Two-Way Number Partitioning Problem | SpringerLink
Skip to main content
Springer Nature Link
Log in

A Genetic Algorithm Approach for the Multidimensional Two-Way Number Partitioning Problem

  • Conference paper
  • First Online:
Learning and Intelligent Optimization (LION 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7997))

Included in the following conference series:

Abstract

This paper addresses the problem of partitioning a set of vectors into two subsets such that the sums per every coordinate should be exactly or approximately equal. This problem, introduced by Kojic [8], is called the multidimensional two-way number partitioning problem (MDTWNPP) and generalizes the classical two-way number partitioning problem. We propose an efficient genetic algorithm based heuristic for solving the multidimensional two-way number partitioning problem. The performances of our genetic algorithm have been compared with the existing numerical results obtained by CPLEX based on an integer linear programming formulation of the problem. The obtained preliminary results, in the case of medium and large instances, reveal that our proposed methodology performs very well in terms of both quality of the solutions and the computational times compared with the previous method of solving the MDTWNPP.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Arguello, M.F., Feo, T.A., Goldschmidt, O.: Randomized methods for the number partitioning problem. Comput. Oper. Res. 23(2), 103–111 (1996)

    Article  Google Scholar 

  2. Berretta, R.E., Moscato, P., Cotta, C.: Enhancing a memetic algorithms’ performance using a matching-based recombination algorithm: results on the number partitioning problem. In: Resende, M.G.C., Souza, J. (eds.) Metaheuristics: Computer Decision-Making, pp. 65–90. Kluwer, Boston (2004)

    Google Scholar 

  3. Coffman, E., Lueker, G.S.: Probabilistic Analysis of Packing and Partitioning Algorithms. Wiley, New York (1991)

    Google Scholar 

  4. Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1997)

    Google Scholar 

  5. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Norwell (1997)

    Book  MATH  Google Scholar 

  6. Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by simulated annealing: an experimental evaluation. Part II: Graph coloring and number partitioning. Oper. Res. 39(3), 378–406 (1991)

    Article  MATH  Google Scholar 

  7. Karmarkar, N., Karp, R.M.: The differencing method of set partitioning, Technical report UCB/CSD 82/113, University of California, Berkeley, Computer Science Division (1982)

    Google Scholar 

  8. Kojic, J.: Integer linear programming model for multidimensional two-way number partitioning problem. Comput. Math. Appl. 60, 2302–2308 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  9. Ruml, W., Ngo, J.T., Marks, J., Shieber, S.M.: Easily searched encodings for number partitioning. J. Optim. Theor. Appl. 89(2), 251–291 (1996)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This work was supported by a grant of the Romanian National Authority for Scientific Research, CNCS - UEFISCDI, project number PN-II-RU-TE-2011-3-0113.

Author information

Authors and Affiliations

  1. Department of Mathematics and Informatics, Technical University of Cluj-Napoca, Cluj-Napoca, Romania

    P. C. Pop

  2. Department of Electrical Engineering, Technical University of Cluj-Napoca, Cluj-Napoca, Romania

    O. Matei

Authors
  1. P. C. Pop
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. O. Matei
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to P. C. Pop .

Editor information

Editors and Affiliations

  1. Università Catania Dipto. Matematica e Informatica, Catania, Italy

    Giuseppe Nicosia

  2. Industrial & Systems Engineering, University of Florida, Gainesville, Florida, USA

    Panos Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pop, P.C., Matei, O. (2013). A Genetic Algorithm Approach for the Multidimensional Two-Way Number Partitioning Problem. In: Nicosia, G., Pardalos, P. (eds) Learning and Intelligent Optimization. LION 2013. Lecture Notes in Computer Science(), vol 7997. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-44973-4_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-44973-4_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-44972-7

  • Online ISBN: 978-3-642-44973-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation