15th International Conference on Electronics, Communications and Computers (CONIELECOMP'05)
DOI: 10.1109/coniel.2005.25
|View full text |Cite
|
Sign up to set email alerts
|

Bin-Packing Using Genetic Algorithms

Abstract: We present in this paper a genetic algorithm (GA) approach to solve 2-D bin packing problems of polygonal shapes on a rectangular canvas. We present how to encode shape parameters and a fitness function based on a the medial axis transform (MAT) to evaluate individuals of a genetic algorithm population. Some test and results of our experimentation are presented.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…There are many heuristics for this problem [22][23][24][25] because there does not exist an exact algorithm to solve it for its complexity. This is the reason to try to apply the metaheuristics [26][27][28], because it looks for a better result than the one obtained by heuristics.…”
Section: Introductionmentioning
confidence: 97%
“…There are many heuristics for this problem [22][23][24][25] because there does not exist an exact algorithm to solve it for its complexity. This is the reason to try to apply the metaheuristics [26][27][28], because it looks for a better result than the one obtained by heuristics.…”
Section: Introductionmentioning
confidence: 97%
“…This is an NP-Hard Problem [1] and due to its complexity many heuristics have been developed attempting to give an approximation [15][16][17][18][19]. Some metaheuristics have also been applied to try to obtain better results than those obtained by heuristics [20][21][22]. Some exact algorithms have been developed [23][24][25]; however, given the nature of the problem the time reported by these algorithms grows up and depending on the instance the time may grow up exponentially.…”
Section: Introductionmentioning
confidence: 99%