The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance

This paper presents the results of an empirical study of the effects of coefficient correlation structure and constraint slackness settings on the performance of solution procedures on synthetic two-dimensional knapsack problems (2KP). The population correlation structure among 2KP coefficients, the level of constraint slackness, and the type of correlation (product moment or rank) are varied in this study. Representative branch-and-bound and heuristic solution procedures are used to investigate the influence of these problem parameters on solution procedure performance. Population correlation structure, and in particular the interconstraint component of the correlation structure, is found to be a significant factor influencing the performance of both the algorithm and the heuristic. In addition, the interaction between constraint slackness and population correlation structure is found to influence solution procedure performance.

[1]  Y. Toyoda.  A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems , 1975 .

[2]  Charles H. Reilly.  Optimization test problems with uniformly distributed coefficients , 1991, 1991 Winter Simulation Conference Proceedings..

[3]  Thuruthickara C. John.  Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty , 1989, Comput. Oper. Res..

[4]  Raymond R. Hill.  An analytical comparison of optimization problem generation methodologies , 1998, 1998 Winter Simulation Conference. Proceedings (Cat. No.98CH36274).

[5]  L. V. Wassenhove,et al.  Algorithms for scheduling a single machine to minimize the weighted number of late jobs , 1988 .

[6]  Charles H. Reilly,et al.  Characterizing distributions of discrete bivariate random variables for simulation and evaluation of solution methods , 1990, 1990 Winter Simulation Conference Proceedings.

[7]  Fred W. Glover,et al.  Solving zero-one mixed integer programming problems using tabu search , 1998, European Journal of Operational Research.

[8]  Richard Loulou,et al.  New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem , 1979, Oper. Res..

[9]  A. Frieze,et al.  Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analyses , 1984 .

[10]  Arnaud Fréville,et al.  The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool , 1996, J. Heuristics.

[11]  Charles H. Reilly,et al.  Properties of synthetic optimization problems , 1998, 1998 Winter Simulation Conference. Proceedings (Cat. No.98CH36274).

[12]  Stelios H. Zanakis,et al.  Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods , 1977 .

[13]  M. Fisher,et al.  A multiplier adjustment method for the generalized assignment problem , 1986 .

[14]  Charles H. Reilly,et al.  Composition for multivariate random variables , 1994, Proceedings of Winter Simulation Conference.

[15]  Hasan Pirkul,et al.  A heuristic solution procedure for the multiconstraint zero‐one knapsack problem , 1987 .

[16]  R. Iman,et al.  A distribution-free approach to inducing rank correlation among input variables , 1982 .

[17]  Joseph B. Mazzola,et al.  An algorithm for the bottleneck generalized assignment problem , 1993, Comput. Oper. Res..

[18]  Saïd Hanafi,et al.  An efficient tabu search approach for the 0-1 multidimensional knapsack problem , 1998, Eur. J. Oper. Res..

[19]  Chris N. Potts,et al.  Single Machine Scheduling to Minimize Total Late Work , 1992, Oper. Res..

[20]  Raymond R. Hill,et al.  Multivariate Sampling with Explicit Correlation Induction for Simulation and Optimization Studies , 1996 .

[21]  C. H. Reilly.  Generating coefficients for optimization test problems with implicit correlation induction , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[22]  Egon Balas,et al.  An Algorithm for Large Zero-One Knapsack Problems , 1980, Oper. Res..

[23]  A. Fréville,et al.  An exact search for the solution of the surrogate dual of the 0–1 bidimensional knapsack problem , 1993 .

[24]  Paolo Toth,et al.  Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems , 1997, Oper. Res..

[25]  John N. Hooker,et al.  Needed: An Empirical Science of Algorithms , 1994, Oper. Res..

[26]  Arnaud Fréville,et al.  An Efficient Preprocessing Procedure for the Multidimensional 0- 1 Knapsack Problem , 1994, Discret. Appl. Math..

[27]  M. Trick.  A Linear Relaxation Heuristic for the Generalized Assignment Problem , 1992 .

[28]  E. Balas,et al.  Pivot and Complement–A Heuristic for 0-1 Programming , 1980 .

[29]  Mohammad M. Amini,et al.  A rigorous computational comparison of alternative solution methods for the generalized assignment problem , 1994 .

[30]  Monique Guignard-Spielberg,et al.  Technical Note - An Improved Dual Based Algorithm for the Generalized Assignment Problem , 1989, Oper. Res..

[31]  S. Martello,et al.  A New Algorithm for the 0-1 Knapsack Problem , 1988 .

[32]  S. Voß,et al.  Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms , 1994 .