KONTEYNER YÜKLEME PROBLEMLERİNİN İNCELENMESİ VE LOJİSTİK SEKTÖRÜNDE BİR UYGULAMA

Öz

Günümüzde teknolojinin gelişmesi ve küreselleşme ile artan ticaret hacmi, lojistik operasyonlarının optimizasyonunu zorunlu hale getirmiştir. Bu operasyonları yüksek hızda, yüksek doğrulukta ve düşük maliyetle yürütmek için matematiksel optimizasyon araçları ve modelleri sıklıkla kullanılmaktadır. Konteyner yükleme problemleri, sık karşılaşılan lojistik optimizasyon problemlerinden biridir. Optimum sonuçlara ulaşabilmek için kesin çözüm veren algoritmaların kullanılmasının yanı sıra, büyük boyutlu problemlerin çözümünde kesin algoritmalar yetersiz kalabilmektedir. Bu çalışmada, bir filtre fabrikasının lojistik operasyonları incelenerek, ticari araçların ve konteynerlerin  karmaşık yük ve yükleme planlarının optimizasyonu amaçlanmaktadır. Kutulama algoritmaları, konteyner sayısının azaltılması ve yükleme hızının arttırılması amacıyla geliştirilerek uygun optimal kararların alınmasında kullanılacaktır.

Kaynakça

1. Araújo, E.J., Chaves, A.A., Salles Neto, L.L., Azevedo A.T. Pareto clustering search applied for 3D container ship loading plan problem. Expert Systems with Applications, 2016, 44, 50-57
2. Araya, I., Riff, M.C. A beam search approach to the container loading problem. Computers & Operations Research. 2014, 43, 100-107
3. Bischoff, E.E., Marriott, M.D. A comparative evaluation of heuristics for container loading, European Journal of Operational Research. 1990, 44, 267.
4. Bortfeldt, A., Wäscher, G. Container loading problems-A state of art review. European Journal of Operational Research .2013, 229, 1-20
5. Che, C.H., Huang, W., Lim, A., Zhu, W. The multiple container loading cost minimization problem. European Journal of Operational Research, 2011, 214, 3, 501-511
6. Murat, E., Çanci, M. Lojistik Yönetimi. 4 rd ed.; UTIKAD Yayınları, Istanbul,Turkiye
7. George J.A., Robinson, D.F. A heuristic for packing boxes into a container. Computers and Operations Research, 1980, 7, 147-156.
8. Gonçalves, J.F., Resende, M. G. C. A parallel multi-population biased random- key genetic algorithm for a container loading problem. Computers & Operations Research, 2012, 39, 179-190

9. Ji, M., Guo, W., Zhu, H., Yang, Y. Optimization of loading sequence and rehandling strategy for multi-quay crane operations in container terminals. Transportation Research Part E, 2015, 80, 1-19
10. Junqueira, L., Morabito, R., Yamashita, D.S. Three-dimensional container loading models with cargo stability and load bearing constraints. Computers & Operations Research, 2012, 39, 74-85
11. Kang, K., Moon, I., Wang, H., A hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem. Applied Mathematics and Computation, 2012, 1287–1299
12. Li, X., Zhang, K. A hybrid differential evolution algorithm for multiple container loading problem with heterogeneous containers. Computers & Industrial Engineering, 2015, 90, 305–313
13. Lim, A., Rodriguesb, B, Wang, Y. A multi-faced buildup algorithm for three-dimensional packing problems. Omega ,2003, 31,471–481
14. Lim, A., Ma, H., Xu, J., Zhang, X. An iterated construction approach with dynamic prioritization for solving the container loading problems. Expert Systems with Applications, 2012, 39, 4292-4305
15. Lim, A., Ma, H., Qiu, C., Zhu, W. The single container loading problem with axle weight constraints. International Journal of Production Economics, 2013, 144, 358-369
16. Sheng, L., Tan, W., Xu, Z. Liu, X. A tree search algorithm for the container loading problem. Computers & Industrial Engineering, 2014, 75, 20-30
17. Martello,S., and Toth,P., (1990), “Knapsack problems (PDF)”. Chichester, UK: John Wiley and Sons. p. 221. ISBN 0471924202.
18. Sheikhalishahi, M., Wallece, R.M., Grandinetti L., Poletti J.L.V., Guerriero, F. A multi-dimensional job scheduling. Future Generation Computer Systems, 2016, 75, 123– 131
19. Ramos, G.A., Oliveira, J. F., Gonçalves, J.F., Lopes, M.P. Dynamic stability metrics for the container loading problem. Transportation Research Part C, 2015, 60, 480-497
20. Sheng, L., Hongxia, Z., Xisong, D., Changjian, C., A heuristic algorithm for container loading of pallets with infill boxes. European Journal of Operational Research, 2016, 252, 728-736
21. Thapatsuwana, P., Pongcharoena, P., Hicksb, C., Chainatec, W. Development of a stochastic optimization tool for solving the multiple container packing problems. International Journal of Production Economics, 2012, 140, 737–748
22. Vazirani, Vijay V. Approximation Algorithms. 1 rd ed.; Springer-Verlag Berlin Heidelberg
23. http://www.cc.gatech.edu/fac/Vijay.Vazirani/book.pdf (Özgün eser 2001 tarihlidir).
24. Wang, N., Lim, A., Zhu, W. A multi-round partial beam search approach for the single container loading problem with shipment priority. International Journal of Production Economics, 2013, 145, 531-540
25. Wei, L., Zhu, W., Lim, A. A goal-driven prototype column generation strategy for the multiple container loading cost minimization problems. European Journal of Operational Research, 2015, 241, 39-49
26. Zhang, D., Peng, Y., Leung, S.C.H. A heuristic block-loading algorithm based on multi-layer search for the container loading problem. Computers & Operations Research, 2012, 39, 2267-2276
27. Zheng, J., Chien, C., Gen, M.,(2015), “Multi-objective multi population biased random-key genetic algorithm for the 3-D container loading problem”, Computers & Industrial Engineering, Volume 89, Pages 80-87.