Skip to main content
SpringerLink
Log in

A Hybrid Genetic Algorithm with Variable Neighborhood Search Approach to the Number Partitioning Problem

  • Conference paper
Hybrid Artificial Intelligent Systems (HAIS 2013)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8073))

Included in the following conference series:

Abstract

The article presents a novel approach for solving the number partitioning problem. Our approach combines the use of genetic algorithms (GA) and Variable Neighborhood Search (VNS) resulting a new highly scalable hybrid GA-VNS (Genetic Algorithm with Variable Neighborhood Search), which runs the GA as the main algorithm and the VNS procedure for improving individuals within the population. The preliminary experimental results indicate that the GA-VNS hybrid algorithm performs significantly better, in terms of the solution quality, in comparison to the existing heuristic algorithms and to the pure GA for solving the number partitioning problem.

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

Access this chapter

Log in via an institution
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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arguello, M.F., Feo, T.A., Goldschmidt, O.: Randomized methods for the number partitioning problem. Computers & Operations Research 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. Kluwer (2004)

    Google Scholar 

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

    Google Scholar 

  4. Corne, D., Ross, P.: Peckish Initialization Strategies for Evolutionary Timetabling. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 227–241. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  5. 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 

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

    Book  MATH  Google Scholar 

  7. Hansen, P., Mladenovic, N.: Variable neighborhood search: Principles and applications. European Journal of Operational Research 130(3), 449–467 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  8. Hayes, B.: The easiest hard problem. American Scientist 90, 113–117 (2002)

    Article  Google Scholar 

  9. Horowitz, E., Sahni, S.: Computing partitions with applications to the Knapsack problem. Journal of ACM 21(2), 277–292 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  10. 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. Operations Research 39(3), 378–406 (1991)

    Article  MATH  Google Scholar 

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

    Google Scholar 

  12. Korf, R.E.: A complete anytime algorithm for number partitioning. Artificial Intelligence 106(2), 181–203 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  13. Korf, R.E.: A Hybrid Recursive Multi-Way Number Partitioning Algorithm. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, pp. 591–596 (2011)

    Google Scholar 

  14. Michiels, W., Aarts, E., Korst, J., van Leeuwen, J., Spieksma, F.C.R.: Computer-assisted proof of performance ratios for the Differencing Method. Discrete Optimization 9, 1–16 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  15. Mladenovic, N., Hansen, P.: Variable neighborhood search. Computers and Operations Research 24(11), 1097–1100 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  16. Ruml, W., Ngo, J.T., Marks, J., Shieber, S.M.: Easily searched encodings for number partitioning. Journal of Optimization Theory and Applications 89(2), 251–291 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  17. Tasi, L.-H.: The modified differencing method for the set partitioning problem with cardinality constraints. Discrete Applied Mathematics 63, 175–180 (1995)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Indeco Soft, Baia Mare, Romania

    Levente Fuksz

  2. Dept. of Mathematics and Computer Science, North Univ. Center of Baia Mare, Technical University of Cluj-Napoca, Str. Victoriei, 430122, Baia Mare, Romania

    Petrica C. Pop

Authors
  1. Levente Fuksz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Petrica C. Pop
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electronic Engineering, National Kaohsiung University of Applied Sciences, No. 415, Chien Kung Road, 80778, Kaohsiung, Taiwan

    Jeng-Shyang Pan

  2. Department of Electrical and Computer Engineering, University of Cyprus, 75 Kallipoleos Avenue, 1678, Nicosia, Cyprus

    Marios M. Polycarpou

  3. Department of Systems and Computer Networks, Wroclaw University of Technology, Wybrzeze Wyspianskiego 27, 50-370, Wroclaw, Poland

    Michał Woźniak

  4. Department of Computer Science, University of Sao Paulo at Sao Carlos, Sao Carlos, SP, Brazil

    André C. P. L. F. de Carvalho

  5. University of Salamanca, Plaza de la Merced S/N, 37008, Salamanca, Spain

    Héctor Quintián  & Emilio Corchado  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fuksz, L., Pop, P.C. (2013). A Hybrid Genetic Algorithm with Variable Neighborhood Search Approach to the Number Partitioning Problem. In: Pan, JS., Polycarpou, M.M., Woźniak, M., de Carvalho, A.C.P.L.F., Quintián, H., Corchado, E. (eds) Hybrid Artificial Intelligent Systems. HAIS 2013. Lecture Notes in Computer Science(), vol 8073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40846-5_65

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40846-5_65

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40845-8

  • Online ISBN: 978-3-642-40846-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation