Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

An Analysis of the Relationship between Problem Characteristics and Algorithm Performance : A Case Study on 0-1 Knapsack Problems

문제 특성과 알고리듬 수행 능력 간 관계에 관한 분석 : 0-1 Knapsack 문제에 관한 사례 연구

  • 양재환 (서울시립대학교 경영학부) ;
  • 김현수 (경기대학교 첨단산업공학부)
  • Published : 2006.03.01
Download PDF
⟨ Previous Next ⟩

Abstract

We perform a computational study on 0-1 knapsack problems generated under explicit correlation induction. A total of 2000 100-variable test problems are solved. We use two solution methods: (1) a well known heuristic and (2) a representative branch and bound type algorithm. Two different performance measures are considered: (1) the number of nodes needed to find an optimal solution and (2) the relative error of the heuristic solution. We also examine the effect of different joint probability mass functions (pmfs) for the coefficient values on the performance of the solution procedure.

Keywords

References

  1. Balas, E. and E. Zemeal, 'An Algorithm for Large Zero-One Knapsack Problems,' Operations Research, Vol.28, No.4(1980), pp.1130- 1154 https://doi.org/10.1287/opre.28.5.1130
  2. Barr, R.S., B.L. Golden, J.P. Kelly, M.G.C. Resende, and W.R. Stewart Jr., 'Designing and Reporting on Computational Experiments with Heuristic Methods,' Journal of Heuristics, Vol.1, No.1(1995), pp.9-32 https://doi.org/10.1007/BF02430363
  3. Cario, M.C., J.J. Clifford, R.R. Hill, J. Yang, K. Yang, and C.H. Reilly, 'An Investigation of the Relationship between Problem Characteristics and Algorithm Performance：a Case Study of the GAP,' IIE Transactions, Vol.34, No.3(2002), pp.297-312
  4. Fayard, D. and G. Plateau, 'An Algorithm for the Solution of the 0-1 Knapsack Problem,' Computing, Vol.28(1982), pp.269-287 https://doi.org/10.1007/BF02241754
  5. Hooker, J.N., 'Needed：an Empirical Science of Algorithms,' Operations Research, Vol.42, No.2(1994), pp.201-212 https://doi.org/10.1287/opre.42.2.201
  6. Hooker, J.N., 'Testing Heuristics; We Have It All Wrong,' Journal of Heuristics, Vol.1, No.1(1995), pp.33-32 https://doi.org/10.1007/BF02430364
  7. Hill, R.R. and C.H. Reilly, 'The Effect of Coefficient Correlation Structure in Two- Dimensional Knapsack Problems on Solution Procedure Performance,' Operations Research, Vol.46, No.2(2000), pp.302-317
  8. Martello, S. and P. Toth, 'Algorithms for the Solution of the 0-1 Single Knapsack Problem,' Computing, Vol.21(1978), pp.81- 86 https://doi.org/10.1007/BF02252196
  9. Martello, S. and P. Toth, 'Algorithms for Knapsack Problems,' Surveys in Combinatorial Optimization, pp.213-257, Elsevier Science Publishers B.V., Amsterdam, Netherlands, 1979
  10. Martello, S. and P. Toth, 'The 0-1 Knapsack Problem,' Combinatorial Optimization, eds. N. Christofides, A. Mingozzi, C. Sandi, pp.237-279, John Wiley and Sons, New York, New York, 1979
  11. Martello, S. and P. Toth, 'A New Algorithm for the 0-1 Knapsack Problem,' Management Science, Vol.35, No.5(1988), pp.633- 644
  12. Martello, S. and P. Toth, 'An Exact Algorithm for Large Unbounded Knapsack Problems,' Operations Research Letters, Vol.35, No.9(1990), pp.15-20
  13. Martello, S., D. Pisinger, and P. Toth, 'Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem,' Management Science, Vol.45, No.3(1999), pp.414-424 https://doi.org/10.1287/mnsc.45.3.414
  14. Martello, S., D. Pisinger, and P. Toth, 'New trends in exact algorithms for the 0-1 Knapsack Problem,' European Journal of Operational Research, Vol.123(2000), pp.325-332 https://doi.org/10.1016/S0377-2217(99)00260-X
  15. Moore, B.A., 'Correlated 0-1 Knapsack Problems,' IND ENG 854 Course Project, Department of Industrial and Systems Engineering, The Ohio State University, Columbus, Ohio, 1989
  16. Moore, B.A., 'The Effect of Correlation on Exact and Heuristic Procedures for the Weighted Set Covering Problem,' M.S. Thesis, Department of Industrial and Systems Engineering, The Ohio State University, Columbus, Ohio, 1990
  17. Moore, B.A., J.A. Peterson, and C.H. Reilly, 'Characterizing Distributions of Discrete Bivariate Random Variables for Simulation and Evaluation of Solution Methods,' Proceedings of the 1990 Winter Simulation Conference, eds. O. Baci, R.P. Sadowski, R.E. Nance, pp.294-302, Institute of Electrical and Electronics Engineers, New Orleans, Louisiana, 1990
  18. Moore, B.A. and C.H. Reilly, 'Randomly Generating Optimization Test Problems with Controlled Correlation,' Working Paper 1992- 001, Department of Industrial and Systems Engineering, The Ohio State University, Columbus, Ohio, 1992
  19. Moore, B.A. and C.H. Reilly, 'Randomly Generating Synthetic Optimization Problems with Explicitly Induced Correlation,' Working Paper 1993-002, Department of Industrial and Systems Engineering, The Ohio State University, Columbus, Ohio, 1993
  20. Nauss, R.M., 'An Efficient Algorithm for the 0-1 Knapsack Problem,' Management Science, Vol.23, No.1(1976), pp.27-31 https://doi.org/10.1287/mnsc.23.1.27
  21. Nemhauser, G.L. and L.A. Wolsey, Integer and Combinatorial Optimization, Wiley and Sons, New York, New York, 1988
  22. Peterson, J.A., 'A Parametric Analysis of a Bottleneck Transportation Problem Applied to the Characterization of Correlated Discrete Bivariate Random Variables,' M.S. Thesis, Department of Industrial and Systems Engineering, The Ohio State University, Columbus, Ohio, 1990
  23. Peterson, J.A. and C.H. Reilly, 'Joint Probability Mass Functions for Coefficients in Synthetic Optimization Problems,' Working Paper 1993-006, Department of Industrial and Systems Engineering, The Ohio State University, Columbus, Ohio, 1993
  24. Pisinger, D., 'A minimal algorithm for the 0-1 Knapsack Problem,' Operations Research, Vol.45, No.5(1997), pp.758-767 https://doi.org/10.1287/opre.45.5.758
  25. Reilly, C.H., 'Optimization Test Problems with Uniformly Distributed Coefficients,' Proceedings of the 1991 Winter Simulation Conference, eds. B.L. Nelson, W.D. Kelton, G.M. Clark, pp.866-874, Institute of Electrical and Electronics Engineers, Phoenix, Arizona, 1991
  26. Reilly, C.H., 'Comparison of Alternative Input Models for Synthetic Optimization Problems,' Proceedings of the 1993 Winter Simulation Conference, eds. G.W. Evans, M. Mollaghasemi, E.C. Russel, W.E. Biles, pp. 356-364, Institute of Electrical and Electronics Engineers, Los Angeles, California, 1993
  27. Reilly, C.H., 'Alternative Input Models for Generating Synthetic Optimization Problems： Analysis and Implication,' Working Paper 1994-001, Department of Industrial and Systems Engineering, The Ohio State University, Columbus, Ohio, 1994
  28. Reilly, C.H., 'Optimization Test Problems With Uniformly Distributed Coefficients,' Proceedings of the 1999 Winter Simulation Conference, eds. P.A. Farrington, H.B. Nembhard, D.T. Strurrock, and G.E. Evans, pp.116-121, Institute of Electrical and Electronics Engineers, Phoenix, Arizona, 1999
  29. Rushmeier, R.A. and G.L. Nemhauser, 'Experiments with Parallel Branch-and-Bound Algorithms for the Set Covering Problem,' Operations Research Letters, Vol.13, No.5 (1993), pp.277-285 https://doi.org/10.1016/0167-6377(93)90050-Q
  30. Sahni, S., 'Approximate Algorithms for the 0/1 Knapsack Problem,' Journal of the Association for Computing Machinery, Vol. 22, No.1(1975), pp.115-124 https://doi.org/10.1145/321864.321873