论文信息 - Average-Case Analysis of the Smart Next Fit Algorithm

Average-Case Analysis of the Smart Next Fit Algorithm

In this paper, we present the Smart Next Fit algorithm for on-line bin packing, which is obtained by slightly modifying the Next Fit algorithm. For any list of items, this algorithm uses the smallest number of bins among all on-line algorithms that have only one active bin at any time. We analyze its average-case performance when the item sizes are uniformly distributed over [0,b],b ⩽ 1. For b⩽12, the Smart Next Fit algorithm behaves exactly like the Next Fit algorithm. For 12 <b ⩽ 1, its average-case performance is significantly better than that of Next Fit. For b = 1, its average-case performance rate is 1.2274113…, compared to 1.333… for Next Fit. Its average-case performance is better than that of any known constant-space algorithm.

Prakash V. Ramanan

[1] D. T. Lee,et al. A simple on-line bin-packing algorithm , 1985, JACM.

[2] D. T. Lee,et al. On-Line Bin Packing in Linear Time , 1989, J. Algorithms.

[3] Micha Hofri,et al. A Stochastic Model of Bin-Packing , 1980, Inf. Control..

[4] David S. Johnson,et al. Approximation Algorithms for Bin-Packing — An Updated Survey , 1984 .

[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6] Greg N. Frederickson,et al. Probabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms , 1980, Inf. Process. Lett..

[7] Micha Hofri,et al. Probabilistic Analysis of Algorithms , 1987, Texts and Monographs in Computer Science.

[8] David S. Johnson,et al. Near-optimal bin packing algorithms , 1973 .

[9] Jeffrey D. Ullman,et al. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[10] Frank Thomson Leighton,et al. Some unexpected expected behavior results for bin packing , 1984, STOC '84.

[11] Richard M. Karp,et al. An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[12] N. Karmarkar. Probabilistic analysis of some bin-packing problems , 1982, FOCS 1982.

[13] Kazuhiro Tsuga,et al. Average-Case Analysis of the Modified Marmonic Algorithm , 1986, FSTTCS.