Journals / Mehmet Akif Ersoy Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi / 2018 / Cilt: 5 - Sayı: 3

SOLUTION OF BIN PACKING PROBLEM WITH WEIGHTED ANNEALING METHOD BASED ON LOWER BOUND

ALT SINIR TEMELİNE DAYALI AĞIRLIKLI TAVLAMA YÖNTEMİ İLE KUTULAMA PROBLEMİNİN ÇÖZÜMÜ

Pages
549–567
Publication Date
2018-12-27
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

It has also been observed that in 2 samples of the solved test set a better solution is obtained than the best known solution in the literature.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In this study, a heuristic solution method is presented for one dimensional bin packing problem.
📊
Key Findings & Data:A heuristic initial solution algorithm based on the lower bound is proposed to create the initial solution.
💡
Conclusion & Impact:It has also been observed that in 2 samples of the solved test set a better solution is obtained than the best known solution in the literature.
🔬Design:Research Article
📍Scope:2 samples
⚙️Variables:Kutulama Problemi · Ağırlıklı Tavlama · Bin Packing Problem

Abstract

In this study, a heuristic solution method is presented for one dimensional bin packing problem. A heuristic initial solution algorithm based on the lower bound is proposed to create the initial solution. In addition to the proposed heuristics, other placement algorithms in the literature are discussed, and the results obtained are compared with the results obtained in the literature. Swap algorithms together with weighted annealing method are applied to the results of the initial solutions, and the number of bins used are minimized. The test sets in the literature are solved, the resolution times and the results obtained are compared with the best known solution in the literature and other developed methods. It has been observed that the heuristic method proposed in the literature compares with the solution in a shorter time. It has also been observed that in 2 samples of the solved test set a better solution is obtained than the best known solution in the literature.

Özet

Bu çalışmada bir boyutlu kutulama problemi için melez yeni bir sezgisel çözüm yöntemi sunulmuştur. Önerilen yaklaşımda, başlangıç çözümü oluşturmak için alt sınıra dayalı sezgisel bir başlangıç çözüm algoritması önerilmiştir. Önerilen sezgisel ile birlikte literatürde yer alan diğer yerleştirme algoritmaları ele alınmış, elde edilen sonuçlar literatürde ulaşılan sonuçlarla karşılaştırılmıştır. Başlangıç çözümü sonrası elde edilen çözüme ağırlıklı tavlama yöntemiyle birlikte yer değiştirme algoritmaları uygulanmış ve kullanılan kutu sayısını minimize etmek amaçlanmıştır. Literatürde yer alan test kümeleri çözülmüş, çözüm süreleri ve elde edilen sonuçlar bilinen en iyi sonuçlarla ve geliştirilen diğer yöntemlerle karşılaştırılmıştır. Literatür ile yapılan karşılaştırmalarda önerilen sezgisel yöntemin daha kısa sürede çözüme ulaştığı gözlemlenmiştir. Ayrıca çözülen test kümesinin 2 örneğinde literatürdeki en iyi bilinen çözümden daha iyi bir çözüm elde edildiği gözlemlenmiştir.

🔖

Cite This Article

İNAK, N., TOKAT, S., KARAGÜL, K. (2018). SOLUTION OF BIN PACKING PROBLEM WITH WEIGHTED ANNEALING METHOD BASED ON LOWER BOUND. Mehmet Akif Ersoy Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi, Cilt: 5 - Sayı: 3, 549–567. https://ajindex.com/articles/87516

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (14)

  1. Alvim, A. C. E., Ribeiro, C. C., Glover, F., & Aloise, D. (2001). A hybrid improvement heuristic for the one-dimensional bin packing problem. In In Extended Abstracts of the 4th Metaheuristics International Conference (pp. 63–68).
  2. Alvim, A. C. F., Glover, F., & Aloise, J. J. (2004). A hybrid improvement heuristic for the one-dimensional bin packing problem. Journal of Heuristics, 10, 205–229.
  3. Aydın, İ.(2013). Tavlama Benzetimi Algoritması (Simulated Annealing), Fırat Üniversitesi,
  4. Fen Bilimleri Enstitüsü, Endüstri Mühendisliği Anabilim Dalı. Beasley, J. (1990). OR-Library. Retrieved April 6, 2016, from http://people.brunel.ac.uk/~mastjjb/jeb/orlib/binpackinfo.html
  5. Beisiegel, B., Kallrath, J., Kochetov, Y., & Rudnev, A. (2005). Simulated annealing based algorithm for the 2D bin packing problem with impurities. Operations Research Proceedings 2005.
  6. Bhatia, A. K., & Basu, S. K. (2004). Packing bins using multi-chromosomal genetic representation and better fit heuristic. Lecture Notes in Computer Science, 181–186. Brandão, F. (n.d.). Arc-flow Formulation (w/ graph compression) Results. Retrieved from http://www.dcc.fc.up.pt/~fdabrandao/
  7. Caprara, A., & Pferschy, U. (2004). Worst-case analysis of the subset sum algorithm for bin packing. Operations Research Letters, 32(2), 159–166.
  8. Caprara, A., & Pferschy, U. (2005). Modified subset sum heuristics for bin packing. Information Processing Letters, 96(1), 18–23.
  9. Carvelho, J. M. V. (1999). Exact solutions of bin-packing problems using column generation and branch and bound. Annals of Operations Research, 86, 629 – 659. Coffman, Garey, M., & Johnson, D. (1997). Approximation algorithms for bin packing problems: A survey. PWS Publishing, Boston, Massachusetts. Dantzig, G. B., & Philip, W. (1960). Decomposition principle for linear programs. Operations Research, 8(1), 101–111.
  10. Delorme, M., Iori, M., & Martello, S. (2016). Bin packing and cutting stock problems: Mathematical models and exact algorithms. European Journal of Operational Research, 255(1). Eilon, S., & Christofides, N. (1971). The loading problem. Manag Ement Science, 259–268.
  11. Elidan, G., Ninio, M., & Friedman, N. (2002). Data perturbation for escaping local maxima in learning. AAAI/IAAI, 132–139.
  12. Ensari, M. (2007). Konteynır yükleme problemine sezgisel bir yaklaşım. Gazi Üniversitesi.
  13. Falkenauer, E. (1996). A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics, 2, 5–30.
  14. Fekete, S. P., & Schepers, J. (2001). New classes of fast