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

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.

Ant colony optimization approach for container loading problems

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.

PDF

___

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, A. “A genetic algorithm for solving the container loading problem”. International Transactions in Operational Research, 4, 401-418, 1997.
18. Bortfeldt, A., Gehring, H. “Ein Tabu Search - Verfahren für Containerbeladeprobleme mit schwach heterogenem Kistenvorrat“, OR Spektrum, 20, 237-250, 1998.
19. Faina, L. “A global optimization algorithm for the three-dimensional packing problem”. European Journal of Operational Research, 126, 340-354, 2000.
20. Bortfeldt, A, Gehring, H. “A hybrid genetic algorithm for the container loading problem”. European Journal of Operational Research, 131, 143-161, 2001.
21. Gehring, H., Bortfeldt, A. “A parallel genetic algorithm for solving the container loading problem”. International Transactions on Operational Research, 9/4, 497–511, 2002.
22. Mack, D., Bortfeldt, A., Gehring, H., “A parallel hybrid local search algorithm for the container loading problem”. International Transactions in Operational Research, 11, 511-533, 2004.
23. Yeung, L.H.W, Tang, W.K.S. “A hybrid genetic approach for container loading in logistics industry”. IEEE Transactions on Industrial Engineering, 52, 617-627, 2005.
24. Liang S.C., Lee, C.Y., Huang S.W. “Hybrid Meta-Heuristic for the Container Loading Problem”. Communications of the IIMA, 7/4, 73-84, 2007.
25. Dereli, T., Seçkiner, S.U., Daş, G.S., Gökçen, H., Aydın, M.E. “An exploration of the literature on the use of ‘swarm intelligence-based techniques’ for public service problems”. European Journal of Industrial Engineering, 3, 379-423, 2009.
26. Dorigo, M. “Optimization, Learning and Natural Algorithms”, PhD Thesis, Politecnico di Milano, Italy, 1992.
27. Zhao, P., Zhao, P., Zhang X. “A new ant colony optimization for the knapsack problem”. 7th International Conference on Computer-Aided Industrial Design and Conceptual Design CAIDCD '06, 2006.
28. Cordon, O., Herrera, F., Stützle, T. “A Review on the Ant Colony Optimization Metaheuristic: Basis, Models and Trends”, Mathware & Soft Computing, 9, 2002.
29. Socha, K, Dorigo, M. “Ant colony optimization for continuous domains”. European Journal of Operational Research, 185, 1155–1173, 2008.
30. Dorigo, M., Di Caro, G., Gambardella, L. M. “Ant algorithms for discrete optimization”. Artificial Life, 5/2, 137-172, 1999.
31. Dorigo, M., Gambardella, L.M. “Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem”. IEEE Transactions on Evolutionary Computation, 1, 1, 53-66, 1997.
32. Perretto, M., Lopes, H.S. “Reconstruction of phylogenetic trees using the ant colony optimization paradigm”. Genetics and Molecular Research, 4/3, 581-589, 2005.
33. Dorigo, M., Maniezzo, V., Colorni, A. “Ant system: optimization by a colony of cooperating agents”, IEEE Transactions on Systems, Man, and Cybernetics-Part B, 26 (1), 29-41, 1996.
34. http://www.scholarpedia.org/article/Ant_colony_ optimization
35. Keskintürk, T., Söyler, H. “Global ant colony optimization (Global karınca kolonisi optimizasyonu)”, Journal of the Faculty of Engineering and Architecture of Gazi University. (Gazi Üniversitesi Mühendislik – Mimarlık Fakültesi Dergisi), 21 (4), 689-698, 2006.
36. Alaykıran, K, Engin, O. “Karınca kolonileri meta-sezgiseli ve gezgin satıcı problemleri üzerinde bir uygulaması (Ant colony metaheuristic and an application on traveling salesman problem)”, Journal of Faculty of the Engineering and Architecture of Gazi University. (Gazi Üniversitesi Mühendislik – Mimarlık Fakültesi Dergisi), 20 (1), 69-76, 2005.
37. Engelbrecht, A.P. Fundamentals of Computational Swarm Intelligence, Wiley, 2005.
38. Levine, J., Ducatelle, F. “Ant colony optimisation for bin packing and cutting stock problems”. Journal of Operational Research Society, 55, 705-716, 2004.
39. He, K., Huang, W. “Solving the single container loading problem by a fast heuristic method”. Optimization Methods and Software, 1-15, 2009.
40. Montgomery, D.C. Design and analysis of experiments. John Wiley & Sons, New York, 1991.
41. Bischoff, E.E., Ratcliff, M.S.W. “Issues in the development of approaches to container loading”. Omega – International Journal of Management Science, 23/4, 337-390, 1995.
42. Loh, H. T., Nee, A. Y. C. “A packing algorithm for hexahedral boxes”. Proceedings of the Industrial Automation Conference, Singapore, 2, 115-126, 1992.
43. Bischoff, E.E., Janetz, F., Ratcliff, M.S.W. “Loading pallets with non-identical items”. European Journal of Operational Research, 84, 681-692, 1995.
44. Bischoff, E.E. “Dealing with load bearing strength considerations in container loading problems”. Technical Report, European Business Management School. University of Wales, Swansea, 2003.
45. Luo, D., Wu, S., Li, M., Yang, Z. “Ant Colony Optimization with Local Search Applied to the Flexible Job Shop Scheduling Problems”. Proceedings of ICCCAS 2008 - IEEE, 1015 – 1020, 2008.
46. Dereli, T., Das, G.S., “Development of a decision support system for solving container loading problems”, TRANSPORT, Research Journal of Vilnius Gediminas Technical University and Lithuanian Academy of Sciences, ISSN 1648- 4142, 25 (2), 138-147, 2010.