3 articles for “Bin packing problem”

Set a search alert

Research ArticleOpen accessPhrase in the titleA Modified Partially Mapped MultiCrossover Genetic Algorithm for Two-Dimensional Bin Packing ProblemM. Sarabian, L.S. LeeProblem statement: Non-oriented case of Two-Dimensional Rectangular Bin Packing Problem (2DRBPP) was studied in this study. The objective of this problem was to pack a given set of small rectangles, which may be rotated by 90°, without overlaps into a minimum numbers of identical large rectangles. Our aim was to improve the performance of the MultiCrossover Genetic Algorithm (MXGA) proposed … …Journal of Mathematics and Statistics, Vol. 6, Issue 2 · 30 Jun 2010 · 8,586 accessesView PDF Cite

Research ArticleOpen accessPhrase in the titleHeuristic Placement Routines for Two-Dimensional Bin Packing ProblemL. Wong, L. S. LeeProblem statement: Cutting and packing (C and P) problems are optimization problems that are concerned in finding a good arrangement of multiple small items into one or more larger objects. Bin packing problem is a type of C AND P problems. Bin packing problem is an important industrial problem where the general objective is to reduce the production costs by … …Journal of Mathematics and Statistics, Vol. 5, Issue 4 · 31 Dec 2009 · 7,701 accessesView PDF Cite

Research ArticleOpen accessIn the abstractServer Optimization Using Heuristic Algorithms for Dynamic-Split-and-Merge Scheme in Wireless MulticastR. Sukumar, V. VasudevanProblem statement: In order to minimize the overall network traffic in a multiserver system, the number of users served by each server (and hence the group size) should remain constant. As the underlying traffic fluctuates, a split and merge scheme is implemented in a physical server to achieve load balancing. Approach: Minimizing the number of servers during the merge operation … …Journal of Computer Science, Vol. 5, Issue 12 · 31 Dec 2009 · 6,811 accessesView PDF Cite