By Topic

Better-Fit Heuristic for One-Dimensional Bin-Packing Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
A. K. Bhatia ; National Bureau of Animal Genetic Resources Karnal-132001 (India) Email: avnish@lycos.com ; M. Hazra ; S. K. Basu

This paper reports a study on better-fit heuristic for classical bin-packing problem, proposed in [1]. Better-fit replaces an existing object from a bin with the next object in the list, if it can fill the bin better than the object replaced. It takes O(n2m) time where n is the number of objects and m is the number of distinct object sizes in the list. It behaves as off-line as well as on-line heuristic with the condition of permanent assignment of objects to a bin removed. Experiments have been conducted on representative problem instances in terms of expected waste rates. It outperforms off-line best-fit-decreasing heuristic on most of the instances. It always performs better than the on-line best-fit heuristic.

Published in:

Advance Computing Conference, 2009. IACC 2009. IEEE International

Date of Conference:

6-7 March 2009