Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Heuristic Solution of Open Bin Packing Problems
Journal of Heuristics
A Hybrid Genetic Algorithm for Highly Constrained Timetabling Problems
Proceedings of the 6th International Conference on Genetic Algorithms
The Three-Dimensional Bin Packing Problem
Operations Research
The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
IEEE Transactions on Computers
An algorithm for optimal two-dimensional compaction of VLSI layouts
Integration, the VLSI Journal
Ant Colony Optimisation solution to distribution transformer planning problem
International Journal of Advanced Intelligence Paradigms
Dynamic multi-dimensional bin packing
Journal of Discrete Algorithms
Resource awareness in computational intelligence
International Journal of Advanced Intelligence Paradigms
Efficient algorithms for real-life instances of the variable size bin packing problem
Computers and Operations Research
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A new lower bound for the non-oriented two-dimensional bin-packing problem
Operations Research Letters
A new variable-sized bin packing problem
Journal of Scheduling
| Hi-index | 0.00 |
Packing problems are in general NP-hard, even for simple cases. Since now there are no highly efficient algorithms available for solving packing problems. The two-dimensional bin packing problem is about packing all given rectangular items, into a minimum size rectangular bin, without overlapping. The restriction is that the items cannot be rotated. The current paper is comparing a greedy algorithm with a hybrid genetic algorithm in order to see which technique is better for the given problem. The algorithms are tested on different sizes data.