Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777211 | Electronic Notes in Discrete Mathematics | 2016 | 4 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Luca Mencarelli, Claudia D'Ambrosio, Angelo Di Zio, Silvano Martello,