Stochastic Heuristics for Knapsack Problems

  • Miloš ŠedaEmail author
  • Pavel Šeda
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 837)


In this paper, we introduce knapsack problem formulations, discuss their time complexity and propose their representation and solution based on the instance size. First, deterministic methods are briefly summarized. They can be applied to small-size tasks with a single constraint. However, because of NP-completeness of the problem, more complex problem instances must be solved by means of heuristic techniques to achieve an approximation of the exact solution in a reasonable amount of time. The problem representations and parameter settings for a genetic algorithm and simulated annealing frameworks are shown.


Knapsack problem Dynamic programming Branch and bound method Heuristic Genetic algorithm Simulated annealing 


  1. 1.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1979)zbMATHGoogle Scholar
  2. 2.
    Goldberg, D.E.: The Design of Innovation (Genetic Algorithms and Evolutionary Computation). Kluwer Academic Publishers, Dordrecht (2002)Google Scholar
  3. 3.
    Gulina, I., Matousek, R.: Efficient nearest neighbor searching in RRTs. In: Matousek, R. (ed.) Proceedings of 22nd International Conference on Soft Computing, MENDEL 2016 (2016)Google Scholar
  4. 4.
    Gutin, G., Punnen, A.P. (eds.): The Traveling Salesman Problem and Its Variations. Kluwer Academic Publishers, Dordrecht (2002)zbMATHGoogle Scholar
  5. 5.
    Klapka, J., Dvořák, P., Popela, P.: Optimisation Methods. VUTIUM, Brno (2001). (in Czech)Google Scholar
  6. 6.
    Matousek, R., Popela, P.: Stochastic quadratic assignment problem: EV and EO reformulations solved by HC12. In: Proceedings of 20th International Conference on Soft Computing, MENDEL 2014. Brno University of Technology, VUT Press, Brno (2014)Google Scholar
  7. 7.
    Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, Heidelberg (1996)zbMATHGoogle Scholar
  8. 8.
    Michalewicz, Z., Fogel, D.B.: How to Solve It: Modern Heuristics. Springer, Berlin (2002)zbMATHGoogle Scholar
  9. 9.
    Reeves, C.R.: Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publications, Oxford (1993)zbMATHGoogle Scholar
  10. 10.
    Šeda, M., Šeda, P.: A Minimisation of network covering services in a threshold distance. In: Matoušek, R. (ed.) Mendel 2015. Recent Advances in Soft Computing, vol. 378, pp. 159–169. Springer, Berlin (2015)CrossRefGoogle Scholar
  11. 11.
    Wolpert, D.H., McReady, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1, 67–82 (1997)CrossRefGoogle Scholar
  12. 12.
    Zelinka, I., Snášel, V., Abraham, A. (eds.): Handbook of Optimization. From Classical to Modern Approach. Springer, Berlin (2013)zbMATHGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Faculty of Mechanical EngineeringBrno University of TechnologyBrnoCzech Republic
  2. 2.IBM Global Services Delivery CenterBrnoCzech Republic

Personalised recommendations