Stochastic Heuristics for Knapsack Problems
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.
KeywordsKnapsack problem Dynamic programming Branch and bound method Heuristic Genetic algorithm Simulated annealing
- 2.Goldberg, D.E.: The Design of Innovation (Genetic Algorithms and Evolutionary Computation). Kluwer Academic Publishers, Dordrecht (2002)Google Scholar
- 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
- 5.Klapka, J., Dvořák, P., Popela, P.: Optimisation Methods. VUTIUM, Brno (2001). (in Czech)Google Scholar
- 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