Journals / Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi / 2010 / Cilt: 25 - Sayı: 4

Ant colony optimization approach for container loading problems

Konteyner yükleme problemleri için karınca kolonisi optimizasyonu yaklaşımı

Pages
881–894
Publication Date
2022-10-18
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)

Having determined the parameters with the factorialdesign, the performance of the proposed algorithms is tested with the standard test cases in the literature and theresults are discussed comparatively with reference to the other works in the literature.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:The importance of reducing the cost of container shipping as well as related transportation cost is graduallyincreasing with the internationalization of supply chains.
📊
Key Findings & Data:There is no doubt that one of the potential ways ofreducing these costs is the better utilization from the container volumes.
💡
Conclusion & Impact:Having determined the parameters with the factorialdesign, the performance of the proposed algorithms is tested with the standard test cases in the literature and theresults are discussed comparatively with reference to the other works in the literature.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

The importance of reducing the cost of container shipping as well as related transportation cost is graduallyincreasing with the internationalization of supply chains. There is no doubt that one of the potential ways ofreducing these costs is the better utilization from the container volumes. Therefore, NP-hard container loadingproblems attracts the attention of many researchers. In this study, two algorithms for the container loadingproblems based on ant colony optimization are suggested. Having determined the parameters with the factorialdesign, the performance of the proposed algorithms is tested with the standard test cases in the literature and theresults are discussed comparatively with reference to the other works in the literature.

Özet

Tedarik zincirlerinin uluslararası bir boyut kazandığı günümüzde, konteyner taşımacılığının ve ilgili taşımamaliyetlerinin düşürülmesinin önemi giderek artmaktadır. Bahsi geçen konuda maliyeti düşürmenin yollarındanbirisi de hiç kuşkusuz mevcut konteyner hacimlerinden daha iyi faydalanmaktır. Bu nedenle, NP-zor konteyneryükleme problemleri birçok araştırmacının ilgisini çekmektedir. Bu çalışmada, konteyner yükleme problemleriiçin karınca kolonisi optimizasyonu yaklaşımını temel alan iki yeni algoritma önerilmiştir. Parametrelerifaktöriyel tasarım ile belirlenen bu algoritmaların performansları literatürde verilen standart problemler için testedilmiş ve sonuçlar literatürdeki diğer çalışmalar ile mukayese edilerek irdelenmiştir.

🔖

Cite This Article

DAŞ, G. S., DERELİ, T. (2022). Ant colony optimization approach for container loading problems. Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi, Cilt: 25 - Sayı: 4, 881–894. https://ajindex.com/articles/523779

📄 Full Text PDF Viewer

📄

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

References (17)

  1. van de Voort, M., O'Brien, K.A., Rahman, A., Valeri, L. Seacurity: Improving the Security of the Global Sea-Container Shipping System, Rand., 2003
  2. Dereli, T., Das, G.S. “A hybrid simulated annealing algorithm for solving multi-objective container loading problems”, Applied Artificial Intelligence, 24, 463-486, 2010
  3. Dereli, T., Daş, G.S. “A hybrid simulated annealing algorithm for two-dimensional strip packing problems”. Adaptive and Natural Computing Algorithms, Part 1, 4431, 508-516, 2007
  4. Morabito, R.N., Arenales, M.N. “An and-or graph approach to the container loading problem.” International Transactions in Operational Research, 1, 59-73, 1994
  5. Eley, M. “Solving container loading problems by block arrangement.” European Journal of Operational Research, 141, 393-409, 2002
  6. Lim, Rodrigues, B., Yang, Y. “3-D Container packing heuristic.” Applied Intelligence, 22, 125-134, 2005
  7. Wang, Z., Li, K.W., Levy, J.K. “A heuristic for the container loading problem: A tertiary-tree- based dynamic space decomposition approach.” European Journal of Operational Research, 191, 86–99, 2008
  8. George, J.A., Robinson, D.F. “A heuristic for packing boxes into a container.” Computers and Operations Research, 7, 147-156, 1980
  9. Bischoff E.E., Marriott M.D. “A comparative evaluation of heuristics for container loading”, European Journal of Operational Research, 44, 267-276, 1990
  10. Gehring, H., Menschner, K., Meyer, M.A. “Computer-based heuristic for packing pooled shipment containers”, European Journal of Operational Research, 44, 277-288, 1990
  11. Haessler, R.W., Talbot, F.B. “Load planning for shipments of low density products”, European Journal of Operational Research, 44, 289-299, 1990
  12. Ngoi, B.K.A., Tay, M.L., Chua, E.S., “Applying spatial representation techniques to the container packing problem”, International Journal of Production Research, 32/1, 111-123, 1994
  13. Pisinger, D. “Heuristics for the container loading problem”, European Journal of Operational Research, 141, 382-392, 2002
  14. Bortfeldt, A., Gehring, H., Mack, D. “A parallel tabu search algorithm for solving the container loading problem”. Parallel Computing, 29, 641- 662, 2003
  15. Moura, A., Oliveira J. “A grasp approach to the container-loading problem”. IEEE Intelligent Systems, 50-57, 2005
  16. Huang, W., He, K. “A caving degree approach for the single container loading problem”. European Journal of Operational Research, 196, 93–101, 2009
  17. Gehring, H., Bortfeldt,