Scholars Central

Research articlePublished Aug 2014

A NOVEL GRAPH BASED ALGORITHM FOR ONE DIMENSIONAL BIN PACKING PROBLEM

Authors: Debajit Sensarma, Samar Sen Sarma

Journal of Global Research in Computer Sciences

Volume 5 · Issue 8 · Pages 1–4

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

The Bin Packing Problem (BPP) is one of the most known combinatorial optimization problems. The main objective of the problem is to minimize the number of bins used and pack the items with different sizes in finite number of bins efficiently. This paper introduces a new graph based algorithm for one dimensional bin packing problem. The proposed algorithm is implemented and tested with the well known benchmark instances and a comparison with existing First-Fit Decreasing (FFD) algorithm is given with respect to number of bins and waste space. In most of the cases the new algorithm produces near optimal solutions and performs better than FFD.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Journal of Global Research in Computer Sciences.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalJournal of Global Research in Computer Sciences
  • SubjectComputer Science & IT
  • BylineArticles whose byline prints “Debajit Sensarma”
  • BylineArticles whose byline prints “Samar Sen Sarma”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels