Bin-packing problem with concave costs of bin utilization

Chung Lun Li; Zhi Long Chen

doi:10.1002/nav.20142

Bin-packing problem with concave costs of bin utilization

Chung Lun Li, Zhi Long Chen

Research output: Journal article publication › Journal article › Academic research › peer-review

26 Citations (Scopus)

Abstract

We consider a generalized one-dimensional bin-packing model where the cost of a bin is a nondecreasing concave function of the utilization of the bin. Four popular heuristics from the literature of the classical bin-packing problem are studied: First Fit (FF), Best Fit (BF), First Fit Decreasing (FFD), and Best Fit Decreasing (BFD). We analyze their worst-case performances when they are applied to our model. The absolute worst-case performance ratio of FF and BF is shown to be exactly 2, and that of FFD and BFD is shown to be exactly 1.5. Computational experiments are also conducted to test the performance of these heuristics.

Original language	English
Pages (from-to)	298-308
Number of pages	11
Journal	Naval Research Logistics
Volume	53
Issue number	4
DOIs	https://doi.org/10.1002/nav.20142
Publication status	Published - 1 Jun 2006

Keywords

Bin packing
Concavity
Worst-case analysis

ASJC Scopus subject areas

Modelling and Simulation
Ocean Engineering
Management Science and Operations Research

More information

10.1002/nav.20142

Cite this

@article{5e587ab98225471f8f59deff50c1e48a,

title = "Bin-packing problem with concave costs of bin utilization",

abstract = "We consider a generalized one-dimensional bin-packing model where the cost of a bin is a nondecreasing concave function of the utilization of the bin. Four popular heuristics from the literature of the classical bin-packing problem are studied: First Fit (FF), Best Fit (BF), First Fit Decreasing (FFD), and Best Fit Decreasing (BFD). We analyze their worst-case performances when they are applied to our model. The absolute worst-case performance ratio of FF and BF is shown to be exactly 2, and that of FFD and BFD is shown to be exactly 1.5. Computational experiments are also conducted to test the performance of these heuristics.",

keywords = "Bin packing, Concavity, Worst-case analysis",

author = "Li, {Chung Lun} and Chen, {Zhi Long}",

year = "2006",

month = jun,

day = "1",

doi = "10.1002/nav.20142",

language = "English",

volume = "53",

pages = "298--308",

journal = "Naval Research Logistics",

issn = "0894-069X",

publisher = "John Wiley & Sons Inc.",

number = "4",

}

TY - JOUR

T1 - Bin-packing problem with concave costs of bin utilization

AU - Li, Chung Lun

AU - Chen, Zhi Long

PY - 2006/6/1

Y1 - 2006/6/1

N2 - We consider a generalized one-dimensional bin-packing model where the cost of a bin is a nondecreasing concave function of the utilization of the bin. Four popular heuristics from the literature of the classical bin-packing problem are studied: First Fit (FF), Best Fit (BF), First Fit Decreasing (FFD), and Best Fit Decreasing (BFD). We analyze their worst-case performances when they are applied to our model. The absolute worst-case performance ratio of FF and BF is shown to be exactly 2, and that of FFD and BFD is shown to be exactly 1.5. Computational experiments are also conducted to test the performance of these heuristics.

AB - We consider a generalized one-dimensional bin-packing model where the cost of a bin is a nondecreasing concave function of the utilization of the bin. Four popular heuristics from the literature of the classical bin-packing problem are studied: First Fit (FF), Best Fit (BF), First Fit Decreasing (FFD), and Best Fit Decreasing (BFD). We analyze their worst-case performances when they are applied to our model. The absolute worst-case performance ratio of FF and BF is shown to be exactly 2, and that of FFD and BFD is shown to be exactly 1.5. Computational experiments are also conducted to test the performance of these heuristics.

KW - Bin packing

KW - Concavity

KW - Worst-case analysis

UR - http://www.scopus.com/inward/record.url?scp=33646267443&partnerID=8YFLogxK

U2 - 10.1002/nav.20142

DO - 10.1002/nav.20142

M3 - Journal article

SN - 0894-069X

VL - 53

SP - 298

EP - 308

JO - Naval Research Logistics

JF - Naval Research Logistics

IS - 4

ER -

Bin-packing problem with concave costs of bin utilization

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this