article

A Genetic Algorithm for the Multidimensional Knapsack Problem

Authors:

J. E. BeasleyAuthors Info & Claims

Journal of Heuristics, Volume 4, Issue 1

Pages 63 - 86

https://doi.org/10.1023/A:1009642405419

Published: 01 June 1998 Publication History

Abstract

In this paper we present a heuristic based upon genetic algorithms for the multidimensional knapsack problem. A heuristic operator which utilises problem-specific knowledge is incorporated into the standard genetic algorithm approach. Computational results show that the genetic algorithm heuristic is capable of obtaining high-quality solutions for problems of various characteristics, whilst requiring only a modest amount of computational effort. Computational results also show that the genetic algorithm heuristic gives superior quality solutions to a number of other heuristics.

References

[1]

Aboudi, R. and K. Jörnsten. (1994). "Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic," ORSA Journal on Computing 6, 82-93.

[2]

Averbakh, I. (1994). "Probabilistic Properties of the Dual Structure of the Multidimensional Knapsack Problem and Fast Statistically Efficient Algorithms," Mathematical Programming 65, 311-330.

Digital Library

[3]

Bäck, T., D.B. Fogel, and Z. Michalewicz (eds.). (1997). Handbook of Evolutionary Computation. Oxford University Press.

Digital Library

[4]

Balas, E. (1965). "An Additive Algorithm for Solving Linear Programs with Zero-One Variables," Operations Research 13, 517-546.

Digital Library

[5]

Balas, E. and C.H. Martin. (1980). "Pivot and Complement--A Heuristic for 0-1 Programming," Management Science 26, 86-96.

Digital Library

[6]

Battiti, R. and G. Tecchiolli. (1995). "Local Search with Memory: Benchmarking RTS," OR Spektrum 17, 67-86.

[7]

Beasley, D., D.R. Bull, and R.R. Martin. (1993a). "An Overview of Genetic Algorithms: Part I, Fundamentals," University Computing 15, 58-69.

[8]

Beasley, D., D.R. Bull, and R.R. Martin. (1993b). "An Overview of Genetic Algorithms: Part II, Research Topics," University Computing 15, 170-181.

[9]

Beasley, J.E. (1990). "OR-Library: Distributing Test Problems by Electronic Mail," Journal of the Operational Research Society 41, 1069-1072.

[10]

Beasley, J.E. (1996). "Obtaining Test Problems via Internet," Journal of Global Optimization 8, 429-433.

[11]

Beasley, J.E. and P.C. Chu. (1996). "A Genetic Algorithm for the Set Covering Problem," European Journal of Operational Research 94, 392-404.

[12]

Cabot, A.V. (1970). "An Enumeration Algorithm for Knapsack Problems," Operations Research 18, 306- 311.

Digital Library

[13]

Charon, I. and O. Hudry. (1993). "The Noising Method: A New Method for Combinatorial Optimization," Operations Research Letters 14, 133-137.

Digital Library

[14]

Chu, P.C. (1997). "A Genetic Algorithm Approach for Combinatorial Optimisation Problems," Ph.D. Thesis, University of London.

[15]

Chu, P.C. and J.E. Beasley. (1995). "Constraint Handling in Genetic Algorithms: The Set Partitioning Problem," Imperial College, Working paper. To appear in Journal of Heuristics.

Digital Library

[16]

Chu, P.C. and J.E. Beasley. (1997). "A Genetic Algorithm for the Generalised Assignment Problem," Computers and Operations Research 24, 17-23.

Digital Library

[17]

CPLEX Optimization Inc. (1995). Using the CPLEX Callable Library. CPLEX Optimization Inc., Suite 279, 930 Tahoe Blvd., Bldg. 802, Incline Valley, NV 89451-9436, USA.

[18]

Crama, Y. and J.B. Mazzola. (1994). "On the Strength of Relaxations of Multidimensional Knapsack Problems," INFOR 32, 219-225.

[19]

Dammeyer, F. and S. Voss. (1993). "Dynamic Tabu List Management Using Reverse Elimination Method," Annals of Operations Research 41, 31-46.

Digital Library

[20]

Dantzig, G.B. (1957). "Discrete Variable Problems," Operations Research 5, 266-277.

Digital Library

[21]

Davis, L. and M. Steenstrup. (1987). "Genetic Algorithms and Simulated Annealing: An Overview." In L. Davis (ed.), Genetic Algorithms and Simulated Annealing. Morgan Kaufmann. pp. 1-11.

[22]

Drexl, A. (1988). "A Simulated Annealing Approach to the Multiconstraint Zero-One Knapsack Problem," Computing 40, 1-8.

Digital Library

[23]

Dueck, G. (1993). "New Optimization Heuristics: The Grand Deluge Algorithm And the Record-to-Record Travel," Journal of Computational Physics 104, 86-92.

Digital Library

[24]

Dueck, G. and T. Scheuer. (1990). "Threshold Accepting: A General Purpose Optimization Algorithm Appearing Superior to Simulated Annealing," Journal of Computational Physics 90, 161-175.

Digital Library

[25]

Everett, H. (1963). "Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources," Operations Research 11, 399-417.

Digital Library

[26]

Fontanari, J.F. (1995). "A Statistical Analysis of the Knapsack Problem," Journal of Physics A--Mathematical and General 28, 4751-4759.

[27]

Fox, G.E. and G.D. Scudder. (1985). "A Heuristic with Tie Breaking for Certain 0-1 Integer Programming Models," Naval Research Logistics Quarterly 32, 613-623.

[28]

Freville, A. and G. Plateau. (1986). "Heuristics and Reduction Methods for Multiple Constraints 0-1 Linear Programming Problems," European Journal of Operational Research 24, 206-215.

[29]

Freville, A. and G. Plateau. (1990). "Hard 0-1 Multiknapsack Test Problems for Size Reduction Methods," Investigacion Operativa 1, 251-270.

[30]

Freville, A. and G. Plateau. (1994). "An Efficient Preprocessing Procedure for the Multidimensional 0-1 Knapsack Problem," Discrete Applied Mathematics 49, 189-212.

Digital Library

[31]

Freville, A. and G. Plateau. (1997). "The 0-1 Bidimensional Knapsack Problem: Toward an Efficient High-Level Primitive Tool," Journal of Heuristics 2, 147-167.

[32]

Frieze, A.M. and M.R.B. Clarke. (1984). "Approximation Algorithms for the m-Dimensional 0-1 Knapsack Problem: Worst-Case and Probabilistic Analysis," European Journal of Operational Research 15, 100- 109.

[33]

Gavish, B. and H. Pirkul. (1982). "Allocation of Databases and Processors in a Distributed Computing System." In J. Akoka (ed.) Management of Distributed Data Processing, North-Holland, pp. 215- 231.

[34]

Gavish, B. and H. Pirkul. (1985). "Efficient Algorithms for Solving Multiconstraint Zero-One Knapsack Problems to Optimality," Mathematical Programming 31, 78-105.

Digital Library

[35]

Gilmore, P.C. and R.E. Gomory. (1966). "The Theory and Computation of Knapsack Functions," Operations Research 14, 1045-1075.

Digital Library

[36]

Glover, F. (1965). "A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem," Operations Research 13, 879-919.

Digital Library

[37]

Glover, F. (1977). "Heuristics for Integer Programming Using Surrogate Constraints," Decision Sciences 8, 156-166.

[38]

Glover, F. (1994). "Optimization by Ghost Image Processes in Neural Networks," Computers and Operations Research 21, 801-822.

Digital Library

[39]

Glover, F. and G.A. Kochenberger. (1996). "Critical Event Tabu Search for Multidimensional Knapsack Problems." In I.H. Osman and J.P. Kelly (eds.), Meta-Heuristics: Theory and Applications. Kluwer Academic Publishers, pp. 407-427.

[40]

Goldberg, D.E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley.

Digital Library

[41]

Hanafi, S. and A. Freville. (1997). "An Efficient Tabu Search Approach for the 0-1 Multidimensional Knapsack Problem," To appear in European Journal of Operational Research.

[42]

Hanafi, S., A. Freville and A.El. Abedellaoui. (1996). "Comparison of Heuristics for the 0-1 Multidimensional Knapsack Problem," In I.H. Osman and J.P. Kelly (eds.), Meta-Heuristics: Theory and Applications. Kluwer Academic Publishers, pp. 449-465.

[43]

Hillier, F.S. (1969). "Efficient Heuristic Procedures for Integer Linear Programming with an Interior," Operations Research 17, 600-637.

Digital Library

[44]

Hoff, A., A. Løkketangen, and I. Mittet. (1996). "Genetic Algorithms for 0/1 Multidimensional Knapsack Problems." Working Paper, Molde College, Britveien 2, 6400 Molde, Norway.

[45]

Holland, J.H. (1975). Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. University of Michigan Press.

Digital Library

[46]

Khuri, S., T. Bäck, and J. Heitkötter. (1994). "The Zero/One Multiple Knapsack Problem and Genetic Algorithms," Proceedings of the 1994 ACM Symposium on Applied Computing (SAC'94), ACM Press, pp. 188- 193.

Digital Library

[47]

Kochenberger, G.A., B.A. McCarl, and F.P. Wymann. (1974). "A Heuristic for General Integer Programming," Decision Sciences 5, 36-44.

[48]

Land, A.H. and S. Powell. (1973). Fortran Codes for Mathematical Programming Linear, Quadratic and Discrete. Wiley.

Digital Library

[49]

Lee, J.S. and M. Guignard. (1988). "An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems--a Parametric Approach," Management Science 34, 402-410.

Digital Library

[50]

Løkketangen, A. and F. Glover. (1996). "Probabilistic Move Selection in Tabu Search for Zero-One Mixed Integer Programming Problems." In I.H. Osman and J.P. Kelly (eds.), Meta-Heuristics: Theory and Applications. Kluwer Academic Publishers, pp. 467-487.

[51]

Løkketangen, A. and F. Glover. (1997). "Solving Zero-One Mixed Integer Programming Problems Using Tabu Search," to appear in European Journal of Operational Research.

[52]

Løkketangen, A., K. Jörnsten, and S. Storøy. (1994). "Tabu Search Within a Pivot and Complement Framework," International Transactions of Operations Research 1, 305-316.

[53]

Loulou, R. and E. Michaelides. (1979). "New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem," Operations Research 27, 1101-1114.

Digital Library

[54]

Magazine, M.J. and O. Oguz. (1984). "A Heuristic Algorithm for the Multidimensional Zero-One Knapsack Problem," European Journal of Operational Research 16, 319-326.

[55]

Martello, S. and P. Toth. (1990). Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons.

Digital Library

[56]

Michalewicz, Z. (1995). "A Perspective on Evolutionary Computation." In X. Yao (ed.), Progress in Evolutionary Computation. Springer-Verlag, pp. 73-89.

Digital Library

[57]

Mitchell, M. (1996). An Introduction to Genetic Algorithms. MIT Press.

Digital Library

[58]

Nemhauser, G.L. and Z. Ullmann. (1969). "Discrete Dynamic Programming and Capital Allocation," Management Science 15, 494-505.

Digital Library

[59]

Pirkul, H. (1987). "A Heuristic Solution Procedure for the Multiconstraint Zero-One Knapsack Problem," Naval Research Logistics 34, 161-172.

[60]

Powell, D. and M.M. Skolnick. (1993). "Using Genetic Algorithms in Engineering Design Optimization with Nonlinear Constraints." In S. Forrest (ed.), Proceedings of the Fifth International Conference on Genetic Algorithms. Morgan Kaufmann, pp. 424-431.

Digital Library

[61]

Reeves, C.R. (1993). Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific.

Digital Library

[62]

Richardson, J., M. Palmer, G. Liepins, and M. Hillard. (1989). "Some Guidelines for Genetic Algorithms with Penalty Functions." In J. Schaffer (ed.), Proceedings of the Third International Conference on Genetic Algorithms . Morgan Kaufmann, pp. 191-197.

Digital Library

[63]

Rinnooy Kan, A.H.G., L. Stougie, and C. Vercellis. (1993). "A Class of Generalized Greedy Algorithms for the Multi-knapsack Problem," Discrete Applied Mathematics 42, 279-290.

Digital Library

[64]

Rudolph, G. and J. Sprave. (1995). "A Cellular Genetic Algorithm with Self-adjusting Acceptance Threshold," Proceedings of the First IEE/IEEE International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications. IEE, London, pp. 365-372.

[65]

Rudolph, G. and J. Sprave. (1996). "Significance of Locality and Selection Pressure in the Grand Deluge Evolutionary Algorithm," In H.M. Voigt, W. Ebeling, I. Rechenberg, and H.P. Schwefel (eds.), Parallel Problem Solving from Nature IV. Proceedings of the International Conference on Evolutionary Computation. Lecture Notes in Computer Science, Springer, pp. 686-694.

Digital Library

[66]

Schilling, K.E. (1990). "The Growth of m-Constraint Random Knapsacks," European Journal of Operational Research 46, 109-112.

[67]

Senju, S. and Y. Toyoda. (1968). "An Approach to Linear Programming with 0-1 Variables," Management Science 15, 196-207.

Digital Library

[68]

Shih, W. (1979). "A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem," Journal of the Operational Research Society 30, 369-378.

[69]

Smith, A.E. and D.M. Tate. (1993). "Genetic Optimization Using a Penalty-Function." In S. Forrest (ed.), Proceedings of the Fifth International Conference on Genetic Algorithms. Morgan Kaufmann, pp. 499-505.

Digital Library

[70]

Soyster, A.L., B. Lev, and W. Slivka. (1978). "Zero-One Programming with Many Variables and Few Constraints," European Journal of Operational Research 2, 195-201.

[71]

Szkatula, K. (1994). "The Growth of Multi-constraint Random Knapsacks with Various Right-hand Sides of the Constraints," European Journal of Operational Research 73, 199-204.

[72]

Szkatula, K. (1997). "The Growth of Multi-constraint Random Knapsacks with Large Right-hand Sides of the Constraints," Operations Research Letters 21, 25-30.

Digital Library

[73]

Thiel, J. and S. Voss. (1994). "Some Experiences on Solving Multiconstraint Zero-One Knapsack Problems with Genetic Algorithms," INFOR 32, 226-242.

[74]

Toyoda, Y. (1975). "A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems," Management Science 21, 1417-1427.

Digital Library

[75]

Volgenant, A. and J.A. Zoon. (1990). "An Improved Heuristic for Multidimensional 0-1 Knapsack Problems," Journal of the Operational Research Society 41, 963-970.

[76]

Weingartner, H.M. (1967). Mathematical Programming and the Analysis of Capital Budgeting Problems. Chicago: Markham Publishing.

[77]

Weingartner, H.M. and D.N. Ness. (1967). "Methods for the Solution of the Multidimensional 0/1 Knapsack Problem," Operations Research 15, 83-103.

Digital Library

[78]

Zanakis, S.H. (1977). "Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods," Management Science 24, 91-104.

Digital Library

Cited By

Abdel-Basset MMohamed RSaber SHezam ISallam KHameed I(2024)Binary metaheuristic algorithms for 0–1 knapsack problemsJournal of King Saud University - Computer and Information Sciences10.1016/j.jksuci.2024.10209336:6Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1016/j.jksuci.2024.102093
Scherer MHill RLunday BCox BWhite E(2024)Applying instance space analysis for metaheuristic selection to the 0–1 multidemand multidimensional knapsack problemComputers and Operations Research10.1016/j.cor.2024.106747170:COnline publication date: 1-Oct-2024
https://dl.acm.org/doi/10.1016/j.cor.2024.106747
Lien SYeh CDeng D(2024)Optimum splitting computing for DNN training through next generation smart networks: a multi-tier deep reinforcement learning approachWireless Networks10.1007/s11276-023-03600-530:3(1737-1751)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1007/s11276-023-03600-5
Show More Cited By

Index Terms

A Genetic Algorithm for the Multidimensional Knapsack Problem

Recommendations

An empirical study of population-based metaheuristics for the multiple-choice multidimensional knapsack problem

In this paper, we study the performance of five population-based metaheuristics to solve a large 393 number of comprehensive problem instances from the literature for the important NP-Hard multiple choice multidimensional knapsack problem MMKP. The five ...
A case study of controlling crossover in a selection hyper-heuristic framework using the multidimensional knapsack problem

Hyper-heuristics are high-level methodologies for solving complex problems that operate on a search space of heuristics. In a selection hyper-heuristic framework, a heuristic is chosen from an existing set of low-level heuristics and applied to the ...
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem
GECCO '05: Proceedings of the 7th annual conference on Genetic and evolutionary computation

Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem extends the familiar Knapsack Problem by assigning values not only to ...

Comments

Information & Contributors

Information

Published In

cover image Journal of Heuristics

Journal of Heuristics Volume 4, Issue 1

June 1998

95 pages

ISSN:1381-1231

Issue’s Table of Contents

Copyright © Copyright © 1998 Kluwer Academic Publishers.

Publisher

Kluwer Academic Publishers

United States

Publication History

Published: 01 June 1998

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

211
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Abdel-Basset MMohamed RSaber SHezam ISallam KHameed I(2024)Binary metaheuristic algorithms for 0–1 knapsack problemsJournal of King Saud University - Computer and Information Sciences10.1016/j.jksuci.2024.10209336:6Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1016/j.jksuci.2024.102093
Scherer MHill RLunday BCox BWhite E(2024)Applying instance space analysis for metaheuristic selection to the 0–1 multidemand multidimensional knapsack problemComputers and Operations Research10.1016/j.cor.2024.106747170:COnline publication date: 1-Oct-2024
https://dl.acm.org/doi/10.1016/j.cor.2024.106747
Lien SYeh CDeng D(2024)Optimum splitting computing for DNN training through next generation smart networks: a multi-tier deep reinforcement learning approachWireless Networks10.1007/s11276-023-03600-530:3(1737-1751)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1007/s11276-023-03600-5
Bushaj SBüyüktahtakın İ(2024)A K-means Supported Reinforcement Learning Framework to Multi-dimensional KnapsackJournal of Global Optimization10.1007/s10898-024-01364-689:3(655-685)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1007/s10898-024-01364-6
Lu MLu HHou XHu Q(2024)A self-adaptive arithmetic optimization algorithm with hybrid search modes for 0–1 knapsack problemNeural Computing and Applications10.1007/s00521-024-10327-736:33(21177-21210)Online publication date: 1-Nov-2024
https://dl.acm.org/doi/10.1007/s00521-024-10327-7
Jovanovic RVoß S(2024)Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit setsOR Spectrum10.1007/s00291-024-00746-246:4(1329-1365)Online publication date: 1-Dec-2024
https://dl.acm.org/doi/10.1007/s00291-024-00746-2
Thuerck DSofranac BPfetsch MPokutta SOh ANaumann TGloberson ASaenko KHardt MLevine S(2023)Learning cuts via enumeration oraclesProceedings of the 37th International Conference on Neural Information Processing Systems10.5555/3666122.3669583(79108-79123)Online publication date: 10-Dec-2023
https://dl.acm.org/doi/10.5555/3666122.3669583
Gao WGe DSun CYe YKrause ABrunskill ECho KEngelhardt BSabato SScarlett J(2023)Solving linear programs with fast online learning algorithmsProceedings of the 40th International Conference on Machine Learning10.5555/3618408.3618838(10649-10675)Online publication date: 23-Jul-2023
https://dl.acm.org/doi/10.5555/3618408.3618838
Buzdalov MSilva SPaquete L(2023)Improving Time and Memory Efficiency of Genetic Algorithms by Storing Populations as Minimum Spanning Trees of PatchesProceedings of the Companion Conference on Genetic and Evolutionary Computation10.1145/3583133.3596388(1873-1881)Online publication date: 15-Jul-2023
https://dl.acm.org/doi/10.1145/3583133.3596388
Tekawade ABanerjee SHong JLanperne MPark JCerny TShahriar H(2023)CEDCES: A Cost Effective Deadline Constrained Evolutionary Scheduler for Task Graphs in Multi-Cloud SystemProceedings of the 38th ACM/SIGAPP Symposium on Applied Computing10.1145/3555776.3577796(42-44)Online publication date: 27-Mar-2023
https://dl.acm.org/doi/10.1145/3555776.3577796
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents