BibTex RIS Kaynak Göster

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

Yıl 2010, Cilt: 25 Sayı: 4, 0 - , 19.02.2013

Türkay Dereli Gülesin Daş

Ö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

  • 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.
  • Dereli, T., Das, G.S. “A hybrid simulated
  • annealing algorithm for solving multi-objective
  • container loading problems”, Applied Artificial
  • Intelligence, 24, 463-486, 2010.
  • 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,
  • -
  • 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.
  • Eley, M. “Solving container loading problems by
  • block arrangement.” European Journal of
  • Operational Research, 141, 393-409, 2002.
  • Lim, Rodrigues, B., Yang, Y. “3-D Container
  • packing heuristic.” Applied Intelligence, 22,
  • -134, 2005.
  • Wang, Z., Li, K.W., Levy, J.K. “A heuristic for
  • the container loading problem: A tertiary-treebased
  • dynamic space decomposition approach.”
  • European Journal of Operational Research,
  • , 86–99, 2008.
  • George, J.A., Robinson, D.F. “A heuristic for
  • packing boxes into a container.” Computers and
  • Operations Research, 7, 147-156, 1980.
  • Bischoff E.E., Marriott M.D. “A comparative
  • evaluation of heuristics for container loading”,
  • European Journal of Operational Research,
  • , 267-276, 1990.
  • Gehring, H., Menschner, K., Meyer, M.A.
  • “Computer-based heuristic for packing pooled
  • shipment containers”, European Journal of
  • Operational Research, 44, 277-288, 1990.
  • Haessler, R.W., Talbot, F.B. “Load planning for
  • shipments of low density products”, European
  • Journal of Operational Research, 44, 289-299,
  • -
  • 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.
  • Pisinger, D. “Heuristics for the container loading
  • problem”, European Journal of Operational
  • Research, 141, 382-392, 2002.
  • Bortfeldt, A., Gehring, H., Mack, D. “A parallel
  • tabu search algorithm for solving the container
  • loading problem”. Parallel Computing, 29, 641-
  • , 2003.
  • Moura, A., Oliveira J. “A grasp approach to the
  • container-loading problem”. IEEE Intelligent
  • Systems, 50-57, 2005.
  • Huang, W., He, K. “A caving degree approach
  • for the single container loading problem”.
  • European Journal of Operational Research,
  • , 93–101, 2009.
  • Gehring, H., Bortfeldt, A. “A genetic algorithm
  • for solving the container loading problem”.
  • International Transactions in Operational
  • Research, 4, 401-418, 1997.
  • Bortfeldt, A., Gehring, H. “Ein Tabu Search -
  • Verfahren für Containerbeladeprobleme mit
  • schwach heterogenem Kistenvorrat“, OR
  • Spektrum, 20, 237-250, 1998.
  • Faina, L. “A global optimization algorithm for
  • the three-dimensional packing problem”.
  • European Journal of Operational Research,
  • , 340-354, 2000.
  • Bortfeldt, A, Gehring, H. “A hybrid genetic
  • algorithm for the container loading problem”.
  • European Journal of Operational Research,
  • , 143-161, 2001.
  • Gehring, H., Bortfeldt, A. “A parallel genetic
  • algorithm for solving the container loading
  • problem”. International Transactions on
  • Operational Research, 9/4, 497–511, 2002.
  • 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.
  • 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.
  • Liang S.C., Lee, C.Y., Huang S.W. “Hybrid
  • Meta-Heuristic for the Container Loading
  • Problem”. Communications of the IIMA, 7/4,
  • -84, 2007.
  • 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.
  • Dorigo, M. “Optimization, Learning and
  • Natural Algorithms”, PhD Thesis, Politecnico
  • di Milano, Italy, 1992.
  • 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.
  • Cordon, O., Herrera, F., Stützle, T. “A Review on
  • the Ant Colony Optimization Metaheuristic:
  • Basis, Models and Trends”, Mathware & Soft
  • Computing, 9, 2002.
  • Socha, K, Dorigo, M. “Ant colony optimization
  • for continuous domains”. European Journal of
  • Operational Research, 185, 1155–1173, 2008.
  • Dorigo, M., Di Caro, G., Gambardella, L. M.
  • “Ant algorithms for discrete optimization”.
  • Artificial Life, 5/2, 137-172, 1999.
  • Dorigo, M., Gambardella, L.M. “Ant Colony
  • System: A Cooperative Learning Approach to the
  • Traveling Salesman Problem”. IEEE
  • Transactions on Evolutionary Computation, 1,
  • , 53-66, 1997.
  • Perretto, M., Lopes, H.S. “Reconstruction of
  • phylogenetic trees using the ant colony
  • optimization paradigm”. Genetics and
  • Molecular Research, 4/3, 581-589, 2005.
  • 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.
  • http://www.scholarpedia.org/article/Ant_colony_
  • optimization
  • 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,
  • -
  • 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,
  • -
  • Engelbrecht, A.P. Fundamentals of
  • Computational Swarm Intelligence, Wiley,
  • -
  • Levine, J., Ducatelle, F. “Ant colony optimisation
  • for bin packing and cutting stock problems”.
  • Journal of Operational Research Society, 55,
  • -716, 2004.
  • He, K., Huang, W. “Solving the single container
  • loading problem by a fast heuristic method”.
  • Optimization Methods and Software, 1-15,
  • -
  • Montgomery, D.C. Design and analysis of
  • experiments. John Wiley & Sons, New York,
  • -
  • 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.
  • Loh, H. T., Nee, A. Y. C. “A packing algorithm
  • for hexahedral boxes”. Proceedings of the
  • Industrial Automation Conference, Singapore,
  • , 115-126, 1992.
  • Bischoff, E.E., Janetz, F., Ratcliff, M.S.W.
  • “Loading pallets with non-identical items”.
  • European Journal of Operational Research,
  • , 681-692, 1995.
  • Bischoff, E.E. “Dealing with load bearing
  • strength considerations in container loading
  • problems”. Technical Report, European
  • Business Management School. University of
  • Wales, Swansea, 2003.
  • 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 –
  • , 2008.
  • 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-
  • , 25 (2), 138-147, 2010.

Yıl 2010, Cilt: 25 Sayı: 4, 0 - , 19.02.2013

Türkay Dereli Gülesin Daş

Öz

Kaynakça

  • 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.
  • Dereli, T., Das, G.S. “A hybrid simulated
  • annealing algorithm for solving multi-objective
  • container loading problems”, Applied Artificial
  • Intelligence, 24, 463-486, 2010.
  • 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,
  • -
  • 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.
  • Eley, M. “Solving container loading problems by
  • block arrangement.” European Journal of
  • Operational Research, 141, 393-409, 2002.
  • Lim, Rodrigues, B., Yang, Y. “3-D Container
  • packing heuristic.” Applied Intelligence, 22,
  • -134, 2005.
  • Wang, Z., Li, K.W., Levy, J.K. “A heuristic for
  • the container loading problem: A tertiary-treebased
  • dynamic space decomposition approach.”
  • European Journal of Operational Research,
  • , 86–99, 2008.
  • George, J.A., Robinson, D.F. “A heuristic for
  • packing boxes into a container.” Computers and
  • Operations Research, 7, 147-156, 1980.
  • Bischoff E.E., Marriott M.D. “A comparative
  • evaluation of heuristics for container loading”,
  • European Journal of Operational Research,
  • , 267-276, 1990.
  • Gehring, H., Menschner, K., Meyer, M.A.
  • “Computer-based heuristic for packing pooled
  • shipment containers”, European Journal of
  • Operational Research, 44, 277-288, 1990.
  • Haessler, R.W., Talbot, F.B. “Load planning for
  • shipments of low density products”, European
  • Journal of Operational Research, 44, 289-299,
  • -
  • 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.
  • Pisinger, D. “Heuristics for the container loading
  • problem”, European Journal of Operational
  • Research, 141, 382-392, 2002.
  • Bortfeldt, A., Gehring, H., Mack, D. “A parallel
  • tabu search algorithm for solving the container
  • loading problem”. Parallel Computing, 29, 641-
  • , 2003.
  • Moura, A., Oliveira J. “A grasp approach to the
  • container-loading problem”. IEEE Intelligent
  • Systems, 50-57, 2005.
  • Huang, W., He, K. “A caving degree approach
  • for the single container loading problem”.
  • European Journal of Operational Research,
  • , 93–101, 2009.
  • Gehring, H., Bortfeldt, A. “A genetic algorithm
  • for solving the container loading problem”.
  • International Transactions in Operational
  • Research, 4, 401-418, 1997.
  • Bortfeldt, A., Gehring, H. “Ein Tabu Search -
  • Verfahren für Containerbeladeprobleme mit
  • schwach heterogenem Kistenvorrat“, OR
  • Spektrum, 20, 237-250, 1998.
  • Faina, L. “A global optimization algorithm for
  • the three-dimensional packing problem”.
  • European Journal of Operational Research,
  • , 340-354, 2000.
  • Bortfeldt, A, Gehring, H. “A hybrid genetic
  • algorithm for the container loading problem”.
  • European Journal of Operational Research,
  • , 143-161, 2001.
  • Gehring, H., Bortfeldt, A. “A parallel genetic
  • algorithm for solving the container loading
  • problem”. International Transactions on
  • Operational Research, 9/4, 497–511, 2002.
  • 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.
  • 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.
  • Liang S.C., Lee, C.Y., Huang S.W. “Hybrid
  • Meta-Heuristic for the Container Loading
  • Problem”. Communications of the IIMA, 7/4,
  • -84, 2007.
  • 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.
  • Dorigo, M. “Optimization, Learning and
  • Natural Algorithms”, PhD Thesis, Politecnico
  • di Milano, Italy, 1992.
  • 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.
  • Cordon, O., Herrera, F., Stützle, T. “A Review on
  • the Ant Colony Optimization Metaheuristic:
  • Basis, Models and Trends”, Mathware & Soft
  • Computing, 9, 2002.
  • Socha, K, Dorigo, M. “Ant colony optimization
  • for continuous domains”. European Journal of
  • Operational Research, 185, 1155–1173, 2008.
  • Dorigo, M., Di Caro, G., Gambardella, L. M.
  • “Ant algorithms for discrete optimization”.
  • Artificial Life, 5/2, 137-172, 1999.
  • Dorigo, M., Gambardella, L.M. “Ant Colony
  • System: A Cooperative Learning Approach to the
  • Traveling Salesman Problem”. IEEE
  • Transactions on Evolutionary Computation, 1,
  • , 53-66, 1997.
  • Perretto, M., Lopes, H.S. “Reconstruction of
  • phylogenetic trees using the ant colony
  • optimization paradigm”. Genetics and
  • Molecular Research, 4/3, 581-589, 2005.
  • 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.
  • http://www.scholarpedia.org/article/Ant_colony_
  • optimization
  • 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,
  • -
  • 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,
  • -
  • Engelbrecht, A.P. Fundamentals of
  • Computational Swarm Intelligence, Wiley,
  • -
  • Levine, J., Ducatelle, F. “Ant colony optimisation
  • for bin packing and cutting stock problems”.
  • Journal of Operational Research Society, 55,
  • -716, 2004.
  • He, K., Huang, W. “Solving the single container
  • loading problem by a fast heuristic method”.
  • Optimization Methods and Software, 1-15,
  • -
  • Montgomery, D.C. Design and analysis of
  • experiments. John Wiley & Sons, New York,
  • -
  • 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.
  • Loh, H. T., Nee, A. Y. C. “A packing algorithm
  • for hexahedral boxes”. Proceedings of the
  • Industrial Automation Conference, Singapore,
  • , 115-126, 1992.
  • Bischoff, E.E., Janetz, F., Ratcliff, M.S.W.
  • “Loading pallets with non-identical items”.
  • European Journal of Operational Research,
  • , 681-692, 1995.
  • Bischoff, E.E. “Dealing with load bearing
  • strength considerations in container loading
  • problems”. Technical Report, European
  • Business Management School. University of
  • Wales, Swansea, 2003.
  • 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 –
  • , 2008.
  • 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-
  • , 25 (2), 138-147, 2010.
Toplam 189 adet kaynakça vardır.

Ayrıntılar

Birincil Dil Türkçe
Bölüm Makaleler
Yazarlar

Türkay Dereli Bu kişi benim

Gülesin Daş Bu kişi benim

Yayımlanma Tarihi 19 Şubat 2013
Gönderilme Tarihi 19 Şubat 2013
Yayımlandığı Sayı Yıl 2010 Cilt: 25 Sayı: 4

Kaynak Göster

APA Dereli, T., & Daş, G. (2013). KONTEYNER YÜKLEME PROBLEMLERİ İÇİN KARINCA KOLONİSİ OPTİMİZASYONU YAKLAŞIMI. Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi, 25(4).
AMA Dereli T, Daş G. KONTEYNER YÜKLEME PROBLEMLERİ İÇİN KARINCA KOLONİSİ OPTİMİZASYONU YAKLAŞIMI. GUMMFD. Mart 2013;25(4).
Chicago Dereli, Türkay, ve Gülesin Daş. “KONTEYNER YÜKLEME PROBLEMLERİ İÇİN KARINCA KOLONİSİ OPTİMİZASYONU YAKLAŞIMI”. Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi 25, sy. 4 (Mart 2013).
EndNote Dereli T, Daş G (01 Mart 2013) KONTEYNER YÜKLEME PROBLEMLERİ İÇİN KARINCA KOLONİSİ OPTİMİZASYONU YAKLAŞIMI. Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi 25 4
IEEE T. Dereli ve G. Daş, “KONTEYNER YÜKLEME PROBLEMLERİ İÇİN KARINCA KOLONİSİ OPTİMİZASYONU YAKLAŞIMI”, GUMMFD, c. 25, sy. 4, 2013.
ISNAD Dereli, Türkay - Daş, Gülesin. “KONTEYNER YÜKLEME PROBLEMLERİ İÇİN KARINCA KOLONİSİ OPTİMİZASYONU YAKLAŞIMI”. Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi 25/4 (Mart 2013).
JAMA Dereli T, Daş G. KONTEYNER YÜKLEME PROBLEMLERİ İÇİN KARINCA KOLONİSİ OPTİMİZASYONU YAKLAŞIMI. GUMMFD. 2013;25.
MLA Dereli, Türkay ve Gülesin Daş. “KONTEYNER YÜKLEME PROBLEMLERİ İÇİN KARINCA KOLONİSİ OPTİMİZASYONU YAKLAŞIMI”. Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi, c. 25, sy. 4, 2013.
Vancouver Dereli T, Daş G. KONTEYNER YÜKLEME PROBLEMLERİ İÇİN KARINCA KOLONİSİ OPTİMİZASYONU YAKLAŞIMI. GUMMFD. 2013;25(4).