THE MULTIDIMENSIONAL 0-1 KNAPSACK PROBLEM - A New Heuristic Algorithm Combined with 0-1 Linear Programming

Anikó Csébfalvi, György Csébfalvi

Abstract

In this paper, we present a new population-based heuristic for the multidimensional 0-1 knapsack problem (MKP) which is combined with 0-1 linear programming to improve the quality of the final heuristic solution. The MKP is one of the most well known NP-hard problems and has received wide attention from the operational research community during the last four decades. MKP arises in several practical problems such as the capital budgeting problem, cargo loading, cutting stock problem, and computing processors allocation in huge distributed systems. Several different techniques have been proposed to solve this problem. However, according to its NP-hard nature, exact methods are unable to find optimal solutions for larger problem instances. Heuristic methods have become the alternative, and the last generation of them, are being successfully applied to this problem. Hence, in practice, heuristic algorithms to generate near-optimal solutions for larger problem instances are of special interest. The presented hybrid heuristic approach exploits the fact, that using a state-of-the-art solver a small binary linear programming (BLP) problem can be solved within reasonable time. The computational experiments show that the presented combined approach produces highly competitive results in significantly shorter run-times than the previously described approaches.

References

  1. Bertsimas, D., Demir, R., 2002. An approximate dynamic-programming approach to multidimensional knapsack problem, Management Science, 4, 550-565.
  2. Boyer, V., Elkihel, M., El Baz, D., 2008. Heuristics for the 0-1 multidimensional knapsack problem, European Journal of Operational Research, doi: 10.1016/j.ejor.2007.06.068
  3. Mahdavi, M., Fesanghary, M., Damangir, E., 2006. An improved harmony search algorithm for solving optimization problems, Applied Mathematics and Computation, doi: 10.1016 / j.amc.2006.11.033.
  4. Fleszar, K., Hindi, K. S., 2009. Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem, Computers & Operations Research, 36, 1602-1607.
  5. Freville, A., Plateau, G., 1994. An efficient preprocessing procedure for the multidimensional 0- 1 knapsack problem, Discrete Applied Mathematics, 49, 189-212.
  6. Hanafi, S., Freville, A., El Abdellaoui, A., 1996. Comparison of heuristics for the 0-1 multidimensional knapsack problem, MetaHeuristics: Theory and Application, Kluwer Academic, 446-465.
  7. Hanafi, S., Wilbaut, C., 2011. Improved convergent heuristics for the 0-1 multidimensional knapsack problem, Annals of Operations Research, 183 (1), 125-142.
  8. Loulou, R., Michaelides, E., 1979. New greedy-like heuristics for the multidimensional 0-1 knapsack problem, Operations Research, 27(6), 1101-1114.
  9. Volgenant, A, Zwiers, I.Y., 2007. Partial enumeration in heuristics for some combinatorial optimization problems. Journal of the Operational Research Society, 58(1), 73-9.
Download


Paper Citation


in Harvard Style

Csébfalvi A. and Csébfalvi G. (2011). THE MULTIDIMENSIONAL 0-1 KNAPSACK PROBLEM - A New Heuristic Algorithm Combined with 0-1 Linear Programming . In Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2011) ISBN 978-989-8425-83-6, pages 203-207. DOI: 10.5220/0003671302030207


in Bibtex Style

@conference{ecta11,
author={Anikó Csébfalvi and György Csébfalvi},
title={THE MULTIDIMENSIONAL 0-1 KNAPSACK PROBLEM - A New Heuristic Algorithm Combined with 0-1 Linear Programming},
booktitle={Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2011)},
year={2011},
pages={203-207},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003671302030207},
isbn={978-989-8425-83-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2011)
TI - THE MULTIDIMENSIONAL 0-1 KNAPSACK PROBLEM - A New Heuristic Algorithm Combined with 0-1 Linear Programming
SN - 978-989-8425-83-6
AU - Csébfalvi A.
AU - Csébfalvi G.
PY - 2011
SP - 203
EP - 207
DO - 10.5220/0003671302030207