Using Surrogate Constraints in Genetic Algorithms for Solving Multidimensional Knapsack Problems
In the multidimensional knapsack problem (or multiconstraint zero-one knapsack problem) one has to decide on how to make efficient use of an entity which consumes multiple resources. The problem is known to be NP-hard, thus heuristics come into consideration for a solution. In this paper we investigate genetic algorithms as a solution approach. Surrogate constraints are generated by several different methods and are utilized as one of the stages in genetic algorithms for solving the multidimensional knapsack problem. This approach as a standalone method does not improve results but in conjunction with a greedy local search strategy results may be improved for problem instances with small object-constraint ratio.
KeywordsGenetic Algorithm Local Search Problem Instance Knapsack Problem Random Search
Unable to display preview. Download preview PDF.
- Bäck, T. and Schütz, M. (1996). Intelligent mutation rate control in canonical genetic algorithms. In Ras, Z. W. and Michalewicz, M., editors, Foundation of Intelligent Systems 9th International Symposium, ISMIS ‘86, pages 158–167, Berlin. Springer.Google Scholar
- Bornhold, S. and Schuster, H.–G. (1995). Hierarchical crossover and probability landscapes of genetic operators. Technical Report 95–04–43, The Santa Fe Institute. http://www.santafe.edu/sfi/publications/Working–Papers/9504–043.ps.
- Chu, P. C. and Beasley, J. E. (1997). A genetic algorithm for the multiconstraint knapsack problem. Working Paper, Imperial College, London.Google Scholar
- Garey, M. and Johnson, D. S. (1979). Computers and Intractibility - A Guide to the Theory of NP-Completeness. Freeman, San Francisco.Google Scholar
- Goldberg, D. E. (1990). Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley.Google Scholar
- Goldberg, D. E. and Deb, K. (1991). A comparative analysis of selection schemes used in genetic algorithms. In Rawlings, G., editor, Foundations of Genetic Algorithms, pages 69–93. Morgan Kaufmann, San Mateo.Google Scholar
- Gordon, V. S., Böhm, A. P. W., and Whitley, D. L. (1993). A note on the performance of genetic algorithms on zero-one knapsack problems. Technical Report CS-93–108, Colorado State University. http://www.cs.colostate.edu/-ftppub/TechReports/1993/tr-108.ps.Z.
- Gordon, V. S. and Whitley, D. L. (1993). Serial and parallel genetic algorithms as function optimizers. In Forrest, S., editor, ICGA-93: The 5th International Conference on Genetic Algorithms, pages 177–183, Urbana-Champaign. Morgan-Kaufmann.Google Scholar
- Hoff, A., LOkketangen, A., and Mittet, I. (1996). Genetic algorithms for 0/1 multidimensional knapsack problems. In Proceedings Norsk Informatikk Konferanse, NIK’96, pages 291–301, Trondheim. Tapir.Google Scholar
- Holland, J. (1975). Adaption in Natural and Artificial Systems. University of Michigan Press.Google Scholar
- Khuri, S., Bäck, T., and Heitkötter, J. (1994). The zero/one multiple knapsack problem and genetic algorithms. In Proceedings of the 1994 ACM Symposium on Applied Computing (SAC’94),Genetic Algorithms and Optimization Track. ACM, ACM Press.Google Scholar
- Macready, W. G. and Wolpert, D. H. (1995). What makes an optimization problem hard? Technical Report SFT–TR–95–05–046, The Santa Fe Institute. http://www.dai.ed.ac.uk/groups/evalg/Local_Copies_of_Papers/Macready–Wolpert.What_Makes_an_Optimization_Problem_Hard.ps.gz.
- Mangano, S. R. (1996). A genetic algorithm white paper. http://www.manmach.com/information/white.html. Man Machine Interfaces Inc.
- Martello, S. and Toth, P. (1990). Knapsack Problems: Algorithms and Computer Implementations. Wiley, Chichester.Google Scholar
- Mathias, K. E. and Whitley, D. L. (1994). Remapping subpartitions of hyperspace using iterative genetic search. Technical report, Colorado State University. http: //www.cs.colostate.edu/“ftppub/TechReports/1994/tr-101.ps.Z.Google Scholar
- Radcliffe, N. J. and Surry, P. D. (1995). Fundamental limita- tions on search algorithms: Evolutionary computing in perspective. http://www.dai.ed.ac.uk/groups/evalg/Local_Copies_of_Papers/Radcliffe-Surry. Fundament al_limitations_on_search_algorithms_ EC_in_perspective.ps.gz.
- Richardson, J., Palmer, M., Liepins, G., and Hillard, M. (1989). Some guidelines for genetic algorithms with penalty functions. In Proceedings of the Third International Conference on Genetic Algorithms,pages 191–197. Morgan-Kaufmann.Google Scholar
- Senju, S. and Toyoda, Y. (1968). An approach to linear programming with 0–1 variables. Management Science, 15 B:196 — 207.Google Scholar
- Shih, W. (1979). A branch and bound method for the multiconstraint zero-one knapsack problem. Journal of the Operational Research Society, 30:369 — 378.Google Scholar
- Smith, A. E. and Tate, D. M. (1993). Genetic optimization using a penalty-function. In Forrest, S., editor, ICGA-93: The 5th International Conference on Genetic Algorithms, pages 499 — 505, Urbana-Champaign. Morgan-Kaufmann.Google Scholar
- Thiel, J. and Voß, S. (1994). Some experiences on solving multiconstraint zero-one knapsack problems with genetic algorithms. INFOR, 32:226 — 243.Google Scholar
- Weingartner, H. M. and Ness, D. N. (1967). Methods for the solution of multidimensional 0/1 knapsack problems. Operations Research, 15:83 —103.Google Scholar
- Whitley, D. L. (1994). A genetic algorithm tutorial. Statistics and Computing, 4:65 — 85.Google Scholar
- Whitley, D. L., Gordon, V. S., and Mathias, K. E. (1994). Lamarckian evolution, the baldwin effect and function optimization. In Davidor, Y., Schwefel, H. P., and Manner, R., editors, Parallel Problem Solving from Nature—PPSN III, pages 6 —15. Springer.Google Scholar
- Wolpert, D. H. and Macready, W. G. (1995). No free lunch theorems for search. Technical Report SFI–TR–95–02–010, The Santa Fe Institute. http://www.dai.ed.ac.uk/groups/evalg/Local_Copies_of_Papers/Wolpert.Macready.No Free_Lunch Theorems_for_Search.ps.gz.