Comparing several heuristics for a packing problem

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.Comment: 5 figures, 2 tables; accepted: International Journal of Advanced Intelligence Paradigm

A novel hybrid intelligence approach for 2D packing through Internet crowdsourcing

Packing problems on its current state are being utilized for wide area of industrial applications. The aim of present research is to create and implement an intelligent system that tackles the problem of 2D packing of objects inside a 2D container, such that objects do not overlap and the container area is to be maximized. The packing problem becomes easier, when regular/rectangular objects and container are used. In most of the practical situations, the usage of irregular objects comes to existence. To solve the packing problem of irregular objects inside a rectangular container, a hybrid intelligence approach is introduced in our proposed work. The combination of machine intelligence and human intelligence is referred as the hybrid intelligence or semi-automated approach in the proposed methodology. The incorporation of human intelligence in the outcome of machine intelligence is possible to obtain using the internet crowdsourcing as we wish to handle the packing problem through internet crowdsourcing involving rural people. The proposed methodology is tested on different standard data sets and it is observed that it has clear advantage over both manual as well as fully automated heuristic based methods in terms of time and space efficiency

Two-dimensional placement compaction using an evolutionary approach: a study

The placement problem of two-dimensional objects over planar surfaces optimizing given utility functions is a combinatorial optimization problem. Our main drive is that of surveying genetic algorithms and hybrid metaheuristics in terms of final positioning area compaction of the solution. Furthermore, a new hybrid evolutionary approach, combining a genetic algorithm merged with a non-linear compaction method is introduced and compared with referenced literature heuristics using both randomly generated instances and benchmark problems. A wide variety of experiments is made, and the respective results and discussions are presented. Finally, conclusions are drawn, and future research is defined