Article

Article title HYBRID PARALLEL GROUPING GENETIC ALGORITHM FOR SOLVING THE BIN PACKING PROBLEM
Authors R.V. Potarusov
Section SECTION I. EVOLUTIONARY MODELING, GENETIC AND BIONIC ALGORITHMS
Month, Year 04, 2008 @en
Index UDC 519.8
DOI
Abstract This paper is related to the Bin Packing Problem (BPP). In the work presented here, a hybrid parallel grouping genetic algorithm (HPGGA) for solving BPP is proposed. It is shown that the HPGGA approach can obtain BPP solutions of the same quality as the most known and the best to date existing solution methods for solving considered problem.

Download PDF

Keywords Bin packing, genetic algorithms, optimization.
References 1. S. Martello, P. Toth. Knapsacks problems: algorithms and computer implementations. Chichester/England: John Wiley and sons Ltd, 1990.
2. Емельянов В.В., Курейчик В.В., Курейчик В.М. Теория и практика эволюционного моделирования. – М.: Физматлит, 2003.
3. E. Falkenauer. Genetic Algorithms and Grouping Problems, Wiley, Chichester, 1998.
4. Гладков Л.А., Курейчик В.В., Курейчик В.М. Генетические алгоритмы: Учебное пособие. Под ред. В.М. Курейчика. – Ростов-на-Дону: ООО «Ростиздат», 2004. – 400 с.
5. A.R Brown. Optimal Packing and Depletion. American Elsevier, New York, 1971.
6. Потарусов Р.В., Курейчик В.М. Проблема одномерной упаковки элементов // Известия ТРТУ. – 2006. – №8(63). – С. 88-93.
7. Потарусов Р.В., Курейчик В.М. Модифицированные генетические алгоритмы // Сборник
трудов международной научно-практической конференции «Интегрированные модели и
мягкие вычисления в искусственном интеллекте», 28-30 мая, Коломна, 2007.
8. J. Levine, F. Ducatelle. Ant Colony Optimization and Local Search for Bin Packing and Cut-
ting Stock Problems. - Centre for Intelligent Systems and their Applications, School of Infor-
matics, University of Edinburgh, 2003.
9. E. Falkenauer. A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics,
2:5–30, 1996.
10. C. Reeves. Hybrid genetic algorithms for bin-packing and related problems. Annals of Opera-
tions Research, 63:371–396, 1996.
11. M. Vink. Solving combinatorial problems using evolutionary algorithms, 1997. Available from
http://citeseer.nj.nec.com/vink97solving.html.
12. F. Vanderbeck. Computational study of a column generation algorithm for bin-packing and
cutting stock problems, Math. Programming A 86(1999) 565–594.
13. R. Potarusov, V. Kureychik, G. Goncalves, H. Allaoui. Solving the Bin Packing Problem with
Algorithm of Genetic Search with Migration // Сборник трудов Международных научно-
технических конференций «AIS’07», «CAD’07». – М.: Физматлит, 2007, – С. 34-45.

Comments are closed.