Journal of Heuristics

, Volume 4, Issue 1, pp 63–86 | Cite as

A Genetic Algorithm for the Multidimensional Knapsack Problem

  • P.C. Chu
  • J.E. Beasley

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.

genetic algorithms multidimensional knapsack multiconstraint knapsack combinatorial optimisation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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 Computing6, 82-93.Google Scholar
  2. Averbakh, I. (1994). “Probabilistic Properties of the Dual Structure of the Multidimensional Knapsack Problem and Fast Statistically Efficient Algorithms,” Mathematical Programming65, 311-330.Google Scholar
  3. Bäck, T., D.B. Fogel, and Z. Michalewicz (eds.). (1997). Handbook of Evolutionary Computation. Oxford University Press.Google Scholar
  4. Balas, E. (1965). “An Additive Algorithm for Solving Linear Programs with Zero-One Variables,” Operations Research13, 517-546.Google Scholar
  5. Balas, E. and C.H. Martin. (1980). “Pivot and Complement-A Heuristic for 0-1 Programming,” Management Science26, 86-96.Google Scholar
  6. Battiti, R. and G. Tecchiolli. (1995). “Local Search with Memory: Benchmarking RTS,” OR Spektrum17, 67-86.Google Scholar
  7. Beasley, D., D.R. Bull, and R.R. Martin. (1993a). “An Overview of Genetic Algorithms: Part I, Fundamentals,” University Computing15, 58-69.Google Scholar
  8. Beasley, D., D.R. Bull, and R.R. Martin. (1993b). “An Overview of Genetic Algorithms: Part II, Research Topics,” University Computing15, 170-181.Google Scholar
  9. Beasley, J.E. (1990). “OR-Library: Distributing Test Problems by Electronic Mail,” Journal of the Operational Research Society41, 1069-1072.Google Scholar
  10. Beasley, J.E. (1996). “Obtaining Test Problems via Internet,” Journal of Global Optimization8, 429-433.Google Scholar
  11. Beasley, J.E. and P.C. Chu. (1996). “A Genetic Algorithm for the Set Covering Problem,” European Journal of Operational Research94, 392-404.Google Scholar
  12. Cabot, A.V. (1970). “An Enumeration Algorithm for Knapsack Problems,” Operations Research18, 306- 311.Google Scholar
  13. Charon, I. and O. Hudry. (1993). “The Noising Method: A New Method for Combinatorial Optimization,” Operations Research Letters14, 133-137.Google Scholar
  14. Chu, P.C. (1997). “A Genetic Algorithm Approach for Combinatorial Optimisation Problems,” Ph.D. Thesis, University of London.Google Scholar
  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.Google Scholar
  16. Chu, P.C. and J.E. Beasley. (1997). “A Genetic Algorithm for the Generalised Assignment Problem,” Computers and Operations Research24, 17-23.Google Scholar
  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.Google Scholar
  18. Crama, Y. and J.B. Mazzola. (1994). “On the Strength of Relaxations of Multidimensional Knapsack Problems,” INFOR32, 219-225.Google Scholar
  19. Dammeyer, F. and S. Voss. (1993). “Dynamic Tabu List Management Using Reverse Elimination Method,” Annals of Operations Research41, 31-46.Google Scholar
  20. Dantzig, G.B. (1957). “Discrete Variable Problems,” Operations Research5, 266-277.Google Scholar
  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.Google Scholar
  22. Drexl, A. (1988). “A Simulated Annealing Approach to the Multiconstraint Zero-One Knapsack Problem,” Computing40, 1-8.Google Scholar
  23. Dueck, G. (1993). “New Optimization Heuristics: The Grand Deluge Algorithm And the Record-to-Record Travel,” Journal of Computational Physics104, 86-92.Google Scholar
  24. Dueck, G. and T. Scheuer. (1990). “Threshold Accepting: A General Purpose Optimization Algorithm Appearing Superior to Simulated Annealing,” Journal of Computational Physics90, 161-175.Google Scholar
  25. Everett, H. (1963). “Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources,” Operations Research11, 399-417.Google Scholar
  26. Fontanari, J.F. (1995). “A Statistical Analysis of the Knapsack Problem,” Journal of Physics A-Mathematical and General28, 4751-4759.Google Scholar
  27. Fox, G.E. and G.D. Scudder. (1985). “A Heuristic with Tie Breaking for Certain 0-1 Integer Programming Models,” Naval Research Logistics Quarterly32, 613-623.Google Scholar
  28. Freville, A. and G. Plateau. (1986). “Heuristics and Reduction Methods for Multiple Constraints 0-1 Linear Programming Problems,” European Journal of Operational Research24, 206-215.Google Scholar
  29. Freville, A. and G. Plateau. (1990). “Hard 0-1 Multiknapsack Test Problems for Size Reduction Methods,” Investigacion Operativa1, 251-270.Google Scholar
  30. Freville, A. and G. Plateau. (1994). “An Efficient Preprocessing Procedure for the Multidimensional 0-1 Knapsack Problem,” Discrete Applied Mathematics49, 189-212.Google Scholar
  31. Freville, A. and G. Plateau. (1997). “The 0-1 Bidimensional Knapsack Problem: Toward an Efficient High-Level Primitive Tool,” Journal of Heuristics2, 147-167.Google Scholar
  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 Research15, 100- 109.Google Scholar
  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.Google Scholar
  34. Gavish, B. and H. Pirkul. (1985). “Efficient Algorithms for Solving Multiconstraint Zero-One Knapsack Problems to Optimality,” Mathematical Programming31, 78-105.Google Scholar
  35. Gilmore, P.C. and R.E. Gomory. (1966). “The Theory and Computation of Knapsack Functions,” Operations Research14, 1045-1075.Google Scholar
  36. Glover, F. (1965). “A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem,” Operations Research13, 879-919.Google Scholar
  37. Glover, F. (1977). “Heuristics for Integer Programming Using Surrogate Constraints,” Decision Sciences8, 156-166.Google Scholar
  38. Glover, F. (1994). “Optimization by Ghost Image Processes in Neural Networks,” Computers and Operations Research21, 801-822.Google Scholar
  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.Google Scholar
  40. Goldberg, D.E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley.Google Scholar
  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.Google Scholar
  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.Google Scholar
  43. Hillier, F.S. (1969). “Efficient Heuristic Procedures for Integer Linear Programming with an Interior,” Operations Research17, 600-637.Google Scholar
  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.Google Scholar
  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.Google Scholar
  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.Google Scholar
  47. Kochenberger, G.A., B.A. McCarl, and F.P. Wymann. (1974). “A Heuristic for General Integer Programming,” Decision Sciences5, 36-44.Google Scholar
  48. Land, A.H. and S. Powell. (1973). Fortran Codes for Mathematical Programming Linear, Quadratic and Discrete. Wiley.Google Scholar
  49. Lee, J.S. and M. Guignard. (1988). “An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems-a Parametric Approach,” Management Science34, 402-410.Google Scholar
  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.Google Scholar
  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.Google Scholar
  52. Løkketangen, A., K. Jörnsten, and S. Storøy. (1994). “Tabu Search Within a Pivot and Complement Framework,” International Transactions of Operations Research1, 305-316.Google Scholar
  53. Loulou, R. and E. Michaelides. (1979). “New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem,” Operations Research27, 1101-1114.Google Scholar
  54. Magazine, M.J. and O. Oguz. (1984). “A Heuristic Algorithm for the Multidimensional Zero-One Knapsack Problem,” European Journal of Operational Research16, 319-326.Google Scholar
  55. Martello, S. and P. Toth. (1990). Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons.Google Scholar
  56. Michalewicz, Z. (1995). “A Perspective on Evolutionary Computation.” In X. Yao (ed.), Progress in Evolutionary Computation.Springer-Verlag, pp. 73-89.Google Scholar
  57. Mitchell, M. (1996). An Introduction to Genetic Algorithms. MIT Press.Google Scholar
  58. Nemhauser, G.L. and Z. Ullmann. (1969). “Discrete Dynamic Programming and Capital Allocation,” Management Science15, 494-505.Google Scholar
  59. Pirkul, H. (1987). “A Heuristic Solution Procedure for the Multiconstraint Zero-One Knapsack Problem,” Naval Research Logistics34, 161-172.Google Scholar
  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.Google Scholar
  61. Reeves, C.R. (1993). Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific.Google Scholar
  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.Google Scholar
  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 Mathematics42, 279-290.Google Scholar
  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.Google Scholar
  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.Google Scholar
  66. Schilling, K.E. (1990). “The Growth of m-Constraint Random Knapsacks,” European Journal of Operational Research46, 109-112.Google Scholar
  67. Senju, S. and Y. Toyoda. (1968). “An Approach to Linear Programming with 0-1 Variables,” Management Science15, 196-207.Google Scholar
  68. Shih, W. (1979). “A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem,” Journal of the Operational Research Society30, 369-378.Google Scholar
  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.Google Scholar
  70. Soyster, A.L., B. Lev, and W. Slivka. (1978). “Zero-One Programming with Many Variables and Few Constraints,” European Journal of Operational Research2, 195-201.Google Scholar
  71. Szkatula, K. (1994). “The Growth of Multi-constraint Random Knapsacks with Various Right-hand Sides of the Constraints,” European Journal of Operational Research73, 199-204.Google Scholar
  72. Szkatula, K. (1997). “The Growth of Multi-constraint Random Knapsacks with Large Right-hand Sides of the Constraints,” Operations Research Letters21, 25-30.Google Scholar
  73. Thiel, J. and S. Voss. (1994). “Some Experiences on Solving Multiconstraint Zero-One Knapsack Problems with Genetic Algorithms,” INFOR32, 226-242.Google Scholar
  74. Toyoda, Y. (1975). “A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems,” Management Science21, 1417-1427.Google Scholar
  75. Volgenant, A. and J.A. Zoon. (1990). “An Improved Heuristic for Multidimensional 0-1 Knapsack Problems,” Journal of the Operational Research Society41, 963-970.Google Scholar
  76. Weingartner, H.M. (1967). Mathematical Programming and the Analysis of Capital Budgeting Problems. Chicago: Markham Publishing.Google Scholar
  77. Weingartner, H.M. and D.N. Ness. (1967). “Methods for the Solution of the Multidimensional 0/1 Knapsack Problem,” Operations Research15, 83-103.Google Scholar
  78. Zanakis, S.H. (1977). “Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods,” Management Science24, 91-104.Google Scholar

Copyright information

© Kluwer Academic Publishers 1998

Authors and Affiliations

  • P.C. Chu
    • 1
  • J.E. Beasley
    • 1
  1. 1.The Management SchoolImperial CollegeLondonEngland. E-mail

Personalised recommendations