SURVEY ON BIN PACKING PROBLEM

Authors

  • Suman Sahu Department of Computer Science and Engineering, RITEE Raipur (C.G.)
  • Asst.Prof. Prabhakar Sharma Department of Computer Science and Engineering, RITEE Raipur (C.G.)

Keywords:

best fit algorithms, first fit algorithm, best fit decresing algorithms, first fit decresing algorithm ,map reduce algorithms,Martello and Toth algorithms ,particle swarm optimization algorithms and Genetic Algorithm

Abstract

Bin Packing Problem (BPP) is one of the NP-Hard optimization problems. The bin packing problem aims
to pack a set of items in a minimum number of bins, with respect to the size of the items and capacity of the bins.BPP
has many important applications such as multiprocessor scheduling, resource allocation,transportation planning,
Container Loading, Cargo Airplanes and Ships ,real-world planning, and packing and scheduling optimization
problems.In this paper, best fit algorithms, first fit algorithm, best fit decresing algorithms, first fit decresing
algorithm ,map reduce algorithms,Martello and Toth algorithms ,particle swarm optimization algorithms and Genetic
Algorithm are analyzed deeply. This research paper presents the thorough survey of algorithms for optimize Bin
Packing problem .

Downloads

Published

2016-11-25

How to Cite

Suman Sahu, & Asst.Prof. Prabhakar Sharma. (2016). SURVEY ON BIN PACKING PROBLEM . International Journal of Advance Research in Engineering, Science & Technology, 3(11), 108–114. Retrieved from https://ijarest.org/index.php/ijarest/article/view/1110

Issue

Vol. 3 No. 11 (2016): Volume: 03, Issue: 11 - November, 2016.

Section

Articles