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.
| Original language | English |
|---|---|
| Pages (from-to) | 69-72 |
| Number of pages | 4 |
| Journal | Electronic Notes in Discrete Mathematics |
| Volume | 55 |
| DOIs | |
| Publication status | Published - 1 Nov 2016 |
Keywords
- Heuristic algorithm
- Local search
- Mixed-integer non-linear programming
- Multiple non-linear knapsack problem
Fingerprint
Dive into the research topics of 'Heuristics for the General Multiple Non-linear Knapsack Problem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver