Abstract
The multidimensional 0–1 knapsack problem (0–1MKP) is a generalization of the well-known 0–1 knapsack problem. As for any hard optimization problem also for 0–1MKP, a reasonable effort to cope with the problem is trying to derive heuristics which solve it suboptimally and which, possibly, yield a good trade-off between the solution quality and the time and the memory requirements. In this paper, we describe several heuristics for 0–1MKP. The first one is a simple multistage algorithm (SMA) which always maintains feasibility requirements. We also propose variants of the tabu search dealing with infeasibility, called also tunneling effect. We implement these heuristics as C code and compare their performances.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Aboudi and K. Jornsten, Tabu Search for General Zero Integer Programs using the Pivot and Complement Heuristic, ORSA Journal on Computing, 6 (1994) 82.
E. Balas and C. H. Martin, Pivot and Complement — A Heuristic for 0–1 Programming, Management Science Research 26, 1 (1980) 86.
R. Battiti and G. Tecchiolli, Local Search with Memory: Benchmarking RTS, in OR-Spektrum, 17 (1995) forthcoming.
R. Battiti and G. Tecchiolli, The Reactive Tabu Search, ORSA Journal on Computing, 6 (1994) 126.
I. Charon and O. Hudry, The Noising Method: A New Method for Combinatorial Optimization, Operations Research Letters, 14 (1993a) 133.
I. Charon and O. Hudry, La méthode du bruitage: application au problème du voyageur de commerce, Working paper, ENST 93 D003, Paris, France (1993b).
F. Dammeyer and S. Voss, Application of Tabu Search Strategies for Solving Multiconstraint Zero-One Knapsack Problems, Working paper, Technische Hochschule Darmstadt, Germany (1991).
F. Dammeyer and S. Voss, Dynamic Tabu List Management using the Reverse elimination Method, Annals of Operations Research, 41 (1993) 31.
A. Drexl, A Simulated Annealing Approach to the Multiconstraint Zero-One knapsack Problem, Computing, 40 (1988) 1.
G. Dueck, New Optimization Heuristics — The Great Deluge Algorithm and the Record-to-Record Travel, Working paper, TR 89 06 011, IBM Heidelberg Scientific Center, Germany (1989).
G. Dueck and T. Scheurer, Threshold Accepting: A General Purpose Optimization Algorithm, Journal of Computational Physics, 90 (1990) 161.
G. Dueck and J. Wirsching, Threshold Accepting Algorithms for Multi-Constraint 0–1 Knapsack Problems, Working paper, TR 89 10 016, IBM Heidelberg Scientific Center, Germany (1989).
A. Fréville, Contribution à l’Optimisation en Nombres Entiers, Habilitation à Diriger des Recherches, University of Paris XIII, France (1991).
A. Fréville, A Comprehensive Survey of Heuristics for the 0–1 Multiknapsack Problem, Working paper, University of Valenciennes, France (1995).
A. Fréville, S. Hanafi and A. El Abdellaoui, Noising Method for the 0–1 Multiknapsack Problem, Presented at the congress FRANCORO (Mons Belgium), University of Valenciennes, France (1995a).
A. Fréville, S. Hanafi and A. El Abdellaoui, Efficiency of Tabu Tunneling on Solving 0–1 Multiknapsack Problems, Working paper, University of Valenciennes, France (1995b).
A. Fréville and G. Plateau, Méthodes Heuristiques Performantes pour les Programmes en Variables 0–1, Working paper, ANO-91, University of Lille, France (1982).
A. Fréville and G. Plateau, Heuristics and Reduction Methods for-Multiple Constraints 0–1 Linear Programming Problems, European Journal of Operational Research, 24 (1986) 206.
A. Fréville and G. Plateau, Hard 0–1 Multiknapsack Test Problems for Size Reduction Methods, Investigacion Operativa, l (1990) 251.
A. Fréville and G. Plateau, FPMK90: an Algorithm for Solving the Multiknapsak Problem, Presented at Congress TIMS-SOBRAPO (Rio Brazil), Universities of Paris XIII and Valenciennes, France (1991).
A. Fréville and G. Plateau, An Efficient Preprocessing Procedure for the Multidimensional 0–1 Knapsack problem, Discrete Applied Mathematics, 49 (1994) 189.
A. Fréville and G. Plateau, The 0–1 Bidimensional Knapsack Problem: Towards an Efficient High Level Primitive Tool, Working paper, Universities of Paris XIII and Valenciennes, France (1995).
M. Gendreau, A. Hertz and G. Laporte, A Tabu Search Heuristic for the Vehicle Routing Problem, Management Science, 40 (1994) 1276.
F. Glover, Heuristics for Integer Programing Using Surrogate Constraints, Decision Sciences, 8 (1977) 156.
F. Glover, Some Fresh Heuristic Principles for Integer Programming, Working paper, 77–7, University of Colorado, Boulder, USA (1978).
F. Glover, Future Paths for Integer Programing and Links to Artificial Intelligence, Computers and Operations Research, 19 (1986) 533.
F. Glover, Tabu Search: Part 1, ORSA Journal on Computing, 1 (1989) 190.
F. Glover, Tabu Search: Part 2, ORSA Journal on Computing, 2 (1990) 4.
F. Glover, Tabu Search Fundamentals and Uses, Working paper, University of Colorado, USA (1995).
F. Glover and G. Kochenberger, Critical Event Tabu Search for Multidimensional Knapsack problems, Working paper, University of Colorado, USA (1995).
F. Glover and M. Laguna, Tabu Search in: Modern Heuristic Techniques for Combinatorial Problems, ed. C.R.Reeves (Bllackwell, Oxford, 1993).
F. Glover and A. Lokketangen, Solving Zero-One Mixed Integer programming problems Using Tabu Search, Working paper, University of Colorado, Boulder, USA (1994a).
F. Glover and A. Lokketangen, Probabilistic Tabu Search for Zero-One Mixed Integer Programming Problems, Working paper, University of Colorado, Boulder, USA (1994b).
P. Hansen, The Steepest Ascent, Mildest Descent Heuristic for Combinatorial programming, Presented at the Congress on Numerical Methods in Combinatorial Optimization, Capri, Italy (1986).
M.Laguna et al, Tabu Search for the Multilevel Generalized Assignement Problem, European Journal of Operational Research, 82 (1995) 176.
J.S. Lee and M. Guignard, An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems — a Parametric Approach, Management Sciences, 34 (1988) 402.
S. Martello and P.Toth, Knapsack Problems: Algorithms and Computer Implementations, (Wiley & Sons, Chichester 1990).
LH.Osman, Heuristics for the Generalized Assignment Problem: Simulated Annealing and Tabu Search Approaches, in OR- Specktrum, 17 (1995) forthcoming.
S. Senju and Y. Toyoda, An Approach to Linear Programming with 0–1 Variables, Management Sciences, 15B (1968) 196.
J. Thiel and S. Voss, Some Experiences on Solving Multiconstraint Zero-One Knapsack Problems with Genetic Algorithms, INFOR, 32 (1994), 226.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Hanafi, S., Freville, A., El Abdellaoui, A. (1996). Comparison of Heuristics for the 0–1 Multidimensional Knapsack Problem. In: Osman, I.H., Kelly, J.P. (eds) Meta-Heuristics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1361-8_27
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1361-8_27
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8587-8
Online ISBN: 978-1-4613-1361-8
eBook Packages: Springer Book Archive