A Quartile-Based Hyper-heuristic for Solving the 0/1 Knapsack Problem
This research describes three novel heuristic-based approaches for solving the 0/1 knapsack problem. The knapsack problem, in its many variants, arises in many practical scenarios such as the selection of investment projects and budget control. As an NP-hard problem, it is not always possible to compute the optimal solution by using exact methods and, for this reason, the problem is usually solved by using heuristic-based strategies. In this document, we use information of the distributions of weight and profit of the items in the knapsack instances to design and implement new heuristic-based methods that solve those instances. The solution model proposed in this work is two-fold: the first part focuses on the generation of two new heuristics, while the second explores the combination of solving methods through a hyper-heuristic approach. The heuristics proposed, as well as the hyper-heuristic model, were tested on a heterogeneous set of knapsack problem instances and compared against four heuristics taken from the literature. One of the proposed heuristics proved to be highly competent with respect to heuristics available in the literature. By using the hyper-heuristic, a solver that dynamically selects heuristics based on the problem features, we improved the results obtained by the new heuristics proposed and, achieved the best results among all the methods tested in this investigation.
KeywordsHeuristics Hyper-heuristics Knapsack problem Quartile
This research was supported in part by CONACyT Basic Science Projects under grant 241461 and ITESM Research Group with Strategic Focus in intelligent Systems.
- 1.Amuthan, A., Thilak, K.D.: Survey on Tabu search meta-heuristic optimization. In: 2016 International Conference on Signal Processing, Communication, Power and Embedded System (SCOPES), pp. 1539–1543, October 2016Google Scholar
- 2.Banda, J., Velasco, J., Berrones, A.: A hybrid heuristic algorithm based on mean-field theory with a simple local search for the quadratic knapsack problem. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 2559–2565, June 2017Google Scholar
- 6.Chou, Y.H., Yang, Y.J., Chiu, C.H.: Classical and quantum-inspired Tabu search for solving 0/1 knapsack problem. In: 2011 IEEE International Conference on Systems, Man, and Cybernetics, pp. 1364–1369, October 2011Google Scholar
- 7.Cui, X., Wang, D., Yan, Y.: AES algorithm for dynamic knapsack problems in capital budgeting. In: 2010 Chinese Control and Decision Conference, pp. 481–485, May 2010Google Scholar
- 9.Gagliardi, E.O., Dorzán, M.G., Leguizamón, M.G., Peñalver, G.H.: Approximations on minimum weight pseudo-triangulation problem using ant colony optimization metaheuristic. In: 2011 30th International Conference of the Chilean Computer Science Society, pp. 238–246, November 2011Google Scholar
- 11.Hifi, M., Otmani, N.: A first level scatter search for disjunctively constrained knapsack problems. In: 2011 International Conference on Communications, Computing and Control Applications (CCCA), pp. 1–6, March 2011Google Scholar
- 13.Kiss, Z.I., Hosu, A.C., Varga, M., Polgar, Z.A.: Load balancing solution for heterogeneous wireless networks based on the knapsack problem. In: 2015 38th International Conference on Telecommunications and Signal Processing (TSP), pp. 1–6, July 2015Google Scholar
- 17.Naldi, M., Nicosia, G., Pacifici, A., Pferschy, U., Leder, B.: A simulation study of fairness-profit trade-off in project selection based on HHI and knapsack models. In: 2016 European Modelling Symposium (EMS), pp. 85–90, November 2016Google Scholar
- 18.Niar, S., Freville, A.: A parallel Tabu search algorithm for the 0–1 multidimensional knapsack problem. In: Proceedings 11th International Parallel Processing Symposium, pp. 512–516, April 1997Google Scholar
- 22.Sapra, D., Sharma, R., Agarwal, A.P.: Comparative study of metaheuristic algorithms using knapsack problem. In: 2017 7th International Conference on Cloud Computing, Data Science Engineering - Confluence, pp. 134–137, January 2017Google Scholar
- 23.Terashima-Marín, H., Flores-Alvarez, E.J., Ross, P.: Hyper-heuristics and classifier systems for solving 2D-regular cutting stock problems. In: Proceedings of the 7th annual conference on Genetic and evolutionary computation, pp. 637–643. ACM (2005)Google Scholar