A Quartile-Based Hyper-Heuristic for Solving the 0/1 Knapsack Problem

Research paper presented at the 16^th Mexican International Conference on Artificial Intelligence

Co-authors: Rodolfo A. Ramírez-Valenzuela, José Carlos Ortiz-Bayliss, Ivan Amaya, and Hugo Terashima-Marín.

The article proposes a novel approach for solving the Knapsack 0-1 problem; a Hyper Heuristic that uses information of the items profit and weight distributions and choses the best item so at the end you would be able to get the optimal maximum profit achievable.