Skip to Main Content
Table 2:
Common deterministic heuristics from the literature for solving 1D bin-packing problems.
HeuristicAcronymSummary
First fit descending FFD Packs each item into the first bin that will accommodate it. If no bin is available, then a new bin is opened. 
Djang and Finch (Djang and Finch, 1998) DJD Packs items into a bin until it is at least one-third full. The set of up to three items which best fills the remaining space is then found with preference given to sets with the lowest cardinality. The bin is then closed and the procedure repeats using a new bin. 
DJD more tuples (Ross et al., 2002) DJT Works as for DJD but considers sets of up to five items after the bin is filled more than one-third full. 
Adaptive DJD (Sim et al., 2012) ADJD Packs items into a bin until the free space is less than or equal to three times the average size of the remaining items. It then operates as for DJD. 
HeuristicAcronymSummary
First fit descending FFD Packs each item into the first bin that will accommodate it. If no bin is available, then a new bin is opened. 
Djang and Finch (Djang and Finch, 1998) DJD Packs items into a bin until it is at least one-third full. The set of up to three items which best fills the remaining space is then found with preference given to sets with the lowest cardinality. The bin is then closed and the procedure repeats using a new bin. 
DJD more tuples (Ross et al., 2002) DJT Works as for DJD but considers sets of up to five items after the bin is filled more than one-third full. 
Adaptive DJD (Sim et al., 2012) ADJD Packs items into a bin until the free space is less than or equal to three times the average size of the remaining items. It then operates as for DJD. 
Close Modal

or Create an Account

Close Modal
Close Modal