Heuristic placement routines for two-dimensional bin packing problem.
Problem 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 wher...
Saved in:
Main Authors: | Wong, L., Lee, Lai Soon |
---|---|
Format: | Article |
Language: | English English |
Published: |
Science Publications
2009
|
Online Access: | http://psasir.upm.edu.my/id/eprint/14998/1/Heuristic%20placement%20routines%20for%20two.pdf http://psasir.upm.edu.my/id/eprint/14998/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Heuristic Placement Routines For Two-Dimensional Rectangular Bin Packing Problems
by: Wong, Lily
Published: (2009) -
Heuristic for oriented two-dimensional bin packing problem
by: Wong, Lily, et al.
Published: (2009) -
A Genetic Algorithm for Two-Dimensional Bin Packing Problem
by: Lee, Lai Soon
Published: (2008) -
A modified partially mapped multiCrossover genetic algorithm for Two-Dimensional Bin Packing Problem
by: Sarabian, Maryam, et al.
Published: (2010) -
A genetic algorithm for two-dimensional bin packing with due dates
by: Bennell, Julia A., et al.
Published: (2013)