KONTEYNER YÜKLEME PROBLEMLERİ İÇİN KARINCA KOLONİSİ OPTİMİZASYONU YAKLAŞIMI

Öz

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.

Anahtar Kelimeler

• Konteyner yükleme, karınca kolonisi, optimizasyon

Kaynakça

1. van de Voort, M., O'Brien, K.A., Rahman, A.,
2. Valeri, L. Seacurity: Improving the Security of
3. the Global Sea-Container Shipping System,
4. Rand., 2003.
5. Dereli, T., Das, G.S. “A hybrid simulated
6. annealing algorithm for solving multi-objective
7. container loading problems”, Applied Artificial
8. Intelligence, 24, 463-486, 2010.

9. Dereli, T., Daş, G.S. “A hybrid simulated
10. annealing algorithm for two-dimensional strip
11. packing problems”. Adaptive and Natural
12. Computing Algorithms, Part 1, 4431, 508-516,
13. -
14. Morabito, R.N., Arenales, M.N. “An and-or
15. graph approach to the container loading
16. problem.” International Transactions in
17. Operational Research, 1, 59-73, 1994.
18. Eley, M. “Solving container loading problems by
19. block arrangement.” European Journal of
20. Operational Research, 141, 393-409, 2002.
21. Lim, Rodrigues, B., Yang, Y. “3-D Container
22. packing heuristic.” Applied Intelligence, 22,
23. -134, 2005.
24. Wang, Z., Li, K.W., Levy, J.K. “A heuristic for
25. the container loading problem: A tertiary-treebased
26. dynamic space decomposition approach.”
27. European Journal of Operational Research,
28. , 86–99, 2008.
29. George, J.A., Robinson, D.F. “A heuristic for
30. packing boxes into a container.” Computers and
31. Operations Research, 7, 147-156, 1980.
32. Bischoff E.E., Marriott M.D. “A comparative
33. evaluation of heuristics for container loading”,
34. European Journal of Operational Research,
35. , 267-276, 1990.
36. Gehring, H., Menschner, K., Meyer, M.A.
37. “Computer-based heuristic for packing pooled
38. shipment containers”, European Journal of
39. Operational Research, 44, 277-288, 1990.
40. Haessler, R.W., Talbot, F.B. “Load planning for
41. shipments of low density products”, European
42. Journal of Operational Research, 44, 289-299,
43. -
44. Ngoi, B.K.A., Tay, M.L., Chua, E.S., “Applying
45. spatial representation techniques to the container
46. packing problem”, International Journal of
47. Production Research, 32/1, 111-123, 1994.
48. Pisinger, D. “Heuristics for the container loading
49. problem”, European Journal of Operational
50. Research, 141, 382-392, 2002.
51. Bortfeldt, A., Gehring, H., Mack, D. “A parallel
52. tabu search algorithm for solving the container
53. loading problem”. Parallel Computing, 29, 641-
54. , 2003.
55. Moura, A., Oliveira J. “A grasp approach to the
56. container-loading problem”. IEEE Intelligent
57. Systems, 50-57, 2005.
58. Huang, W., He, K. “A caving degree approach
59. for the single container loading problem”.
60. European Journal of Operational Research,
61. , 93–101, 2009.
62. Gehring, H., Bortfeldt, A. “A genetic algorithm
63. for solving the container loading problem”.
64. International Transactions in Operational
65. Research, 4, 401-418, 1997.
66. Bortfeldt, A., Gehring, H. “Ein Tabu Search -
67. Verfahren für Containerbeladeprobleme mit
68. schwach heterogenem Kistenvorrat“, OR
69. Spektrum, 20, 237-250, 1998.
70. Faina, L. “A global optimization algorithm for
71. the three-dimensional packing problem”.
72. European Journal of Operational Research,
73. , 340-354, 2000.
74. Bortfeldt, A, Gehring, H. “A hybrid genetic
75. algorithm for the container loading problem”.
76. European Journal of Operational Research,
77. , 143-161, 2001.
78. Gehring, H., Bortfeldt, A. “A parallel genetic
79. algorithm for solving the container loading
80. problem”. International Transactions on
81. Operational Research, 9/4, 497–511, 2002.
82. Mack, D., Bortfeldt, A., Gehring, H., “A parallel
83. hybrid local search algorithm for the container
84. loading problem”. International Transactions
85. in Operational Research, 11, 511-533, 2004.
86. Yeung, L.H.W, Tang, W.K.S. “A hybrid genetic
87. approach for container loading in logistics
88. industry”. IEEE Transactions on Industrial
89. Engineering, 52, 617-627, 2005.
90. Liang S.C., Lee, C.Y., Huang S.W. “Hybrid
91. Meta-Heuristic for the Container Loading
92. Problem”. Communications of the IIMA, 7/4,
93. -84, 2007.
94. Dereli, T., Seçkiner, S.U., Daş, G.S., Gökçen, H.,
95. Aydın, M.E. “An exploration of the literature on
96. the use of ‘swarm intelligence-based techniques’
97. for public service problems”. European Journal
98. of Industrial Engineering, 3, 379-423, 2009.
99. Dorigo, M. “Optimization, Learning and
100. Natural Algorithms”, PhD Thesis, Politecnico
101. di Milano, Italy, 1992.
102. Zhao, P., Zhao, P., Zhang X. “A new ant colony
103. optimization for the knapsack problem”. 7th
104. International Conference on Computer-Aided
105. Industrial Design and Conceptual Design
106. CAIDCD '06, 2006.
107. Cordon, O., Herrera, F., Stützle, T. “A Review on
108. the Ant Colony Optimization Metaheuristic:
109. Basis, Models and Trends”, Mathware & Soft
110. Computing, 9, 2002.
111. Socha, K, Dorigo, M. “Ant colony optimization
112. for continuous domains”. European Journal of
113. Operational Research, 185, 1155–1173, 2008.
114. Dorigo, M., Di Caro, G., Gambardella, L. M.
115. “Ant algorithms for discrete optimization”.
116. Artificial Life, 5/2, 137-172, 1999.
117. Dorigo, M., Gambardella, L.M. “Ant Colony
118. System: A Cooperative Learning Approach to the
119. Traveling Salesman Problem”. IEEE
120. Transactions on Evolutionary Computation, 1,
121. , 53-66, 1997.
122. Perretto, M., Lopes, H.S. “Reconstruction of
123. phylogenetic trees using the ant colony
124. optimization paradigm”. Genetics and
125. Molecular Research, 4/3, 581-589, 2005.
126. Dorigo, M., Maniezzo, V., Colorni, A. “Ant
127. system: optimization by a colony of cooperating
128. agents”, IEEE Transactions on Systems, Man,
129. and Cybernetics-Part B, 26 (1), 29-41, 1996.
130. http://www.scholarpedia.org/article/Ant_colony_
131. optimization
132. Keskintürk, T., Söyler, H. “Global ant colony
133. optimization (Global karınca kolonisi
134. optimizasyonu)”, Journal of the Faculty of
135. Engineering and Architecture of Gazi
136. University. (Gazi Üniversitesi Mühendislik –
137. Mimarlık Fakültesi Dergisi), 21 (4), 689-698,
138. -
139. Alaykıran, K, Engin, O. “Karınca kolonileri
140. meta-sezgiseli ve gezgin satıcı problemleri
141. üzerinde bir uygulaması (Ant colony
142. metaheuristic and an application on traveling
143. salesman problem)”, Journal of Faculty of the
144. Engineering and Architecture of Gazi
145. University. (Gazi Üniversitesi Mühendislik –
146. Mimarlık Fakültesi Dergisi), 20 (1), 69-76,
147. -
148. Engelbrecht, A.P. Fundamentals of
149. Computational Swarm Intelligence, Wiley,
150. -
151. Levine, J., Ducatelle, F. “Ant colony optimisation
152. for bin packing and cutting stock problems”.
153. Journal of Operational Research Society, 55,
154. -716, 2004.
155. He, K., Huang, W. “Solving the single container
156. loading problem by a fast heuristic method”.
157. Optimization Methods and Software, 1-15,
158. -
159. Montgomery, D.C. Design and analysis of
160. experiments. John Wiley & Sons, New York,
161. -
162. Bischoff, E.E., Ratcliff, M.S.W. “Issues in the
163. development of approaches to container loading”.
164. Omega – International Journal of
165. Management Science, 23/4, 337-390, 1995.
166. Loh, H. T., Nee, A. Y. C. “A packing algorithm
167. for hexahedral boxes”. Proceedings of the
168. Industrial Automation Conference, Singapore,
169. , 115-126, 1992.
170. Bischoff, E.E., Janetz, F., Ratcliff, M.S.W.
171. “Loading pallets with non-identical items”.
172. European Journal of Operational Research,
173. , 681-692, 1995.
174. Bischoff, E.E. “Dealing with load bearing
175. strength considerations in container loading
176. problems”. Technical Report, European
177. Business Management School. University of
178. Wales, Swansea, 2003.
179. Luo, D., Wu, S., Li, M., Yang, Z. “Ant Colony
180. Optimization with Local Search Applied to the
181. Flexible Job Shop Scheduling Problems”.
182. Proceedings of ICCCAS 2008 - IEEE, 1015 –
183. , 2008.
184. Dereli, T., Das, G.S., “Development of a decision
185. support system for solving container loading
186. problems”, TRANSPORT, Research Journal of
187. Vilnius Gediminas Technical University and
188. Lithuanian Academy of Sciences, ISSN 1648-
189. , 25 (2), 138-147, 2010.