Solving bin packing problem based on parallel hybrid genetic algorithm
[ X ]
Tarih
2022
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Altınbaş Üniversitesi / Lisansüstü Eğitim Enstitüsü
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
The use of heuristic search is essential to the field of artificial intelligence and is required in
order to find solutions to problems that arise in knowledge-based operations. The purpose of the
Bin Packing Problem (BPP) is to identify the fewest number of boxes that are necessary to
package a group of items of specified sizes into a given collection of bins without exceeding the
capacity of any individual bin. It is well acknowledged that NP-Hard problem. In this study, we
present a hybrid genetic algorithm that employs BFD in order to deal with infeasible solution
sets brought about by the bin-used format (Best Fit Decreasing). We discussed our experiences
developing parallel solutions to the (BPP). Investigation into alternative bin packing strategies is
being done in order to have a better grasp of the challenges associated with resource allocation.as
well as the different ways that different packing algorithms affect the effectiveness of packing.
The apparent serial nature of packing bins has been modelled, and this modelling has prevented
past studies from growing beyond their limits of many thousands of containers. We demonstrate
this with data that is not very complicated. It is not impossible for parallel algorithms to achieve
linear speedup. Simulations of up to hundreds of sizes for a wide range of characteristics have
been simulated, along with thousands of bins and heuristics, our approach to dealing with impossible chromosomes was shown to be effective by experimental data, which helped to raise
the bar. Academics have found that the behaviours of the bin packing problem are highly
complex, despite the fact that it initially presents itself as an easy problem to solve by
coordinating the measurements of the object's length, height, or width with those of the available
packing space., the planned packing method aims to reduce the number of boxes voids produced
during the packing process. In order to come up with this packing strategy, HGA was used to
solve the problem. The findings of the technique that was suggested were reviewed and then
compared to multiple sets of Arithmetic results identified in academic journals that were related
to the answer that was reached. In the classic boxing problem, you are tasked with fitting a
predetermined quantity of objects into a set of containers that are all of the same size. This is
done to cut down on the number of boxes that need to be used and to make sure that the total size
of the things inside each box doesn't go over the box's capacity.
Açıklama
Anahtar Kelimeler
Genetic Algorithm, Bin Backing Problem, Parallel Strategy, Three-Dimensional Bin Packing, HGA, DBPL
Kaynak
WoS Q Değeri
Scopus Q Değeri
Cilt
Sayı
Künye
Abdulkareem, Mohammed Husham. (2022). Solving bin packing problem based on parallel hybrid genetic algorithm. (Yayınlanmamış yüksek lisans tezi). Altınbaş Üniversitesi, Lisansüstü Eğitim Enstitüsü, İstanbul.
