Heuristics methods for solving the block packing problem

DOI

10.2991/itsmssm-16.2016.62How to use a DOI?

Keywords

Optimization problem, bin packing, genetic algorithms, local search

Abstract

In the given paper one-dimensional Bin Packing Problem which plays an important role for the optimization of transportations and production activities is considered. The Hybrid Genetic Algorithm for one-dimensional Bin Packing Problem is proposed. For this purpose two evolution models (de Vries' evolution model and Lamarck's evolution model) have been adapted. Besides, new problem-oriented genetic operators are developed. The main advantage of the suggested approach is that it never decreases the quality of solution so it allows obtaining valid Bin Packing Problem solutions. Two effective local search algorithms allowing to improve of Bin Packing Problem solutions by getting quasi-optimal and optimal packings are proposed. Computational experiments show that a new hybrid approach based on genetic algorithm intended for solving one-dimensional BPP provides approximation and optimal solutions for all benchmarks in-stances in a tolerable computational time as well as demonstrate the robustness of the proposed approach.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Viktor Kureychik
AU  - Vladimir Kureychik
AU  - Liliya Kureychik
AU  - Roman Potarusov
PY  - 2016/05
DA  - 2016/05
TI  - Heuristics methods for solving the block packing problem
BT  - Proceedings of the 2016 Conference on Information Technologies in Science, Management, Social Sphere and Medicine
PB  - Atlantis Press
SP  - 307
EP  - 311
SN  - 2352-538X
UR  - https://doi.org/10.2991/itsmssm-16.2016.62
DO  - 10.2991/itsmssm-16.2016.62
ID  - Kureychik2016/05
ER  -