We propose heuristic algorithms for the multiple non-linear knapsack problem with separable non-convex profit and weight functions. First, we design a fast constructive algorithm that provides good initial solutions. Secondly, we improve the quality of these solutions through local search procedures. We compare the proposed methods with exact and heuristic algorithms for mixed integer non-linear programming problems, proving that our approach provides good-quality solutions in smaller CPU time.
Mencarelli, L., D'Ambrosio, C., Di Zio, A., Martello, S. (2016). Heuristics for the General Multiple Non-linear Knapsack Problem. ELECTRONIC NOTES IN DISCRETE MATHEMATICS, 55, 69-72 [10.1016/j.endm.2016.10.018].
Heuristics for the General Multiple Non-linear Knapsack Problem
MARTELLO, SILVANO
2016
Abstract
We propose heuristic algorithms for the multiple non-linear knapsack problem with separable non-convex profit and weight functions. First, we design a fast constructive algorithm that provides good initial solutions. Secondly, we improve the quality of these solutions through local search procedures. We compare the proposed methods with exact and heuristic algorithms for mixed integer non-linear programming problems, proving that our approach provides good-quality solutions in smaller CPU time.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
